{"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/task-and-motion-planning","name":"Task and Motion Planning","slug":"task-and-motion-planning","description_markdown":null,"categories":[{"name":"Robots","url":"/area/robots"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":86,"papers_with_code":21,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"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":1,"rows_per_page":100,"shown":86,"of":86,"of_with_code":21,"tagged_in_all":86,"counts":{"archive_papers_tagged":86,"with_a_code_link":21,"where_syntology_ran_a_sample":7,"not_listed_spam_title":0,"listed":86,"listed_where_code_ran":7,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/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/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/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/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/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/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/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/furniturebench-reproducible-real-world","slug":"furniturebench-reproducible-real-world","title":"FurnitureBench: Reproducible Real-World Benchmark for Long-Horizon Complex Manipulation","date":"2023-05-22","arxiv_id":"2305.12821","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/furniturebench-reproducible-real-world#ran","syntology_url":"https://syntology.ai/paper/2305.12821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12821"}},"official":{"repos":["clvrai/furniture-bench"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/search-based-task-and-motion-planning-for","slug":"search-based-task-and-motion-planning-for","title":"Search-Based Task and Motion Planning for Hybrid Systems: Agile Autonomous Vehicles","date":"2023-01-25","arxiv_id":"2301.10384","repositories_listed":1,"syntology":null},{"url":"/paper/orbit-a-unified-simulation-framework-for","slug":"orbit-a-unified-simulation-framework-for","title":"Orbit: A Unified Simulation Framework for Interactive Robot Learning Environments","date":"2023-01-10","arxiv_id":"2301.04195","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/orbit-a-unified-simulation-framework-for#ran","syntology_url":"https://syntology.ai/paper/2301.04195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.04195"}},"official":{"repos":["NVIDIA-Omniverse/Orbit"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/taps-task-agnostic-policy-sequencing","slug":"taps-task-agnostic-policy-sequencing","title":"STAP: Sequencing Task-Agnostic Policies","date":"2022-10-21","arxiv_id":"2210.12250","repositories_listed":1,"syntology":null},{"url":"/paper/jedai-explains-decision-making-ai","slug":"jedai-explains-decision-making-ai","title":"JEDAI: A System for Skill-Aligned Explainable Robot Planning","date":"2021-10-31","arxiv_id":"2111.00585","repositories_listed":1,"syntology":null},{"url":"/paper/integrated-task-and-motion-planning-for-safe","slug":"integrated-task-and-motion-planning-for-safe","title":"Integrated Task and Motion Planning for Safe Legged Navigation in Partially Observable Environments","date":"2021-10-23","arxiv_id":"2110.12097","repositories_listed":1,"syntology":null},{"url":"/paper/extended-task-and-motion-planning-of-long","slug":"extended-task-and-motion-planning-of-long","title":"Extended Tree Search for Robot Task and Motion Planning","date":"2021-03-09","arxiv_id":"2103.05456","repositories_listed":1,"syntology":null},{"url":"/paper/learning-symbolic-operators-for-task-and","slug":"learning-symbolic-operators-for-task-and","title":"Learning Symbolic Operators for Task and Motion Planning","date":"2021-02-28","arxiv_id":"2103.00589","repositories_listed":1,"syntology":null},{"url":"/paper/planning-with-learned-object-importance-in","slug":"planning-with-learned-object-importance-in","title":"Planning with Learned Object Importance in Large Problem Instances using Graph Neural Networks","date":"2020-09-11","arxiv_id":"2009.05613","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/planning-with-learned-object-importance-in#ran","syntology_url":"https://syntology.ai/paper/2009.05613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05613"}},"official":null}},{"url":"/paper/camps-learning-context-specific-abstractions","slug":"camps-learning-context-specific-abstractions","title":"CAMPs: Learning Context-Specific Abstractions for Efficient Planning in Factored MDPs","date":"2020-07-26","arxiv_id":"2007.13202","repositories_listed":1,"syntology":null},{"url":"/paper/learning-compositional-models-of-robot-skills","slug":"learning-compositional-models-of-robot-skills","title":"Learning compositional models of robot skills for task and motion planning","date":"2020-06-08","arxiv_id":"2006.06444","repositories_listed":1,"syntology":null},{"url":"/paper/combining-learned-skills-and-reinforcement","slug":"combining-learned-skills-and-reinforcement","title":"Learning to combine primitive skills: A step towards versatile robotic manipulation","date":"2019-08-02","arxiv_id":"1908.00722","repositories_listed":1,"syntology":null},{"url":"/paper/regret-bounds-for-meta-bayesian-optimization","slug":"regret-bounds-for-meta-bayesian-optimization","title":"Regret bounds for meta Bayesian optimization with an unknown Gaussian process prior","date":"2018-11-23","arxiv_id":"1811.09558","repositories_listed":1,"syntology":null},{"url":null,"slug":"language-grounded-hierarchical-planning-and","title":"Language-Grounded Hierarchical Planning and Execution with Multi-Robot 3D Scene Graphs","date":"2025-06-09","arxiv_id":"2506.07454","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-physical-properties-of-unseen","title":"Understanding Physical Properties of Unseen Deformable Objects by Leveraging Large Language Models and Robot Actions","date":"2025-06-04","arxiv_id":"2506.03760","repositories_listed":0,"syntology":null},{"url":null,"slug":"grounded-vision-language-interpreter-for","title":"Grounded Vision-Language Interpreter for Integrated Task and Motion Planning","date":"2025-06-03","arxiv_id":"2506.03270","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-motion-to-behavior-hierarchical-modeling","title":"From Motion to Behavior: Hierarchical Modeling of Humanoid Generative Behavior Control","date":"2025-05-28","arxiv_id":"2506.00043","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-task-and-motion-planning-for","title":"Optimal Task and Motion Planning for Autonomous Systems Using Petri Nets","date":"2025-05-18","arxiv_id":"2505.12503","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-step-manipulation-task-and-motion","title":"Multi-step manipulation task and motion planning guided by video demonstration","date":"2025-05-13","arxiv_id":"2505.08949","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-pre-trained-large-language-models-1","title":"Leveraging Pre-trained Large Language Models with Refined Prompting for Online Task and Motion Planning","date":"2025-04-30","arxiv_id":"2504.21596","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-task-and-motion-planning-framework-using","title":"A Task and Motion Planning Framework Using Iteratively Deepened AND/OR Graph Networks","date":"2025-03-10","arxiv_id":"2503.07700","repositories_listed":0,"syntology":null},{"url":null,"slug":"curiosity-driven-imagination-discovering-plan","title":"Curiosity-Driven Imagination: Discovering Plan Operators and Learning Associated Policies for Open-World Adaptation","date":"2025-03-06","arxiv_id":"2503.04931","repositories_listed":0,"syntology":null},{"url":null,"slug":"2503-01700","title":"Code-as-Symbolic-Planner: Foundation Model-Based Robot Planning via Symbolic Code Generation","date":"2025-03-03","arxiv_id":"2503.01700","repositories_listed":0,"syntology":null},{"url":null,"slug":"risk-aware-integrated-task-and-motion","title":"Risk-aware Integrated Task and Motion Planning for Versatile Snake Robots under Localization Failures","date":"2025-02-27","arxiv_id":"2502.19690","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-robust-and-secure-embodied-ai-a","title":"Towards Robust and Secure Embodied AI: A Survey on Vulnerabilities and Attacks","date":"2025-02-18","arxiv_id":"2502.13175","repositories_listed":0,"syntology":null},{"url":null,"slug":"planning-with-affordances-integrating-learned","title":"Planning with affordances: Integrating learned affordance models and symbolic planning","date":"2025-02-04","arxiv_id":"2502.02768","repositories_listed":0,"syntology":null},{"url":null,"slug":"zero-shot-robotic-manipulation-with-language","title":"Zero-shot Robotic Manipulation with Language-guided Instruction and Formal Task Planning","date":"2025-01-25","arxiv_id":"2501.15214","repositories_listed":0,"syntology":null},{"url":null,"slug":"ontology-driven-prompt-tuning-for-llm-based","title":"Ontology-driven Prompt Tuning for LLM-based Task and Motion Planning","date":"2024-12-10","arxiv_id":"2412.07493","repositories_listed":0,"syntology":null},{"url":null,"slug":"l-a-benchmark-for-data-efficiency-in-long","title":"λ: A Benchmark for Data-Efficiency in Long-Horizon Indoor Mobile Manipulation Robotics","date":"2024-11-28","arxiv_id":"2412.05313","repositories_listed":0,"syntology":null},{"url":null,"slug":"spire-synergistic-planning-imitation-and","title":"SPIRE: Synergistic Planning, Imitation, and Reinforcement Learning for Long-Horizon Manipulation","date":"2024-10-23","arxiv_id":"2410.18065","repositories_listed":0,"syntology":null},{"url":null,"slug":"vlm-see-robot-do-human-demo-video-to-robot","title":"VLM See, Robot Do: Human Demo Video to Robot Action Plan via Vision Language Model","date":"2024-10-11","arxiv_id":"2410.08792","repositories_listed":0,"syntology":null},{"url":null,"slug":"kilobot-a-programming-language-for-deploying","title":"KiloBot: A Programming Language for Deploying Perception-Guided Industrial Manipulators at Scale","date":"2024-09-05","arxiv_id":"2409.03439","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-meta-engine-framework-for-interleaved-task","title":"A Meta-Engine Framework for Interleaved Task and Motion Planning using Topological Refinements","date":"2024-08-11","arxiv_id":"2408.05795","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-and-motion-planning-for-execution-in-the","title":"Task and Motion Planning for Execution in the Real","date":"2024-06-05","arxiv_id":"2406.03641","repositories_listed":0,"syntology":null},{"url":null,"slug":"delta-decomposed-efficient-long-term-robot","title":"DELTA: Decomposed Efficient Long-Term Robot Task Planning using Large Language Models","date":"2024-04-04","arxiv_id":"2404.03275","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-optimization-based-task-and","title":"A Survey of Optimization-based Task and Motion Planning: From Classical To Learning Approaches","date":"2024-04-03","arxiv_id":"2404.02817","repositories_listed":0,"syntology":null},{"url":null,"slug":"partially-observable-task-and-motion-planning","title":"Partially Observable Task and Motion Planning with Uncertainty and Risk Awareness","date":"2024-03-15","arxiv_id":"2403.10454","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-agile-robots-intuitive-robot-position","title":"RobKiNet: Robotic Kinematics Informed Neural Network for Optimal Robot Configuration Prediction","date":"2024-02-26","arxiv_id":"2402.16281","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-reals-to-logic-and-back-inventing","title":"From Real World to Logic and Back: Learning Generalizable Relational Concepts For Long Horizon Robot Planning","date":"2024-02-19","arxiv_id":"2402.11871","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-task-and-motion-planning-using-object","title":"Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints","date":"2023-12-29","arxiv_id":"2312.17605","repositories_listed":0,"syntology":null},{"url":null,"slug":"nod-tamp-multi-step-manipulation-planning","title":"NOD-TAMP: Generalizable Long-Horizon Planning with Neural Object Descriptors","date":"2023-11-02","arxiv_id":"2311.01530","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-in-the-loop-task-and-motion-planning","title":"Human-in-the-Loop Task and Motion Planning for Imitation Learning","date":"2023-10-24","arxiv_id":"2310.16014","repositories_listed":0,"syntology":null},{"url":null,"slug":"creative-robot-tool-use-with-large-language","title":"Creative Robot Tool Use with Large Language Models","date":"2023-10-19","arxiv_id":"2310.13065","repositories_listed":0,"syntology":null},{"url":null,"slug":"copal-corrective-planning-of-robot-actions","title":"CoPAL: Corrective Planning of Robot Actions with Large Language Models","date":"2023-10-11","arxiv_id":"2310.07263","repositories_listed":0,"syntology":null},{"url":null,"slug":"stamp-differentiable-task-and-motion-planning","title":"STAMP: Differentiable Task and Motion Planning via Stein Variational Gradient Descent","date":"2023-10-03","arxiv_id":"2310.01775","repositories_listed":0,"syntology":null},{"url":null,"slug":"embodied-lifelong-learning-for-task-and","title":"Embodied Lifelong Learning for Task and Motion Planning","date":"2023-07-13","arxiv_id":"2307.06870","repositories_listed":0,"syntology":null},{"url":null,"slug":"rh20t-a-robotic-dataset-for-learning-diverse","title":"RH20T: A Comprehensive Robotic Dataset for Learning Diverse Skills in One-Shot","date":"2023-07-02","arxiv_id":"2307.00595","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimsam-diffusion-models-as-samplers-for-task","title":"DiMSam: Diffusion Models as Samplers for Task and Motion Planning under Partial Observability","date":"2023-06-22","arxiv_id":"2306.13196","repositories_listed":0,"syntology":null},{"url":null,"slug":"imitating-task-and-motion-planning-with","title":"Imitating Task and Motion Planning with Visuomotor Transformers","date":"2023-05-25","arxiv_id":"2305.16309","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-task-and-motion-planning-and","title":"Optimal task and motion planning and execution for human-robot multi-agent systems in dynamic environments","date":"2023-03-27","arxiv_id":"2303.14874","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequence-based-plan-feasibility-prediction","title":"Sequence-Based Plan Feasibility Prediction for Efficient Task and Motion Planning","date":"2022-11-03","arxiv_id":"2211.01576","repositories_listed":0,"syntology":null},{"url":null,"slug":"policy-guided-lazy-search-with-feedback-for","title":"Policy-Guided Lazy Search with Feedback for Task and Motion Planning","date":"2022-10-25","arxiv_id":"2210.14055","repositories_listed":0,"syntology":null},{"url":null,"slug":"guided-skill-learning-and-abstraction-for","title":"LEAGUE: Guided Skill Learning and Abstraction for Long-Horizon Manipulation","date":"2022-10-23","arxiv_id":"2210.12631","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-based-multi-robot-task-and-motion","title":"Hypergraph-based Multi-Robot Task and Motion Planning","date":"2022-10-09","arxiv_id":"2210.04333","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-neuro-symbolic-skills-for-bilevel","title":"Learning Neuro-Symbolic Skills for Bilevel Planning","date":"2022-06-21","arxiv_id":"2206.10680","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-symbolic-operators-a-neurosymbolic","title":"Learning Symbolic Operators: A Neurosymbolic Solution for Autonomous Disassembly of Electric Vehicle Battery","date":"2022-06-07","arxiv_id":"2206.03027","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-integrated-task-and-motion","title":"Accelerating Integrated Task and Motion Planning with Neural Feasibility Checking","date":"2022-03-20","arxiv_id":"2203.10568","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-and-planning","title":"Representation, learning, and planning algorithms for geometric task and motion planning","date":"2022-03-09","arxiv_id":"2203.04605","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-task-and-motion-planning-for","title":"Cooperative Task and Motion Planning for Multi-Arm Assembly Systems","date":"2022-03-04","arxiv_id":"2203.02475","repositories_listed":0,"syntology":null},{"url":null,"slug":"guided-imitation-of-task-and-motion-planning","title":"Guided Imitation of Task and Motion Planning","date":"2021-12-06","arxiv_id":"2112.03386","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-search-in-task-and-motion","title":"Learning to Search in Task and Motion Planning with Streams","date":"2021-11-25","arxiv_id":"2111.13144","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-allocation-for-multi-robot-task-and","title":"Task Allocation for Multi-Robot Task and Motion Planning: a case for Object Picking in Cluttered Workspaces","date":"2021-10-08","arxiv_id":"2110.04089","repositories_listed":0,"syntology":null},{"url":null,"slug":"anytime-stochastic-task-and-motion-policies","title":"An Anytime Hierarchical Approach for Stochastic Task and Motion Planning","date":"2021-08-28","arxiv_id":"2108.12537","repositories_listed":0,"syntology":null},{"url":null,"slug":"long-horizon-manipulation-of-unknown-objects","title":"Long-Horizon Manipulation of Unknown Objects via Task and Motion Planning with Estimated Affordances","date":"2021-08-09","arxiv_id":"2108.04145","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-long-horizon-planning-framework-for","title":"A Long Horizon Planning Framework for Manipulating Rigid Pointcloud Objects","date":"2020-11-16","arxiv_id":"2011.08177","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrated-task-and-motion-planning","title":"Integrated Task and Motion Planning","date":"2020-10-02","arxiv_id":"2010.01083","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-visual-reasoning-learning-to-predict","title":"Deep Visual Reasoning: Learning to Predict Action Sequences for Task and Motion Planning from an Initial Scene Image","date":"2020-06-09","arxiv_id":"2006.05398","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexible-and-efficient-long-range-planning-1","title":"Flexible and Efficient Long-Range Planning Through Curious Exploration","date":"2020-04-22","arxiv_id":"2004.10876","repositories_listed":0,"syntology":null},{"url":null,"slug":"socially-intelligent-task-and-motion-planning","title":"Socially intelligent task and motion planning for human-robot interaction","date":"2020-01-23","arxiv_id":"2001.08398","repositories_listed":0,"syntology":null},{"url":null,"slug":"motion-reasoning-for-goal-based-imitation","title":"Motion Reasoning for Goal-Based Imitation Learning","date":"2019-11-13","arxiv_id":"1911.05864","repositories_listed":0,"syntology":null},{"url":null,"slug":"object-centric-task-and-motion-planning-in","title":"Object-Centric Task and Motion Planning in Dynamic Environments","date":"2019-11-12","arxiv_id":"1911.04679","repositories_listed":0,"syntology":null},{"url":null,"slug":"anytime-integrated-task-and-motion-policies","title":"Anytime Integrated Task and Motion Policies for Stochastic Environments","date":"2019-04-30","arxiv_id":"1904.13006","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-task-motion-planning-with","title":"Integrating Task-Motion Planning with Reinforcement Learning for Robust Decision Making in Mobile Robots","date":"2018-11-21","arxiv_id":"1811.08955","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-labeling-of-discrete-abstractions","title":"Accelerated Labeling of Discrete Abstractions for Autonomous Driving Subject to LTL Specifications","date":"2018-10-05","arxiv_id":"1810.02612","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-guide-task-and-motion-planning","title":"Learning to guide task and motion planning using score-space representation","date":"2018-07-26","arxiv_id":"1807.09962","repositories_listed":0,"syntology":null},{"url":null,"slug":"admissible-abstractions-for-near-optimal-task","title":"Admissible Abstractions for Near-optimal Task and Motion Planning","date":"2018-06-03","arxiv_id":"1806.00805","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-anytime-algorithm-for-task-and-motion-mdps","title":"An Anytime Algorithm for Task and Motion MDPs","date":"2018-02-16","arxiv_id":"1802.05835","repositories_listed":0,"syntology":null},{"url":null,"slug":"combined-task-and-motion-planning-as","title":"Combined Task and Motion Planning as Classical AI Planning","date":"2017-06-21","arxiv_id":"1706.06927","repositories_listed":0,"syntology":null}],"syntology_records":7,"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":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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":[]},"papers_where_code_ran":7,"papers_where_code_ran_first_page":"/task/task-and-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":"ran","page":1,"of":1,"url":"/task/task-and-motion-planning/papers/ran/1","json":"/task/task-and-motion-planning/papers/ran/1.json","rows":7}],"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":"840f83fadfe04da720b753d616388480e9cbc19ab0b517295f292c1182ce092a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}