Unified Task and Motion Planning using Object-centric Abstractions of
Motion Constraints
- URL: http://arxiv.org/abs/2312.17605v1
- Date: Fri, 29 Dec 2023 14:00:20 GMT
- Title: Unified Task and Motion Planning using Object-centric Abstractions of
Motion Constraints
- Authors: Alejandro Agostini, Justus Piater
- Abstract summary: We propose an alternative TAMP approach that unifies task and motion planning into a single search.
Our approach is based on an object-centric abstraction of motion constraints that permits leveraging the computational efficiency of off-the-shelf AI search to yield physically feasible plans.
- Score: 56.283944756315066
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In task and motion planning (TAMP), the ambiguity and underdetermination of
abstract descriptions used by task planning methods make it difficult to
characterize physical constraints needed to successfully execute a task. The
usual approach is to overlook such constraints at task planning level and to
implement expensive sub-symbolic geometric reasoning techniques that perform
multiple calls on unfeasible actions, plan corrections, and re-planning until a
feasible solution is found. We propose an alternative TAMP approach that
unifies task and motion planning into a single heuristic search. Our approach
is based on an object-centric abstraction of motion constraints that permits
leveraging the computational efficiency of off-the-shelf AI heuristic search to
yield physically feasible plans. These plans can be directly transformed into
object and motion parameters for task execution without the need of intensive
sub-symbolic geometric reasoning.
Related papers
- A Meta-Engine Framework for Interleaved Task and Motion Planning using Topological Refinements [51.54559117314768]
Task And Motion Planning (TAMP) is the problem of finding a solution to an automated planning problem.
We propose a general and open-source framework for modeling and benchmarking TAMP problems.
We introduce an innovative meta-technique to solve TAMP problems involving moving agents and multiple task-state-dependent obstacles.
arXiv Detail & Related papers (2024-08-11T14:57:57Z) - LLM3:Large Language Model-based Task and Motion Planning with Motion Failure Reasoning [78.2390460278551]
Conventional Task and Motion Planning (TAMP) approaches rely on manually crafted interfaces connecting symbolic task planning with continuous motion generation.
Here, we present LLM3, a novel Large Language Model (LLM)-based TAMP framework featuring a domain-independent interface.
Specifically, we leverage the powerful reasoning and planning capabilities of pre-trained LLMs to propose symbolic action sequences and select continuous action parameters for motion planning.
arXiv Detail & Related papers (2024-03-18T08:03:47Z) - Learning adaptive planning representations with natural language
guidance [90.24449752926866]
This paper describes Ada, a framework for automatically constructing task-specific planning representations.
Ada interactively learns a library of planner-compatible high-level action abstractions and low-level controllers adapted to a particular domain of planning tasks.
arXiv Detail & Related papers (2023-12-13T23:35:31Z) - Planning as In-Painting: A Diffusion-Based Embodied Task Planning
Framework for Environments under Uncertainty [56.30846158280031]
Task planning for embodied AI has been one of the most challenging problems.
We propose a task-agnostic method named 'planning as in-painting'
The proposed framework achieves promising performances in various embodied AI tasks.
arXiv Detail & Related papers (2023-12-02T10:07:17Z) - Optimal task and motion planning and execution for human-robot
multi-agent systems in dynamic environments [54.39292848359306]
We propose a combined task and motion planning approach to optimize sequencing, assignment, and execution of tasks.
The framework relies on decoupling tasks and actions, where an action is one possible geometric realization of a symbolic task.
We demonstrate the approach effectiveness in a collaborative manufacturing scenario, in which a robotic arm and a human worker shall assemble a mosaic.
arXiv Detail & Related papers (2023-03-27T01:50:45Z) - Learning to Search in Task and Motion Planning with Streams [20.003445874753233]
Task and motion planning problems in robotics combine symbolic planning over discrete task variables with motion optimization over continuous state and action variables.
We propose a geometrically informed symbolic planner that expands the set of objects and facts in a best-first manner.
We apply our algorithm on a 7DOF robotic arm in block-stacking manipulation tasks.
arXiv Detail & Related papers (2021-11-25T15:58:31Z) - Task Allocation for Multi-Robot Task and Motion Planning: a case for
Object Picking in Cluttered Workspaces [1.3535770763481902]
We present an integrated multi-robot task and motion planning approach.
It is capable of handling tasks which involve an unknown number of object re-arrangements.
We demonstrate our results with experiments in simulation on two Franka Emika manipulators.
arXiv Detail & Related papers (2021-10-08T12:36:43Z) - Anytime Stochastic Task and Motion Policies [12.72186877599064]
We present a new approach for integrated task and motion planning in settings.
Our algorithm is probabilistically complete and can compute feasible solution policies in an anytime fashion.
arXiv Detail & Related papers (2021-08-28T00:23:39Z) - Task Scoping: Generating Task-Specific Abstractions for Planning [19.411900372400183]
Planning to solve any specific task using an open-scope world model is computationally intractable.
We propose task scoping: a method that exploits knowledge of the initial condition, goal condition, and transition-dynamics structure of a task.
We prove that task scoping never deletes relevant factors or actions, characterize its computational complexity, and characterize the planning problems for which it is especially useful.
arXiv Detail & Related papers (2020-10-17T21:19:25Z) - Integrated Task and Motion Planning [30.415785183398334]
Planning for a robot that operates in environments containing a large number of objects is known as task and motion planning (TAMP)
TAMP problems contain elements of discrete task planning, discrete-continuous mathematical programming, and continuous motion planning, and thus cannot be effectively addressed by any of these fields directly.
In this paper, we define a class of TAMP problems and survey algorithms for solving them, characterizing the solution methods in terms of their strategies for solving the continuous-space subproblems and their techniques for integrating the discrete and continuous components of the search.
arXiv Detail & Related papers (2020-10-02T16:23:08Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.