{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/learning-lane-graph-representations-for","title":"Learning Lane Graph Representations for Motion Forecasting","arxiv_id":"2007.13732","date":"2020-07-27","proceeding":"ECCV 2020 8","authors":["Ming Liang","Bin Yang","Rui Hu","Yun Chen","Renjie Liao","Song Feng","Raquel Urtasun"],"abstract":"We propose a motion forecasting model that exploits a novel structured map representation as well as actor-map interactions. Instead of encoding vectorized maps as raster images, we construct a lane graph from raw map data to explicitly preserve the map structure. To capture the complex topology and long range dependencies of the lane graph, we propose LaneGCN which extends graph convolutions with multiple adjacency matrices and along-lane dilation. To capture the complex interactions between actors and maps, we exploit a fusion network consisting of four types of interactions, actor-to-lane, lane-to-lane, lane-to-actor and actor-to-actor. Powered by LaneGCN and actor-map interactions, our model is able to predict accurate and realistic multi-modal trajectories. Our approach significantly outperforms the state-of-the-art on the large scale Argoverse motion forecasting benchmark.","url_abs":"https://arxiv.org/abs/2007.13732v1","url_pdf":"https://arxiv.org/pdf/2007.13732v1.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":"learning-lane-graph-representations-for","repo_url":"https://github.com/uber-research/LaneGCN","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-lane-graph-representations-for","repo_url":"https://github.com/mediabrain-sjtu/collaborative-uncertainty","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"motion-forecasting","task_name":"Motion Forecasting"},{"task_slug":"trajectory-prediction","task_name":"Trajectory Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2007.13732","atlas_url":"https://app.syntology.ai/?focus=2007.13732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.13732"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/uber-research/LaneGCN","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mediabrain-sjtu/collaborative-uncertainty","reach":null}],"summary":{"ran_draft_wrong":1,"ran_fixture":1,"unverified":1},"by_repo_kind":{"official":{"samples":3,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"159574b76ad7cfe8","entry":"graph_gather","repo":"uber-research/LaneGCN","repo_kind":"official","path":"lanegcn.py","file_url":"https://github.com/uber-research/LaneGCN/blob/HEAD/lanegcn.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"159574b76ad7cfe8"}},{"code_sha256_prefix":"2f262d1ccfd88465","entry":"pred_metrics","repo":"uber-research/LaneGCN","repo_kind":"official","path":"lanegcn.py","file_url":"https://github.com/uber-research/LaneGCN/blob/HEAD/lanegcn.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"2f262d1ccfd88465"}},{"code_sha256_prefix":"cbde50eafa891f8c","entry":"actor_gather","repo":"uber-research/LaneGCN","repo_kind":"official","path":"lanegcn.py","file_url":"https://github.com/uber-research/LaneGCN/blob/HEAD/lanegcn.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"cbde50eafa891f8c"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}