An incremental constraint-based framework for task and motion planning
NT Dantam, ZK Kingston… - … Journal of Robotics …, 2018 - journals.sagepub.com
We present a new constraint-based framework for task and motion planning (TMP). Our
approach is extensible, probabilistically complete, and offers improved performance and …
approach is extensible, probabilistically complete, and offers improved performance and …
Exploring implicit spaces for constrained sampling-based planning
We present a review and reformulation of manifold constrained sampling-based motion
planning within a unifying framework, IMACS (implicit manifold configuration space). IMACS …
planning within a unifying framework, IMACS (implicit manifold configuration space). IMACS …
Sampling-based methods for factored task and motion planning
CR Garrett, T Lozano-Pérez… - … International Journal of …, 2018 - journals.sagepub.com
This paper presents a general-purpose formulation of a large class of discrete-time planning
problems, with hybrid state and control-spaces, as factored transition systems. Factoring …
problems, with hybrid state and control-spaces, as factored transition systems. Factoring …
Complexity results and fast methods for optimal tabletop rearrangement with overhand grasps
This paper studies the underlying combinatorial structure of a class of object rearrangement
problems, which appear frequently in applications. The problems involve multiple, similar …
problems, which appear frequently in applications. The problems involve multiple, similar …
A sampling and learning framework to prove motion planning infeasibility
We present a learning-based approach to prove infeasibility of kinematic motion planning
problems. Sampling-based motion planners are effective in high-dimensional spaces but …
problems. Sampling-based motion planners are effective in high-dimensional spaces but …