Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Search

• URL: http://arxiv.org/abs/2101.12241v1
• Date: Thu, 28 Jan 2021 19:22:39 GMT
• Title: Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Search
• Abstract summary: This work studies the algorithmic structure of rearranging uniform objects, where robot-object collisions do not occur but object-object collisions have to be avoided. An efficiently computable decomposition of the configuration space is used to create a "region graph", which classifies all continuous paths of equivalent collision possibilities. Experiments demonstrate that the proposed solution returns near-optimal paths with higher success rate, even for challenging non-monotone instances.
• Score: 16.361608890275622
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Object rearrangement is a widely-applicable and challenging task for robots. Geometric constraints must be carefully examined to avoid collisions and combinatorial issues arise as the number of objects increases. This work studies the algorithmic structure of rearranging uniform objects, where robot-object collisions do not occur but object-object collisions have to be avoided. The objective is minimizing the number of object transfers under the assumption that the robot can manipulate one object at a time. An efficiently computable decomposition of the configuration space is used to create a "region graph", which classifies all continuous paths of equivalent collision possibilities. Based on this compact but rich representation, a complete dynamic programming primitive DFSDP performs a recursive depth first search to solve monotone problems quickly, i.e., those instances that do not require objects to be moved first to an intermediate buffer. DFSDP is extended to solve single-buffer, non-monotone instances, given a choice of an object and a buffer. This work utilizes these primitives as local planners in an informed search framework for more general, non-monotone instances. The search utilizes partial solutions from the primitives to identify the most promising choice of objects and buffers. Experiments demonstrate that the proposed solution returns near-optimal paths with higher success rate, even for challenging non-monotone instances, than other leading alternatives.

Related papers

• SOS! : A Streamlined Object-Conditional Transformer for Model-free Segmentation [67.361660179434]
  We propose SOS (Streamlined Object-conditional Transformer for model-free pipelines) for unseen objects segmentation.<n>Central to our framework is a novel Object-Conditional Transformer that learns identity-anchored queries, unifying mask generation and target identification into a single feed-forward pass.<n>Sos establishes a new state-of-the-art for model-free unseen objects segmentation, delivering accurate and high-efficiency performance.
  arXiv  Detail & Related papers  (2026-08-15T15:53:23Z)
• Category-Level Object Shape and Pose Estimation in Less Than a Millisecond [13.78778327399253]
  We present a fast local solver for shape and pose estimation.<n>We use a learned front-end to detect sparse, category-level semantic keypoints on the target object.<n>One iteration of our solver runs in about 100 microseconds, enabling fast outlier rejection.
  arXiv  Detail & Related papers  (2025-09-23T13:29:32Z)
• Detection Based Part-level Articulated Object Reconstruction from Single RGBD Image [52.11275397911693]
  We propose an end-to-end trainable, cross-category method for reconstructing multiple man-made articulated objects from a single RGBD image. We depart from previous works that rely on learning instance-level latent space, focusing on man-made articulated objects with predefined part counts. Our method successfully reconstructs variously structured multiple instances that previous works cannot handle, and outperforms prior works in shape reconstruction and kinematics estimation.
  arXiv  Detail & Related papers  (2025-04-04T05:08:04Z)
• ObjectCarver: Semi-automatic segmentation, reconstruction and separation of 3D objects [44.38881095466177]
  Implicit neural fields have made remarkable progress in reconstructing 3D surfaces from multiple images. Previous work has attempted to tackle this problem by introducing a framework to train separate signed distance fields. We introduce our method, ObjectCarver, to tackle the problem of object separation from just click input in a single view.
  arXiv  Detail & Related papers  (2024-07-26T22:13:20Z)
• CASAPose: Class-Adaptive and Semantic-Aware Multi-Object Pose Estimation [2.861848675707602]
  We present a new single-stage architecture called CASAPose. It determines 2D-3D correspondences for pose estimation of multiple different objects in RGB images in one pass. It is fast and memory efficient, and achieves high accuracy for multiple objects.
  arXiv  Detail & Related papers  (2022-10-11T10:20:01Z)
