Stable Object Placement Planning From Contact Point Robustness
Philippe Nadeau, Jonathan Kelly

TL;DR
This paper presents a novel stability-aware object placement planner that selects contact points first, enabling faster and more successful placements without shape restrictions, validated through real robot experiments.
Contribution
The proposed planner reverses traditional methods by choosing contact points before pose, improving speed and success rate in stable object placement.
Findings
20x faster with the heuristic
8x faster than state-of-the-art methods
More successful in stable placement than benchmarks
Abstract
We introduce a planner designed to guide robot manipulators in stably placing objects within intricate scenes. Our proposed method reverses the traditional approach to object placement: our planner selects contact points first and then determines a placement pose that solicits the selected points. This is instead of sampling poses, identifying contact points, and evaluating pose quality. Our algorithm facilitates stability-aware object placement planning, imposing no restrictions on object shape, convexity, or mass density homogeneity, while avoiding combinatorial computational complexity. Our proposed stability heuristic enables our planner to find a solution about 20 times faster when compared to the same algorithm not making use of the heuristic and eight times faster than a state-of-the-art method that uses the traditional sample-and-evaluate approach. Our proposed planner is also…
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 · Manufacturing Process and Optimization
