{"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/leveraging-future-relationship-reasoning-for","title":"Leveraging Future Relationship Reasoning for Vehicle Trajectory Prediction","arxiv_id":"2305.14715","date":"2023-05-24","proceeding":null,"authors":["Daehee Park","Hobin Ryu","Yunseo Yang","Jegyeong Cho","Jiwon Kim","Kuk-Jin Yoon"],"abstract":"Understanding the interaction between multiple agents is crucial for realistic vehicle trajectory prediction. Existing methods have attempted to infer the interaction from the observed past trajectories of agents using pooling, attention, or graph-based methods, which rely on a deterministic approach. However, these methods can fail under complex road structures, as they cannot predict various interactions that may occur in the future. In this paper, we propose a novel approach that uses lane information to predict a stochastic future relationship among agents. To obtain a coarse future motion of agents, our method first predicts the probability of lane-level waypoint occupancy of vehicles. We then utilize the temporal probability of passing adjacent lanes for each agent pair, assuming that agents passing adjacent lanes will highly interact. We also model the interaction using a probabilistic distribution, which allows for multiple possible future interactions. The distribution is learned from the posterior distribution of interaction obtained from ground truth future trajectories. We validate our method on popular trajectory prediction datasets: nuScenes and Argoverse. The results show that the proposed method brings remarkable performance gain in prediction accuracy, and achieves state-of-the-art performance in long-term prediction benchmark dataset.","url_abs":"https://arxiv.org/abs/2305.14715v1","url_pdf":"https://arxiv.org/pdf/2305.14715v1.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":[],"tasks":[{"task_slug":"motion-forecasting","task_name":"Motion Forecasting"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"trajectory-prediction","task_name":"Trajectory Prediction"}],"methods":[{"method_slug":"fail","method_name":"fail"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/motion-forecasting-on-argoverse-cvpr-2020","task":"Motion Forecasting","dataset":"Argoverse CVPR 2020","model":"FRM","rank_in_archive_order":56,"of":299,"metrics":{"DAC (K=6)":"0.9878","MR (K=1)":"0.5728","MR (K=6)":"0.143","brier-minFDE (K=6)":"1.9365","minADE (K=1)":"1.7063","minADE (K=6)":"0.8165","minFDE (K=1)":"3.7486","minFDE (K=6)":"1.2671"},"uses_additional_data":false},{"leaderboard":"/sota/trajectory-prediction-on-nuscenes","task":"Trajectory Prediction","dataset":"nuScenes","model":"FRM","rank_in_archive_order":4,"of":34,"metrics":{"MinADE_10":"0.88","MinADE_5":"1.18","MinFDE_1":"6.59","MissRateTopK_2_10":"0.30","MissRateTopK_2_5":"0.48","OffRoadRate":"0.02"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2305.14715","atlas_url":"https://app.syntology.ai/?focus=2305.14715","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":"2305.14715"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2305.14715\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2305.14715"},"call":"get_concepts_for_paper(arxiv_id=\"2305.14715\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"42a21bf87fd390668d6a448e7c8f8b5e4c389e8e5a6a9e8a3ef52a743c3b623f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}