Stable Object Placement Planning From Contact Point Robustness

• URL: http://arxiv.org/abs/2410.12483v1
• Date: Wed, 16 Oct 2024 12:02:15 GMT
• Title: Stable Object Placement Planning From Contact Point Robustness
• Authors: Philippe Nadeau, Jonathan Kelly,
• Abstract summary: Our planner selects contact points first and then determines a placement pose that solicits the selected points. Our algorithm facilitates stability-aware object placement planning, imposing no restrictions on object shape, convexity, or mass density homogeneity.
• Score: 12.575068666209832
• License:
• 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 more successful in finding stable placements than the five other benchmarked algorithms. Derived from first principles and validated in ten real robot experiments, our planner offers a general and scalable method to tackle the problem of object placement planning with rigid objects.

Related papers

• Optimal Integrated Task and Path Planning and Its Application to Multi-Robot Pickup and Delivery [10.530860023128406]
  We propose a generic multi-robot planning mechanism that combines an optimal task planner and an optimal path planner. The Integrated planner, through the interaction of the task planner and the path planner, produces optimal collision-free trajectories for the robots.
  arXiv  Detail & Related papers  (2024-03-02T17:48:40Z)
• Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints [56.283944756315066]
  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.
  arXiv  Detail & Related papers  (2023-12-29T14:00:20Z)
• 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)
• Planning Irregular Object Packing via Hierarchical Reinforcement Learning [85.64313062912491]
  We propose a deep hierarchical reinforcement learning approach to plan packing sequence and placement for irregular objects. We show that our approach can pack more objects with less time cost than the state-of-the-art packing methods of irregular objects.
  arXiv  Detail & Related papers  (2022-11-17T07:16:37Z)
• PlanT: Explainable Planning Transformers via Object-Level Representations [64.93938686101309]
  PlanT is a novel approach for planning in the context of self-driving. PlanT is based on imitation learning with a compact object-level input representation. Our results indicate that PlanT can focus on the most relevant object in the scene, even when this object is geometrically distant.
  arXiv  Detail & Related papers  (2022-10-25T17:59:46Z)
• Evaluating Guiding Spaces for Motion Planning [2.384084215091134]
  We define the emphmotion planning guiding space, which encapsulates many seemingly distinct prior works under the same framework. We also suggest an information theoretic method to evaluate guided planning which places the focus on the quality of the resulting biased sampling.
  arXiv  Detail & Related papers  (2022-10-16T21:17:51Z)
• Assembly Planning from Observations under Physical Constraints [65.83676649042623]
  The proposed algorithm uses a simple combination of physical stability constraints, convex optimization and Monte Carlo tree search to plan assemblies. It is efficient and, most importantly, robust to the errors in object detection and pose estimation unavoidable in any real robotic system.
  arXiv  Detail & Related papers  (2022-04-20T16:51:07Z)
• 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)
• Predicting Stable Configurations for Semantic Placement of Novel Objects [37.18437299513799]
  Our goal is to enable robots to repose previously unseen objects according to learned semantic relationships in novel environments. We build our models and training from the ground up to be tightly integrated with our proposed planning algorithm for semantic placement of unknown objects. Our approach enables motion planning for semantic rearrangement of unknown objects in scenes with varying geometry from only RGB-D sensing.
  arXiv  Detail & Related papers  (2021-08-26T23:05:05Z)
• Nothing But Geometric Constraints: A Model-Free Method for Articulated Object Pose Estimation [89.82169646672872]
  We propose an unsupervised vision-based system to estimate the joint configurations of the robot arm from a sequence of RGB or RGB-D images without knowing the model a priori. We combine a classical geometric formulation with deep learning and extend the use of epipolar multi-rigid-body constraints to solve this task.
  arXiv  Detail & Related papers  (2020-11-30T20:46:48Z)

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.