{"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 (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":21,"of":21,"tagged_in_all":86,"items":[{"url":"/paper/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":1,"n_unverified":4,"n_pointer_only":1}},{"url":"/paper/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_unverified":0,"n_pointer_only":0}},{"url":"/paper/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","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":0,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/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","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","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","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_unverified":0,"n_pointer_only":0}},{"url":"/paper/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_unverified":0,"n_pointer_only":0}},{"url":"/paper/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","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":0,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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","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_unverified":0,"n_pointer_only":0}},{"url":"/paper/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","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","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","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}],"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"},"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-09-24T18:15:14+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}