{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/dag-net-double-attentive-graph-neural-network","title":"DAG-Net: Double Attentive Graph Neural Network for Trajectory Forecasting","arxiv_id":"2005.12661","date":"2020-05-26","proceeding":null,"authors":["Alessio Monti","Alessia Bertugli","Simone Calderara","Rita Cucchiara"],"abstract":"Understanding human motion behaviour is a critical task for several possible applications like self-driving cars or social robots, and in general for all those settings where an autonomous agent has to navigate inside a human-centric environment. This is non-trivial because human motion is inherently multi-modal: given a history of human motion paths, there are many plausible ways by which people could move in the future. Additionally, people activities are often driven by goals, e.g. reaching particular locations or interacting with the environment. We address the aforementioned aspects by proposing a new recurrent generative model that considers both single agents' future goals and interactions between different agents. The model exploits a double attention-based graph neural network to collect information about the mutual influences among different agents and to integrate it with data about agents' possible future objectives. Our proposal is general enough to be applied to different scenarios: the model achieves state-of-the-art results in both urban environments and also in sports applications.","url_abs":"https://arxiv.org/abs/2005.12661v2","url_pdf":"https://arxiv.org/pdf/2005.12661v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"dag-net-double-attentive-graph-neural-network","repo_url":"https://github.com/alexmonti19/dagnet","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"human-motion-prediction","task_name":"Human motion prediction"},{"task_slug":"multi-future-trajectory-prediction","task_name":"Multi-future Trajectory Prediction"},{"task_slug":"navigate","task_name":"Navigate"},{"task_slug":"time-series-prediction","task_name":"Time Series Prediction"},{"task_slug":"trajectory-forecasting","task_name":"Trajectory Forecasting"},{"task_slug":"trajectory-prediction","task_name":"Trajectory Prediction"}],"methods":[{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/trajectory-prediction-on-stats-sportvu-nba","task":"Trajectory Prediction","dataset":"STATS SportVu NBA [ATK]","model":"DAG-Net","rank_in_archive_order":1,"of":1,"metrics":{"ADE":"9.18","FDE":"13.54"},"uses_additional_data":false},{"leaderboard":"/sota/trajectory-prediction-on-stats-sportvu-nba-1","task":"Trajectory Prediction","dataset":"STATS SportVu NBA [DEF]","model":"DAG-Net","rank_in_archive_order":1,"of":1,"metrics":{"ADE":"7.01","FDE":"9.76"},"uses_additional_data":false},{"leaderboard":"/sota/trajectory-prediction-on-stanford-drone","task":"Trajectory Prediction","dataset":"Stanford Drone","model":"DAG-Net","rank_in_archive_order":23,"of":24,"metrics":{"ADE (in world coordinates)":"0.54","FDE (in world coordinates)":"1.05"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2005.12661","atlas_url":"https://app.syntology.ai/?focus=2005.12661","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2005.12661"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2005.12661\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2005.12661"},"call":"get_concepts_for_paper(arxiv_id=\"2005.12661\")"}],"by_repo":[{"repo":"alexmonti19/dagnet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"3af4f820cf86c57dd5c381a9876ff933536a577dc7365d1fb9b10af9827c5e30","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}