Combined Task and Motion Planning as Classical AI Planning
Jonathan Ferrer-Mestres, Guillem Franc\`es, Hector Geffner

TL;DR
This paper demonstrates that task and motion planning in robotics can be unified into classical AI planning problems, enabling efficient planning over complex, high-dimensional spaces using novel compilation and search techniques.
Contribution
It introduces a method to compile combined task and motion planning into classical AI planning, leveraging expressive languages and width-based search algorithms.
Findings
Compilation is sound and probabilistically complete.
Effective planning over large configuration spaces achieved.
Empirical validation with complex robotic manipulation tasks.
Abstract
Planning in robotics is often split into task and motion planning. The high-level, symbolic task planner decides what needs to be done, while the motion planner checks feasibility and fills up geometric detail. It is known however that such a decomposition is not effective in general as the symbolic and geometrical components are not independent. In this work, we show that it is possible to compile task and motion planning problems into classical AI planning problems; i.e., planning problems over finite and discrete state spaces with a known initial state, deterministic actions, and goal states to be reached. The compilation is sound, meaning that classical plans are valid robot plans, and probabilistically complete, meaning that valid robot plans are classical plans when a sufficient number of configurations is sampled. In this approach, motion planners and collision checkers are used…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAI-based Problem Solving and Planning · Robotic Path Planning Algorithms · Robot Manipulation and Learning
