ReloPush-BOSS: Optimization-guided Nonmonotone Rearrangement Planning for a Car-like Robot Pusher

• URL: http://arxiv.org/abs/2601.22289v1
• Date: Thu, 29 Jan 2026 20:03:33 GMT
• Title: ReloPush-BOSS: Optimization-guided Nonmonotone Rearrangement Planning for a Car-like Robot Pusher
• Abstract summary: We focus on multi-object rearrangement planning in densely cluttered environments using a car-like robot pusher.<n>Our framework, ReloPush-BOSS, exhibits consistently highest success rates and shortest pushing paths compared to state-of-the-art baselines.
• Score: 1.0828616610785522
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We focus on multi-object rearrangement planning in densely cluttered environments using a car-like robot pusher. The combination of kinematic, geometric and physics constraints underlying this domain results in challenging nonmonotone problem instances which demand breaking each manipulation action into multiple parts to achieve a desired object rearrangement. Prior work tackles such instances by planning prerelocations, temporary object displacements that enable constraint satisfaction, but deciding where to prerelocate remains difficult due to local minima leading to infeasible or high-cost paths. Our key insight is that these minima can be avoided by steering a prerelocation optimization toward low-cost regions informed by Dubins path classification. These optimized prerelocations are integrated into an object traversability graph that encodes kinematic, geometric, and pushing constraints. Searching this graph in a depth-first fashion results in efficient, feasible rearrangement sequences. Across a series of densely cluttered scenarios with up to 13 objects, our framework, ReloPush-BOSS, exhibits consistently highest success rates and shortest pushing paths compared to state-of-the-art baselines. Hardware experiments on a 1/10 car-like pusher demonstrate the robustness of our approach. Code and footage from our experiments can be found at: https://fluentrobotics.com/relopushboss.

Related papers

• NeurRAFT: Robot Motion Planning via Anchor-Level Flow Matching with Clearance-Aware Preference Tuning [5.973392871392725]
  We present NeurRAFT, a generative planning framework based on anchor-level flow matching and clearance-aware preference tuning.<n> Experiments show substantial improvements over state-of-the-art planners, while real-world experiments demonstrate zero-shot transfer to a Franka robot.
  arXiv  Detail & Related papers  (2026-08-25T03:31:24Z)
• Optimal Knock-Pick Planning for Tightly Packed Tabletop Blocks With Parallel Grippers [14.463441841507477]
  Rearranging densely packed tabletop objects is challenging when parallel-gripper picks are infeasible without sufficient clearance around an object.<n>This work studies the problem characteristics for practically motivated settings with uniformly sized blocks placed at planar tabletop grid locations.<n>Experiments are reported for increasing grid sizes in synthetic settings as well as in IsaacSim.
  arXiv  Detail & Related papers  (2026-05-18T03:24:49Z)
• Navigating the Clutter: Waypoint-Based Bi-Level Planning for Multi-Robot Systems [54.887871365121775]
  Multi-robot control in cluttered environments is a challenging problem that involves complex physical constraints.<n>We propose a hybrid multi-robot control framework that jointly optimize task and motion planning.<n>Our approach consistently improves task success over motion-agnostic and VLA-based baselines.
  arXiv  Detail & Related papers  (2026-04-22T22:58:47Z)
• Push-Placement: A Hybrid Approach Integrating Prehensile and Non-Prehensile Manipulation for Object Rearrangement [2.4140502941897544]
  This paper proposes push-placement, a hybrid action primitive that uses the grasped object to displace obstructing items while being placed.<n>The method is integrated into a physics-in-the-loop Monte Carlo Tree Search planner and evaluated in the PyBullet simulator.
  arXiv  Detail & Related papers  (2026-02-14T18:58:00Z)
• Making Infeasible Tasks Feasible: Planning to Reconfigure Disconnected 3D Environments with Movable Objects [7.628322510394639]
  Planning for collision-free robot paths from an initial to a goal configuration often fails when environments are disconnected.<n>We develop BRiDGE, a sampling-based planner that incrementally builds trees over robot and object configurations to compute feasible plans.<n>We show that our method is probabilistically complete and we provide extensive numerical and hardware experiments validating its effectiveness.
  arXiv  Detail & Related papers  (2026-01-06T01:36:09Z)
