{"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":"/task/motion-planning","name":"Motion Planning","slug":"motion-planning","description_markdown":"<span style=\"color:grey; opacity: 0.6\">( Image credit: [Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learning](https://arxiv.org/pdf/1805.01956v1.pdf) )</span>","categories":[{"name":"Robots","url":"/area/robots"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":920,"papers_with_code":252,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":5,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/motion-planning-on-nuscenes","slug":"motion-planning-on-nuscenes","dataset":"nuScenes","dataset_url":"/dataset/nuscenes","rows_in_archive":1,"metrics":["Collision","L2"],"first_row_in_archive_order":{"model":"GPT-Driver","paper_title":"GPT-Driver: Learning to Drive with GPT","paper_url":"/paper/gpt-driver-learning-to-drive-with-gpt","paper_date":"2023-10-02","arxiv_id":"2310.01415","code_links":[{"title":"pointscoder/gpt-driver","url":"https://github.com/pointscoder/gpt-driver"}],"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gpt-driver-learning-to-drive-with-gpt#ran","syntology_url":"https://syntology.ai/paper/2310.01415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01415"}},"official":{"repos":["pointscoder/gpt-driver"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}}],"datasets":[{"url":"/dataset/nuscenes","name":"nuScenes","full_name":"","num_papers_in_archive":2139},{"url":"/dataset/houseexpo","name":"HouseExpo","full_name":"","num_papers_in_archive":11},{"url":"/dataset/motion-policy-networks","name":"Motion Policy Networks","full_name":"","num_papers_in_archive":3},{"url":"/dataset/threedworld-transport-challenge","name":"ThreeDWorld Transport Challenge","full_name":"","num_papers_in_archive":3},{"url":"/dataset/pushworld","name":"PushWorld","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":10,"rows_per_page":100,"shown":100,"of":920,"of_with_code":252,"tagged_in_all":920,"counts":{"archive_papers_tagged":920,"with_a_code_link":252,"where_syntology_ran_a_sample":59,"not_listed_spam_title":0,"listed":920,"listed_where_code_ran":59,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":46,"every_run_a_failure_of_syntologys_instrument":13,"listed_with_a_run_with_no_instrument_failure":46,"listed_every_run_a_failure_of_syntologys_instrument":13,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/complex-yolo-real-time-3d-object-detection-on","slug":"complex-yolo-real-time-3d-object-detection-on","title":"Complex-YOLO: Real-time 3D Object Detection on Point Clouds","date":"2018-03-16","arxiv_id":"1803.06199","repositories_listed":10,"syntology":null},{"url":"/paper/learning-latent-dynamics-for-planning-from","slug":"learning-latent-dynamics-for-planning-from","title":"Learning Latent Dynamics for Planning from Pixels","date":"2018-11-12","arxiv_id":"1811.04551","repositories_listed":9,"syntology":{"n":7,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-latent-dynamics-for-planning-from#ran","syntology_url":"https://syntology.ai/paper/1811.04551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04551"}},"official":{"repos":["google-research/planet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/motion-planning-among-dynamic-decision-making","slug":"motion-planning-among-dynamic-decision-making","title":"Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learning","date":"2018-05-04","arxiv_id":"1805.01956","repositories_listed":6,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/motion-planning-among-dynamic-decision-making#ran","syntology_url":"https://syntology.ai/paper/1805.01956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.01956"}},"official":{"repos":["mfe7/cadrl_ros"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/sigmarl-a-sample-efficient-and-generalizable","slug":"sigmarl-a-sample-efficient-and-generalizable","title":"SigmaRL: A Sample-Efficient and Generalizable Multi-Agent Reinforcement Learning Framework for Motion Planning","date":"2024-08-14","arxiv_id":"2408.07644","repositories_listed":4,"syntology":null},{"url":"/paper/formation-control-for-multiple-connected-and","slug":"formation-control-for-multiple-connected-and","title":"Formation Control for Connected and Automated Vehicles on Multi-lane Roads: Relative Motion Planning and Conflict Resolution","date":"2021-03-18","arxiv_id":"2103.10287","repositories_listed":4,"syntology":null},{"url":"/paper/neural-contraction-metrics-for-robust","slug":"neural-contraction-metrics-for-robust","title":"Neural Contraction Metrics for Robust Estimation and Control: A Convex Optimization Approach","date":"2020-06-08","arxiv_id":"2006.04361","repositories_listed":4,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":13,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 1 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-contraction-metrics-for-robust#ran","syntology_url":"https://syntology.ai/paper/2006.04361","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04361"}},"official":{"repos":["astrohiro/ncm"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multimodal-trajectory-predictions-for","slug":"multimodal-trajectory-predictions-for","title":"Multimodal Trajectory Predictions for Autonomous Driving using Deep Convolutional Networks","date":"2018-09-18","arxiv_id":"1809.10732","repositories_listed":4,"syntology":null},{"url":"/paper/stripstream-integrating-symbolic-planners-and","slug":"stripstream-integrating-symbolic-planners-and","title":"PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planning","date":"2018-02-23","arxiv_id":"1802.08705","repositories_listed":4,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/stripstream-integrating-symbolic-planners-and#ran","syntology_url":"https://syntology.ai/paper/1802.08705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.08705"}},"official":{"repos":["caelan/pddlstream"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/strips-planning-in-infinite-domains","slug":"strips-planning-in-infinite-domains","title":"STRIPS Planning in Infinite Domains","date":"2017-01-01","arxiv_id":"1701.00287","repositories_listed":4,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/strips-planning-in-infinite-domains#ran","syntology_url":"https://syntology.ai/paper/1701.00287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.00287"}},"official":{"repos":["caelan/stripstream"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/neural-potential-field-for-obstacle-aware","slug":"neural-potential-field-for-obstacle-aware","title":"Neural Potential Field for Obstacle-Aware Local Motion Planning","date":"2023-10-25","arxiv_id":"2310.16362","repositories_listed":3,"syntology":null},{"url":"/paper/parting-with-misconceptions-about-learning","slug":"parting-with-misconceptions-about-learning","title":"Parting with Misconceptions about Learning-based Vehicle Motion Planning","date":"2023-06-13","arxiv_id":"2306.07962","repositories_listed":3,"syntology":null},{"url":"/paper/autotamp-autoregressive-task-and-motion","slug":"autotamp-autoregressive-task-and-motion","title":"AutoTAMP: Autoregressive Task and Motion Planning with LLMs as Translators and Checkers","date":"2023-06-10","arxiv_id":"2306.06531","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/autotamp-autoregressive-task-and-motion#ran","syntology_url":"https://syntology.ai/paper/2306.06531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.06531"}},"official":{"repos":["yongchao98/autotamp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-and-high-quality-prehensile","slug":"efficient-and-high-quality-prehensile","title":"Efficient and High-quality Prehensile Rearrangement in Cluttered and Confined Spaces","date":"2021-10-06","arxiv_id":"2110.02814","repositories_listed":3,"syntology":null},{"url":"/paper/eagermot-3d-multi-object-tracking-via-sensor","slug":"eagermot-3d-multi-object-tracking-via-sensor","title":"EagerMOT: 3D Multi-Object Tracking via Sensor Fusion","date":"2021-04-29","arxiv_id":"2104.14682","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/eagermot-3d-multi-object-tracking-via-sensor#ran","syntology_url":"https://syntology.ai/paper/2104.14682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14682"}},"official":{"repos":["aleksandrkim61/EagerMOT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/one-thousand-and-one-hours-self-driving","slug":"one-thousand-and-one-hours-self-driving","title":"One Thousand and One Hours: Self-driving Motion Prediction Dataset","date":"2020-06-25","arxiv_id":"2006.14480","repositories_listed":3,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/one-thousand-and-one-hours-self-driving#ran","syntology_url":"https://syntology.ai/paper/2006.14480","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14480"}},"official":null}},{"url":"/paper/risk-aware-driving-scenario-analysis-with","slug":"risk-aware-driving-scenario-analysis-with","title":"From Words to Collisions: LLM-Guided Evaluation and Adversarial Generation of Safety-Critical Driving Scenarios","date":"2025-02-04","arxiv_id":"2502.02145","repositories_listed":2,"syntology":null},{"url":"/paper/gpd-1-generative-pre-training-for-driving","slug":"gpd-1-generative-pre-training-for-driving","title":"GPD-1: Generative Pre-training for Driving","date":"2024-12-11","arxiv_id":"2412.08643","repositories_listed":2,"syntology":null},{"url":"/paper/drivemlm-aligning-multi-modal-large-language","slug":"drivemlm-aligning-multi-modal-large-language","title":"DriveMLM: Aligning Multi-Modal Large Language Models with Behavioral Planning States for Autonomous Driving","date":"2023-12-14","arxiv_id":"2312.09245","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/drivemlm-aligning-multi-modal-large-language#ran","syntology_url":"https://syntology.ai/paper/2312.09245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.09245"}},"official":{"repos":["opengvlab/drivemlm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/scene-as-occupancy","slug":"scene-as-occupancy","title":"Scene as Occupancy","date":"2023-06-05","arxiv_id":"2306.02851","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/scene-as-occupancy#ran","syntology_url":"https://syntology.ai/paper/2306.02851","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02851"}},"official":{"repos":["opendrivelab/occnet"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/2305-18415","slug":"2305-18415","title":"Geometric Algebra Transformer","date":"2023-05-28","arxiv_id":"2305.18415","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/2305-18415#ran","syntology_url":"https://syntology.ai/paper/2305.18415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18415"}},"official":{"repos":["qualcomm-ai-research/geometric-algebra-transformer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/mtp-go-graph-based-probabilistic-multi-agent","slug":"mtp-go-graph-based-probabilistic-multi-agent","title":"MTP-GO: Graph-Based Probabilistic Multi-Agent Trajectory Prediction with Neural ODEs","date":"2023-02-01","arxiv_id":"2302.00735","repositories_listed":2,"syntology":null},{"url":"/paper/diffusion-based-generation-optimization-and","slug":"diffusion-based-generation-optimization-and","title":"Diffusion-based Generation, Optimization, and Planning in 3D Scenes","date":"2023-01-15","arxiv_id":"2301.06015","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":4,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffusion-based-generation-optimization-and#ran","syntology_url":"https://syntology.ai/paper/2301.06015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.06015"}},"official":{"repos":["scenediffuser/Scene-Diffuser"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/reproducibility-report-path-planning-using","slug":"reproducibility-report-path-planning-using","title":"[Reproducibility Report] Path Planning using Neural A* Search","date":"2022-07-16","arxiv_id":"2208.04153","repositories_listed":2,"syntology":null},{"url":"/paper/lazy-rearrangement-planning-in-confined","slug":"lazy-rearrangement-planning-in-confined","title":"Lazy Rearrangement Planning in Confined Spaces","date":"2022-03-19","arxiv_id":"2203.10379","repositories_listed":2,"syntology":null},{"url":"/paper/socially-aware-robot-crowd-navigation-with","slug":"socially-aware-robot-crowd-navigation-with","title":"Intention Aware Robot Crowd Navigation with Attention-Based Interaction Graph","date":"2022-03-03","arxiv_id":"2203.01821","repositories_listed":2,"syntology":null},{"url":"/paper/active-uncertainty-learning-for-human-robot","slug":"active-uncertainty-learning-for-human-robot","title":"Active Uncertainty Reduction for Human-Robot Interaction: An Implicit Dual Control Approach","date":"2022-02-15","arxiv_id":"2202.07720","repositories_listed":2,"syntology":null},{"url":"/paper/towards-real-world-navigation-with-deep","slug":"towards-real-world-navigation-with-deep","title":"Towards real-world navigation with deep differentiable planners","date":"2021-08-08","arxiv_id":"2108.05713","repositories_listed":2,"syntology":null},{"url":"/paper/the-threedworld-transport-challenge-a","slug":"the-threedworld-transport-challenge-a","title":"The ThreeDWorld Transport Challenge: A Visually Guided Task-and-Motion Planning Benchmark for Physically Realistic Embodied AI","date":"2021-03-25","arxiv_id":"2103.14025","repositories_listed":2,"syntology":null},{"url":"/paper/grasp-and-motion-planning-for-dexterous","slug":"grasp-and-motion-planning-for-dexterous","title":"Grasp and Motion Planning for Dexterous Manipulation for the Real Robot Challenge","date":"2021-01-08","arxiv_id":"2101.02842","repositories_listed":2,"syntology":null},{"url":"/paper/decentralized-structural-rnn-for-robot-crowd","slug":"decentralized-structural-rnn-for-robot-crowd","title":"Decentralized Structural-RNN for Robot Crowd Navigation with Deep Reinforcement Learning","date":"2020-11-09","arxiv_id":"2011.04820","repositories_listed":2,"syntology":null},{"url":"/paper/learning-from-sparse-demonstrations","slug":"learning-from-sparse-demonstrations","title":"Learning from Sparse Demonstrations","date":"2020-08-05","arxiv_id":"2008.02159","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-from-sparse-demonstrations#ran","syntology_url":"https://syntology.ai/paper/2008.02159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.02159"}},"official":{"repos":["wanxinjin/Learning-from-Sparse-Demonstrations"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/faster-fast-and-safe-trajectory-planner-for","slug":"faster-fast-and-safe-trajectory-planner-for","title":"FASTER: Fast and Safe Trajectory Planner for Navigation in Unknown Environments","date":"2020-01-09","arxiv_id":"2001.04420","repositories_listed":2,"syntology":null},{"url":"/paper/190910387","slug":"190910387","title":"An Adversarial Approach to Private Flocking in Mobile Robot Teams","date":"2019-09-23","arxiv_id":"1909.10387","repositories_listed":2,"syntology":null},{"url":"/paper/motion-planning-explorer-visualizing-local","slug":"motion-planning-explorer-visualizing-local","title":"Motion Planning Explorer: Visualizing Local Minima using a Local-Minima Tree","date":"2019-09-11","arxiv_id":"1909.05035","repositories_listed":2,"syntology":null},{"url":"/paper/language2pose-natural-language-grounded-pose","slug":"language2pose-natural-language-grounded-pose","title":"Language2Pose: Natural Language Grounded Pose Forecasting","date":"2019-07-02","arxiv_id":"1907.01108","repositories_listed":2,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/language2pose-natural-language-grounded-pose#ran","syntology_url":"https://syntology.ai/paper/1907.01108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.01108"}},"official":{"repos":["chahuja/language2pose"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/3d-bat-a-semi-automatic-web-based-3d","slug":"3d-bat-a-semi-automatic-web-based-3d","title":"3D BAT: A Semi-Automatic, Web-based 3D Annotation Toolbox for Full-Surround, Multi-Modal Data Streams","date":"2019-05-01","arxiv_id":"1905.00525","repositories_listed":2,"syntology":null},{"url":"/paper/egocentric-vision-based-future-vehicle","slug":"egocentric-vision-based-future-vehicle","title":"Egocentric Vision-based Future Vehicle Localization for Intelligent Driving Assistance Systems","date":"2018-09-19","arxiv_id":"1809.07408","repositories_listed":2,"syntology":null},{"url":"/paper/active-model-learning-and-diverse-action","slug":"active-model-learning-and-diverse-action","title":"Active model learning and diverse action sampling for task and motion planning","date":"2018-03-02","arxiv_id":"1803.00967","repositories_listed":2,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/active-model-learning-and-diverse-action#ran","syntology_url":"https://syntology.ai/paper/1803.00967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.00967"}},"official":{"repos":["zi-w/Kitchen2D"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-sampling-distributions-for-robot","slug":"learning-sampling-distributions-for-robot","title":"Learning Sampling Distributions for Robot Motion Planning","date":"2017-09-16","arxiv_id":"1709.05448","repositories_listed":2,"syntology":null},{"url":"/paper/socially-aware-motion-planning-with-deep","slug":"socially-aware-motion-planning-with-deep","title":"Socially Aware Motion Planning with Deep Reinforcement Learning","date":"2017-03-26","arxiv_id":"1703.08862","repositories_listed":2,"syntology":null},{"url":"/paper/epona-autoregressive-diffusion-world-model","slug":"epona-autoregressive-diffusion-world-model","title":"Epona: Autoregressive Diffusion World Model for Autonomous Driving","date":"2025-06-30","arxiv_id":"2506.24113","repositories_listed":1,"syntology":null},{"url":"/paper/2506-08344","slug":"2506-08344","title":"Re4MPC: Reactive Nonlinear MPC for Multi-model Motion Planning via Deep Reinforcement Learning","date":"2025-06-10","arxiv_id":"2506.08344","repositories_listed":1,"syntology":null},{"url":"/paper/prime-the-search-using-large-language-models","slug":"prime-the-search-using-large-language-models","title":"Prime the search: Using large language models for guiding geometric task and motion planning by warm-starting tree search","date":"2025-06-08","arxiv_id":"2506.07062","repositories_listed":1,"syntology":null},{"url":"/paper/refav-towards-planning-centric-scenario","slug":"refav-towards-planning-centric-scenario","title":"RefAV: Towards Planning-Centric Scenario Mining","date":"2025-05-27","arxiv_id":"2505.20981","repositories_listed":1,"syntology":null},{"url":"/paper/lilodriver-a-lifelong-learning-framework-for","slug":"lilodriver-a-lifelong-learning-framework-for","title":"LiloDriver: A Lifelong Learning Framework for Closed-loop Motion Planning in Long-tail Autonomous Driving Scenarios","date":"2025-05-22","arxiv_id":"2505.17209","repositories_listed":1,"syntology":null},{"url":"/paper/agi-elo-how-far-are-we-from-mastering-a-task","slug":"agi-elo-how-far-are-we-from-mastering-a-task","title":"AGI-Elo: How Far Are We From Mastering A Task?","date":"2025-05-19","arxiv_id":"2505.12844","repositories_listed":1,"syntology":null},{"url":"/paper/physics-informed-temporal-difference-metric","slug":"physics-informed-temporal-difference-metric","title":"Physics-informed Temporal Difference Metric Learning for Robot Motion Planning","date":"2025-05-09","arxiv_id":"2505.05691","repositories_listed":1,"syntology":null},{"url":"/paper/future-oriented-navigation-dynamic-obstacle","slug":"future-oriented-navigation-dynamic-obstacle","title":"Future-Oriented Navigation: Dynamic Obstacle Avoidance with One-Shot Energy-Based Multimodal Motion Prediction","date":"2025-05-01","arxiv_id":"2505.00237","repositories_listed":1,"syntology":null},{"url":"/paper/from-shadows-to-safety-occlusion-tracking-and","slug":"from-shadows-to-safety-occlusion-tracking-and","title":"From Shadows to Safety: Occlusion Tracking and Risk Mitigation for Urban Autonomous Driving","date":"2025-04-02","arxiv_id":"2504.01408","repositories_listed":1,"syntology":null},{"url":"/paper/opendrivevla-towards-end-to-end-autonomous","slug":"opendrivevla-towards-end-to-end-autonomous","title":"OpenDriveVLA: Towards End-to-end Autonomous Driving with Large Vision Language Action Model","date":"2025-03-30","arxiv_id":"2503.23463","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/opendrivevla-towards-end-to-end-autonomous#ran","syntology_url":"https://syntology.ai/paper/2503.23463","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.23463"}},"official":{"repos":["DriveVLA/OpenDriveVLA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/curvature-constrained-vector-field-for-motion","slug":"curvature-constrained-vector-field-for-motion","title":"Curvature-Constrained Vector Field for Motion Planning of Nonholonomic Robots","date":"2025-03-25","arxiv_id":"2504.02852","repositories_listed":1,"syntology":null},{"url":"/paper/phystwin-physics-informed-reconstruction-and","slug":"phystwin-physics-informed-reconstruction-and","title":"PhysTwin: Physics-Informed Reconstruction and Simulation of Deformable Objects from Videos","date":"2025-03-23","arxiv_id":"2503.17973","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/phystwin-physics-informed-reconstruction-and#ran","syntology_url":"https://syntology.ai/paper/2503.17973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.17973"}},"official":null}},{"url":"/paper/bridging-past-and-future-end-to-end","slug":"bridging-past-and-future-end-to-end","title":"Bridging Past and Future: End-to-End Autonomous Driving with Historical Prediction and Planning","date":"2025-03-18","arxiv_id":"2503.14182","repositories_listed":1,"syntology":null},{"url":"/paper/soft-actor-critic-based-control-barrier","slug":"soft-actor-critic-based-control-barrier","title":"Soft Actor-Critic-based Control Barrier Adaptation for Robust Autonomous Navigation in Unknown Environments","date":"2025-03-11","arxiv_id":"2503.08479","repositories_listed":1,"syntology":null},{"url":"/paper/bevdriver-leveraging-bev-maps-in-llms-for","slug":"bevdriver-leveraging-bev-maps-in-llms-for","title":"BEVDriver: Leveraging BEV Maps in LLMs for Robust Closed-Loop Driving","date":"2025-03-05","arxiv_id":"2503.03074","repositories_listed":1,"syntology":null},{"url":"/paper/controllable-motion-generation-via-diffusion","slug":"controllable-motion-generation-via-diffusion","title":"Controllable Motion Generation via Diffusion Modal Coupling","date":"2025-03-04","arxiv_id":"2503.02353","repositories_listed":1,"syntology":null},{"url":"/paper/2503-00583","slug":"2503-00583","title":"Space-Time Graphs of Convex Sets for Multi-Robot Motion Planning","date":"2025-03-01","arxiv_id":"2503.00583","repositories_listed":1,"syntology":null},{"url":"/paper/getting-smarter-for-motion-planning-in","slug":"getting-smarter-for-motion-planning-in","title":"Getting SMARTER for Motion Planning in Autonomous Driving Systems","date":"2025-02-20","arxiv_id":"2502.15824","repositories_listed":1,"syntology":null},{"url":"/paper/manual2skill-learning-to-read-manuals-and","slug":"manual2skill-learning-to-read-manuals-and","title":"Manual2Skill: Learning to Read Manuals and Acquire Robotic Skills for Furniture Assembly Using Vision-Language Models","date":"2025-02-14","arxiv_id":"2502.10090","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/manual2skill-learning-to-read-manuals-and#ran","syntology_url":"https://syntology.ai/paper/2502.10090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.10090"}},"official":{"repos":["owensun2004/Manual2Skill"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-supervised-vision-centric-3d-occupancy","slug":"semi-supervised-vision-centric-3d-occupancy","title":"Semi-Supervised Vision-Centric 3D Occupancy World Model for Autonomous Driving","date":"2025-02-11","arxiv_id":"2502.07309","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-for-multi-robot-systems","slug":"large-language-models-for-multi-robot-systems","title":"Large Language Models for Multi-Robot Systems: A Survey","date":"2025-02-06","arxiv_id":"2502.03814","repositories_listed":1,"syntology":null},{"url":"/paper/graph-coloring-to-reduce-computation-time-in","slug":"graph-coloring-to-reduce-computation-time-in","title":"Graph Coloring to Reduce Computation Time in Prioritized Planning","date":"2025-01-18","arxiv_id":"2501.10812","repositories_listed":1,"syntology":null},{"url":"/paper/romu4o-a-robotic-manipulation-unit-for","slug":"romu4o-a-robotic-manipulation-unit-for","title":"RoMu4o: A Robotic Manipulation Unit For Orchard Operations Automating Proximal Hyperspectral Leaf Sensing","date":"2025-01-18","arxiv_id":"2501.10621","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-computation-with-multiple","slug":"simultaneous-computation-with-multiple","title":"Simultaneous Computation with Multiple Prioritizations in Multi-Agent Motion Planning","date":"2025-01-18","arxiv_id":"2501.10781","repositories_listed":1,"syntology":null},{"url":"/paper/codrivevlm-vlm-enhanced-urban-cooperative","slug":"codrivevlm-vlm-enhanced-urban-cooperative","title":"CoDriveVLM: VLM-Enhanced Urban Cooperative Dispatching and Motion Planning for Future Autonomous Mobility on Demand Systems","date":"2025-01-10","arxiv_id":"2501.06132","repositories_listed":1,"syntology":null},{"url":"/paper/robotdiffuse-motion-planning-for-redundant","slug":"robotdiffuse-motion-planning-for-redundant","title":"RobotDiffuse: Motion Planning for Redundant Manipulator based on Diffusion Model","date":"2024-12-27","arxiv_id":"2412.19500","repositories_listed":1,"syntology":null},{"url":"/paper/generating-traffic-scenarios-via-in-context","slug":"generating-traffic-scenarios-via-in-context","title":"Generating Traffic Scenarios via In-Context Learning to Learn Better Motion Planner","date":"2024-12-24","arxiv_id":"2412.18086","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-motion-planning-for-differential","slug":"multi-agent-motion-planning-for-differential","title":"Multi-Agent Motion Planning For Differential Drive Robots Through Stationary State Search","date":"2024-12-17","arxiv_id":"2412.13359","repositories_listed":1,"syntology":null},{"url":"/paper/gaussianad-gaussian-centric-end-to-end","slug":"gaussianad-gaussian-centric-end-to-end","title":"GaussianAD: Gaussian-Centric End-to-End Autonomous Driving","date":"2024-12-13","arxiv_id":"2412.10371","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gaussianad-gaussian-centric-end-to-end#ran","syntology_url":"https://syntology.ai/paper/2412.10371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.10371"}},"official":{"repos":["wzzheng/gaussianad"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/doe-1-closed-loop-autonomous-driving-with","slug":"doe-1-closed-loop-autonomous-driving-with","title":"Doe-1: Closed-Loop Autonomous Driving with Large World Model","date":"2024-12-12","arxiv_id":"2412.09627","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/doe-1-closed-loop-autonomous-driving-with#ran","syntology_url":"https://syntology.ai/paper/2412.09627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09627"}},"official":{"repos":["wzzheng/doe"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/doscenes-an-autonomous-driving-dataset-with","slug":"doscenes-an-autonomous-driving-dataset-with","title":"doScenes: An Autonomous Driving Dataset with Natural Language Instruction for Human Interaction and Vision-Language Navigation","date":"2024-12-08","arxiv_id":"2412.05893","repositories_listed":1,"syntology":null},{"url":"/paper/global-tensor-motion-planning","slug":"global-tensor-motion-planning","title":"Global Tensor Motion Planning","date":"2024-11-28","arxiv_id":"2411.19393","repositories_listed":1,"syntology":null},{"url":"/paper/bench4merge-a-comprehensive-benchmark-for","slug":"bench4merge-a-comprehensive-benchmark-for","title":"Bench4Merge: A Comprehensive Benchmark for Merging in Realistic Dense Traffic with Micro-Interactive Vehicles","date":"2024-10-21","arxiv_id":"2410.15912","repositories_listed":1,"syntology":null},{"url":"/paper/multi-robot-motion-planning-with-diffusion","slug":"multi-robot-motion-planning-with-diffusion","title":"Multi-Robot Motion Planning with Diffusion Models","date":"2024-10-04","arxiv_id":"2410.03072","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-robot-motion-planning-with-diffusion#ran","syntology_url":"https://syntology.ai/paper/2410.03072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03072"}},"official":{"repos":["yoraish/mmd"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-generalizable-vision-language-robotic","slug":"towards-generalizable-vision-language-robotic","title":"Towards Generalizable Vision-Language Robotic Manipulation: A Benchmark and LLM-guided 3D Policy","date":"2024-10-02","arxiv_id":"2410.01345","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-generalizable-vision-language-robotic#ran","syntology_url":"https://syntology.ai/paper/2410.01345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01345"}},"official":{"repos":["vlc-robot/robot-3dlotus"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lasmp-language-aided-subset-sampling-based","slug":"lasmp-language-aided-subset-sampling-based","title":"LASMP: Language Aided Subset Sampling Based Motion Planner","date":"2024-10-01","arxiv_id":"2410.00649","repositories_listed":1,"syntology":null},{"url":"/paper/maniskill3-gpu-parallelized-robotics","slug":"maniskill3-gpu-parallelized-robotics","title":"ManiSkill3: GPU Parallelized Robotics Simulation and Rendering for Generalizable Embodied AI","date":"2024-10-01","arxiv_id":"2410.00425","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/maniskill3-gpu-parallelized-robotics#ran","syntology_url":"https://syntology.ai/paper/2410.00425","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.00425"}},"official":{"repos":["haosulab/ManiSkill"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dashing-for-the-golden-snitch-multi-drone","slug":"dashing-for-the-golden-snitch-multi-drone","title":"Dashing for the Golden Snitch: Multi-Drone Time-Optimal Motion Planning with Multi-Agent Reinforcement Learning","date":"2024-09-25","arxiv_id":"2409.16720","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-responsibility-sharing-as-a","slug":"interpretable-responsibility-sharing-as-a","title":"Interpretable Responsibility Sharing as a Heuristic for Task and Motion Planning","date":"2024-09-09","arxiv_id":"2409.05586","repositories_listed":1,"syntology":null},{"url":"/paper/viik-flow-based-vision-inverse-kinematics","slug":"viik-flow-based-vision-inverse-kinematics","title":"ViIK: Flow-based Vision Inverse Kinematics Solver with Fusing Collision Checking","date":"2024-08-21","arxiv_id":"2408.11293","repositories_listed":1,"syntology":null},{"url":"/paper/pp-til-personalized-planning-for-autonomous","slug":"pp-til-personalized-planning-for-autonomous","title":"PP-TIL: Personalized Planning for Autonomous Driving with Instance-based Transfer Imitation Learning","date":"2024-07-26","arxiv_id":"2407.18569","repositories_listed":1,"syntology":null},{"url":"/paper/communication-and-computation-efficient","slug":"communication-and-computation-efficient","title":"Communication- and Computation-Efficient Distributed Submodular Optimization in Robot Mesh Networks","date":"2024-07-15","arxiv_id":"2407.10382","repositories_listed":1,"syntology":null},{"url":"/paper/solving-motion-planning-tasks-with-a-scalable","slug":"solving-motion-planning-tasks-with-a-scalable","title":"Solving Motion Planning Tasks with a Scalable Generative Model","date":"2024-07-03","arxiv_id":"2407.02797","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/solving-motion-planning-tasks-with-a-scalable#ran","syntology_url":"https://syntology.ai/paper/2407.02797","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02797"}},"official":{"repos":["horizonrobotics/gump"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/asynchronous-large-language-model-enhanced","slug":"asynchronous-large-language-model-enhanced","title":"Asynchronous Large Language Model Enhanced Planner for Autonomous Driving","date":"2024-06-20","arxiv_id":"2406.14556","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":4,"n_instrument":7,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/asynchronous-large-language-model-enhanced#ran","syntology_url":"https://syntology.ai/paper/2406.14556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14556"}},"official":{"repos":["memberre/asyncdriver"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/instruct-large-language-models-to-drive-like","slug":"instruct-large-language-models-to-drive-like","title":"Instruct Large Language Models to Drive like Humans","date":"2024-06-11","arxiv_id":"2406.07296","repositories_listed":1,"syntology":null},{"url":"/paper/slope-search-with-learned-optimal-pruning","slug":"slope-search-with-learned-optimal-pruning","title":"SLOPE: Search with Learned Optimal Pruning-based Expansion","date":"2024-06-07","arxiv_id":"2406.04935","repositories_listed":1,"syntology":null},{"url":"/paper/track-anything-rapter-tar","slug":"track-anything-rapter-tar","title":"Track Anything Rapter(TAR)","date":"2024-05-19","arxiv_id":"2405.11655","repositories_listed":1,"syntology":null},{"url":"/paper/planning-the-path-with-reinforcement-learning","slug":"planning-the-path-with-reinforcement-learning","title":"Planning the path with Reinforcement Learning: Optimal Robot Motion Planning in RoboCup Small Size League Environments","date":"2024-04-23","arxiv_id":"2404.15410","repositories_listed":1,"syntology":null},{"url":"/paper/inverse-kinematics-for-neuro-robotic-grasping","slug":"inverse-kinematics-for-neuro-robotic-grasping","title":"Inverse Kinematics for Neuro-Robotic Grasping with Humanoid Embodied Agents","date":"2024-04-12","arxiv_id":"2404.08825","repositories_listed":1,"syntology":null},{"url":"/paper/can-vehicle-motion-planning-generalize-to","slug":"can-vehicle-motion-planning-generalize-to","title":"Can Vehicle Motion Planning Generalize to Realistic Long-tail Scenarios?","date":"2024-04-11","arxiv_id":"2404.07569","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/can-vehicle-motion-planning-generalize-to#ran","syntology_url":"https://syntology.ai/paper/2404.07569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.07569"}},"official":{"repos":["mh0797/interplan"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sledge-synthesizing-simulation-environments","slug":"sledge-synthesizing-simulation-environments","title":"SLEDGE: Synthesizing Driving Environments with Generative Models and Rule-Based Traffic","date":"2024-03-26","arxiv_id":"2403.17933","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-and-semantic-evaluation-metrics-for","slug":"temporal-and-semantic-evaluation-metrics-for","title":"Temporal and Semantic Evaluation Metrics for Foundation Models in Post-Hoc Analysis of Robotic Sub-tasks","date":"2024-03-25","arxiv_id":"2403.17238","repositories_listed":1,"syntology":null},{"url":"/paper/llm-3-large-language-model-based-task-and","slug":"llm-3-large-language-model-based-task-and","title":"LLM3:Large Language Model-based Task and Motion Planning with Motion Failure Reasoning","date":"2024-03-18","arxiv_id":"2403.11552","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llm-3-large-language-model-based-task-and#ran","syntology_url":"https://syntology.ai/paper/2403.11552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11552"}},"official":{"repos":["assassinws/llm-tamp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-reinforcement-learning-hierarchical","slug":"diffusion-reinforcement-learning-hierarchical","title":"Diffusion-Reinforcement Learning Hierarchical Motion Planning in Multi-agent Adversarial Games","date":"2024-03-16","arxiv_id":"2403.10794","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-road-to-portability-compressing-end-to","slug":"on-the-road-to-portability-compressing-end-to","title":"On the Road to Portability: Compressing End-to-End Motion Planner for Autonomous Driving","date":"2024-03-02","arxiv_id":"2403.01238","repositories_listed":1,"syntology":{"n":14,"n_ran":8,"n_constructed":5,"n_ran_checked":6,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/on-the-road-to-portability-compressing-end-to#ran","syntology_url":"https://syntology.ai/paper/2403.01238","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01238"}},"official":{"repos":["tulerfeng/PlanKD"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-inverse-kinodynamics-for-autonomous","slug":"learning-inverse-kinodynamics-for-autonomous","title":"Learning Inverse Kinodynamics for Autonomous Vehicle Drifting","date":"2024-02-22","arxiv_id":"2402.14928","repositories_listed":1,"syntology":null},{"url":"/paper/conformalized-adaptive-forecasting-of","slug":"conformalized-adaptive-forecasting-of","title":"Conformalized Adaptive Forecasting of Heterogeneous Trajectories","date":"2024-02-14","arxiv_id":"2402.09623","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/conformalized-adaptive-forecasting-of#ran","syntology_url":"https://syntology.ai/paper/2402.09623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.09623"}},"official":{"repos":["fionaz3696/cafht"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/risk-aware-mpc-for-stochastic-systems-with","slug":"risk-aware-mpc-for-stochastic-systems-with","title":"Risk-Aware MPC for Stochastic Systems with Runtime Temporal Logics","date":"2024-02-05","arxiv_id":"2402.03165","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-multi-modal-model-predictive-control","slug":"scalable-multi-modal-model-predictive-control","title":"Scalable Multi-modal Model Predictive Control via Duality-based Interaction Predictions","date":"2024-02-02","arxiv_id":"2402.01116","repositories_listed":1,"syntology":null},{"url":"/paper/read-retrieval-enhanced-asymmetric-diffusion","slug":"read-retrieval-enhanced-asymmetric-diffusion","title":"READ: Retrieval-Enhanced Asymmetric Diffusion for Motion Planning","date":"2024-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":29,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/motion-planning-on-nuscenes","since_archive":"/sota/motion-planning-on-nuscenes#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":59,"papers_where_code_ran_first_page":"/task/motion-planning/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":10,"url":"/task/motion-planning/papers/2","json":"/task/motion-planning/papers/2.json","rows":100},{"order":"archive","page":3,"of":10,"url":"/task/motion-planning/papers/3","json":"/task/motion-planning/papers/3.json","rows":100},{"order":"archive","page":4,"of":10,"url":"/task/motion-planning/papers/4","json":"/task/motion-planning/papers/4.json","rows":100},{"order":"archive","page":5,"of":10,"url":"/task/motion-planning/papers/5","json":"/task/motion-planning/papers/5.json","rows":100},{"order":"archive","page":6,"of":10,"url":"/task/motion-planning/papers/6","json":"/task/motion-planning/papers/6.json","rows":100},{"order":"archive","page":7,"of":10,"url":"/task/motion-planning/papers/7","json":"/task/motion-planning/papers/7.json","rows":100},{"order":"archive","page":8,"of":10,"url":"/task/motion-planning/papers/8","json":"/task/motion-planning/papers/8.json","rows":100},{"order":"archive","page":9,"of":10,"url":"/task/motion-planning/papers/9","json":"/task/motion-planning/papers/9.json","rows":100},{"order":"archive","page":10,"of":10,"url":"/task/motion-planning/papers/10","json":"/task/motion-planning/papers/10.json","rows":20},{"order":"ran","page":1,"of":1,"url":"/task/motion-planning/papers/ran/1","json":"/task/motion-planning/papers/ran/1.json","rows":59}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"104f71f6e65a38adf8a59661ea43f35bff5ecc66d99ca1ec4917de2504ccfb22","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}