• 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)
• Lazy Rearrangement Planning in Confined Spaces [14.38087412920014]
  This work introduces a lazy evaluation framework for object rearrangement in confined spaces. It improves upon a local monotone solver, which extends to a high-quality planner for the general, non-monotone case. It achieves high-quality solutions, i.e., only 1.8 additional actions on average are needed for non-monotone instances.
  arXiv  Detail & Related papers  (2022-03-19T18:59:43Z)
• IFOR: Iterative Flow Minimization for Robotic Object Rearrangement [92.97142696891727]
  IFOR, Iterative Flow Minimization for Robotic Object Rearrangement, is an end-to-end method for the problem of object rearrangement for unknown objects. We show that our method applies to cluttered scenes, and in the real world, while training only on synthetic data.
  arXiv  Detail & Related papers  (2022-02-01T20:03:56Z)
• Efficient and High-quality Prehensile Rearrangement in Cluttered and Confined Spaces [16.745331954312775]
  This work focuses on problems where such interactions are critical for completing tasks and extends state-of-the-art results in rearrangement planning. It proposes a new efficient and complete solver under general constraints for monotone instances, which can be solved by moving each object at most once. The new monotone solver is integrated with a global planner to solve non-monotone instances with high-quality solutions fast.
  arXiv  Detail & Related papers  (2021-10-06T14:42:21Z)
• SPANet: Generalized Permutationless Set Assignment for Particle Physics using Symmetry Preserving Attention [62.43586180025247]
  Collisions at the Large Hadron Collider produce variable-size sets of observed particles. Physical symmetries of decay products complicate assignment of observed particles to decay products. We introduce a novel method for constructing symmetry-preserving attention networks.
  arXiv  Detail & Related papers  (2021-06-07T18:18:20Z)
• Objects are Different: Flexible Monocular 3D Object Detection [87.82253067302561]
  We propose a flexible framework for monocular 3D object detection which explicitly decouples the truncated objects and adaptively combines multiple approaches for object depth estimation. Experiments demonstrate that our method outperforms the state-of-the-art method by relatively 27% for the moderate level and 30% for the hard level in the test set of KITTI benchmark.
  arXiv  Detail & Related papers  (2021-04-06T07:01:28Z)
• SIMstack: A Generative Shape and Instance Model for Unordered Object Stacks [38.042876641457255]
  We propose a depth-conditioned Variational Auto-Encoder (VAE) trained on a dataset of objects stacked under physics simulation. We formulate instance segmentation as a centre voting task which allows for class-agnostic detection and doesn't require setting the maximum number of objects in the scene. Our method has practical applications in providing robots some of the ability humans have to make rapid intuitive inferences of partially observed scenes.
  arXiv  Detail & Related papers  (2021-03-30T15:42:43Z)
• Object Rearrangement Using Learned Implicit Collision Functions [61.90305371998561]
  We propose a learned collision model that accepts scene and query object point clouds and predicts collisions for 6DOF object poses within the scene. We leverage the learned collision model as part of a model predictive path integral (MPPI) policy in a tabletop rearrangement task. The learned model outperforms both traditional pipelines and learned ablations by 9.8% in accuracy on a dataset of simulated collision queries.
  arXiv  Detail & Related papers  (2020-11-21T05:36:06Z)
• Instance-aware, Context-focused, and Memory-efficient Weakly Supervised Object Detection [184.563345153682]
  We develop an instance-aware and context-focused unified framework for weakly supervised learning. It employs an instance-aware self-training algorithm and a learnable Concrete DropBlock while devising a memory-efficient sequential batch back-propagation. Our proposed method state-of-the-art results on COCO ($12.1% AP$, $24.8% AP_50$), VOC 2007 ($54.9% AP$), and VOC 2012 ($52.1% AP$)
  arXiv  Detail & Related papers  (2020-04-09T17:57:09Z)

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.