• Dynamic Buffers: Cost-Efficient Planning for Tabletop Rearrangement with Stacking [2.4140502941897544]
  Rearranging objects in cluttered tabletop environments remains a long-standing challenge in robotics.<n>To overcome these issues, a novel planning primitive called the Dynamic Buffer is introduced.<n>Inspired by human grouping strategies, it enables robots to form temporary, movable stacks that can be transported as a unit.
  arXiv  Detail & Related papers  (2025-09-26T18:36:40Z)
• IMPACT: Intelligent Motion Planning with Acceptable Contact Trajectories via Vision-Language Models [3.3871564496652335]
  IMPACT is a novel motion planning framework that uses Vision-Language Models to infer environment semantics.<n>Our results over 3200 simulation and 200 real-world trials suggest that IMPACT enables efficient contact-rich motion planning in cluttered settings.
  arXiv  Detail & Related papers  (2025-03-13T07:09:00Z)
• Search-Based Path Planning in Interactive Environments among Movable Obstacles [8.023424148846265]
  This paper introduces two PAMO formulations, i.e., bi-objective and resource constrained problems in an occupancy grid.<n>We develop PAMO*, a planning method with completeness and solution optimality guarantees, to solve the two problems.<n>Our results show that, PAMO* can often find optimal solutions within a second in cluttered maps with up to 400 objects.
  arXiv  Detail & Related papers  (2024-10-24T00:02:58Z)
• A Meta-Engine Framework for Interleaved Task and Motion Planning using Topological Refinements [51.54559117314768]
  Task And Motion Planning (TAMP) is the problem of finding a solution to an automated planning problem. We propose a general and open-source framework for modeling and benchmarking TAMP problems. We introduce an innovative meta-technique to solve TAMP problems involving moving agents and multiple task-state-dependent obstacles.
  arXiv  Detail & Related papers  (2024-08-11T14:57:57Z)
• SMORE: Simultaneous Map and Object REconstruction [66.66729715211642]
  We present a method for dynamic surface reconstruction of large-scale urban scenes from LiDAR.<n>We take a holistic perspective and optimize a compositional model of a dynamic scene that decomposes the world into rigidly-moving objects and the background.
  arXiv  Detail & Related papers  (2024-06-19T23:53:31Z)
• CabiNet: Scaling Neural Collision Detection for Object Rearrangement with Procedural Scene Generation [54.68738348071891]
  We first generate over 650K cluttered scenes - orders of magnitude more than prior work - in diverse everyday environments. We render synthetic partial point clouds from this data and use it to train our CabiNet model architecture. CabiNet is a collision model that accepts object and scene point clouds, captured from a single-view depth observation.
  arXiv  Detail & Related papers  (2023-04-18T21:09:55Z)
• DDPEN: Trajectory Optimisation With Sub Goal Generation Model [70.36888514074022]
  In this paper, we produce a novel Differential Dynamic Programming with Escape Network (DDPEN) We propose to utilize a deep model that takes as an input map of the environment in the form of a costmap together with the desired position. The model produces possible future directions that will lead to the goal, avoiding local minima which is possible to run in real time conditions.
  arXiv  Detail & Related papers  (2023-01-18T11:02:06Z)
• Vision-aided UAV navigation and dynamic obstacle avoidance using gradient-based B-spline trajectory optimization [7.874708385247353]
  This paper proposes a gradient-based B-spline trajectory optimization algorithm utilizing the robot's onboard vision. The proposed optimization first adopts the circle-based guide-point algorithm to approximate the costs and gradients for avoiding static obstacles. With the vision-detected moving objects, our receding-horizon distance field is simultaneously used to prevent dynamic collisions.
  arXiv  Detail & Related papers  (2022-09-15T02:12:30Z)
• DiffSkill: Skill Abstraction from Differentiable Physics for Deformable Object Manipulations with Tools [96.38972082580294]
  DiffSkill is a novel framework that uses a differentiable physics simulator for skill abstraction to solve deformable object manipulation tasks. In particular, we first obtain short-horizon skills using individual tools from a gradient-based simulator. We then learn a neural skill abstractor from the demonstration trajectories which takes RGBD images as input.
  arXiv  Detail & Related papers  (2022-03-31T17:59:38Z)

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.