Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.04645 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911138835333120 |
|---|---|
| author | Saha, Kallol Li, Amber Rodriguez-Izquierdo, Angela Yu, Lifan Eisner, Ben Likhachev, Maxim Held, David |
| author_facet | Saha, Kallol Li, Amber Rodriguez-Izquierdo, Angela Yu, Lifan Eisner, Ben Likhachev, Maxim Held, David |
| contents | Long-horizon planning for robot manipulation is a challenging problem that requires reasoning about the effects of a sequence of actions on a physical 3D scene. While traditional task planning methods are shown to be effective for long-horizon manipulation, they require discretizing the continuous state and action space into symbolic descriptions of objects, object relationships, and actions. Instead, we propose a hybrid learning-and-planning approach that leverages learned models as domain-specific priors to guide search in high-dimensional continuous action spaces. We introduce SPOT: Search over Point cloud Object Transformations, which plans by searching for a sequence of transformations from an initial scene point cloud to a goal-satisfying point cloud. SPOT samples candidate actions from learned suggesters that operate on partially observed point clouds, eliminating the need to discretize actions or object relationships. We evaluate SPOT on multi-object rearrangement tasks, reporting task planning success and task execution success in both simulation and real-world environments. Our experiments show that SPOT generates successful plans and outperforms a policy-learning approach. We also perform ablations that highlight the importance of search-based planning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_04645 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Planning from Point Clouds over Continuous Actions for Multi-object Rearrangement Saha, Kallol Li, Amber Rodriguez-Izquierdo, Angela Yu, Lifan Eisner, Ben Likhachev, Maxim Held, David Robotics Long-horizon planning for robot manipulation is a challenging problem that requires reasoning about the effects of a sequence of actions on a physical 3D scene. While traditional task planning methods are shown to be effective for long-horizon manipulation, they require discretizing the continuous state and action space into symbolic descriptions of objects, object relationships, and actions. Instead, we propose a hybrid learning-and-planning approach that leverages learned models as domain-specific priors to guide search in high-dimensional continuous action spaces. We introduce SPOT: Search over Point cloud Object Transformations, which plans by searching for a sequence of transformations from an initial scene point cloud to a goal-satisfying point cloud. SPOT samples candidate actions from learned suggesters that operate on partially observed point clouds, eliminating the need to discretize actions or object relationships. We evaluate SPOT on multi-object rearrangement tasks, reporting task planning success and task execution success in both simulation and real-world environments. Our experiments show that SPOT generates successful plans and outperforms a policy-learning approach. We also perform ablations that highlight the importance of search-based planning. |
| title | Planning from Point Clouds over Continuous Actions for Multi-object Rearrangement |
| topic | Robotics |
| url | https://arxiv.org/abs/2509.04645 |