A Single-Query Manipulation Planner
Puttichai Lertkultanon, Quang-Cuong Pham

TL;DR
This paper introduces a novel high-level grasp-placement table for manipulation planning that efficiently captures connectivity in the composite configuration space without heavy pre-processing, improving planning speed and trajectory quality.
Contribution
It presents a new grasp-placement table that avoids discretization and re-computation, enabling faster and more adaptable manipulation planning.
Findings
Improved planning speed compared to existing methods.
Enhanced trajectory quality in manipulation tasks.
No re-computation needed when environment changes.
Abstract
In manipulation tasks, a robot interacts with movable object(s). The configuration space in manipulation planning is thus the Cartesian product of the configuration space of the robot with those of the movable objects. It is the complex structure of such a "Composite Configuration Space" that makes manipulation planning particularly challenging. Previous works approximate the connectivity of the Composite Configuration Space by means of discretization or by creating random roadmaps. Such approaches involve an extensive pre-processing phase, which furthermore has to be re-done each time the environment changes. In this paper, we propose a high-level Grasp-Placement Table similar to that proposed by Tournassoud et al. (1987), but which does not require any discretization or heavy pre-processing. The table captures the potential connectivity of the Composite Configuration Space while being…
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
TopicsRobot Manipulation and Learning · Robotic Path Planning Algorithms · Modular Robots and Swarm Intelligence
