Dynamic Buffers: Cost-Efficient Planning for Tabletop Rearrangement with Stacking

• URL: http://arxiv.org/abs/2509.22828v1
• Date: Fri, 26 Sep 2025 18:36:40 GMT
• Title: Dynamic Buffers: Cost-Efficient Planning for Tabletop Rearrangement with Stacking
• Abstract summary: 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.
• Score: 2.4140502941897544
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Rearranging objects in cluttered tabletop environments remains a long-standing challenge in robotics. Classical planners often generate inefficient, high-cost plans by shuffling objects individually and using fixed buffers--temporary spaces such as empty table regions or static stacks--to resolve conflicts. When only free table locations are used as buffers, dense scenes become inefficient, since placing an object can restrict others from reaching their goals and complicate planning. Allowing stacking provides extra buffer capacity, but conventional stacking is static: once an object supports another, the base cannot be moved, which limits efficiency. To overcome these issues, a novel planning primitive called the Dynamic Buffer is introduced. Inspired by human grouping strategies, it enables robots to form temporary, movable stacks that can be transported as a unit. This improves both feasibility and efficiency in dense layouts, and it also reduces travel in large-scale settings where space is abundant. Compared with a state-of-the-art rearrangement planner, the approach reduces manipulator travel cost by 11.89% in dense scenarios with a stationary robot and by 5.69% in large, low-density settings with a mobile manipulator. Practicality is validated through experiments on a Delta parallel robot with a two-finger gripper. These findings establish dynamic buffering as a key primitive for cost-efficient and robust rearrangement planning.

Related papers

• Complete, Scalable, and Robust Prioritized Planning for Multi-Robot Ordered Storage and Retrieval at Maximum Capacity [14.759453430635034]
  This paper introduces a novel multi-robot formulation for the ordered storage and retrieval problem at maximum capacity''<n>This work bridges the gap between geometric feasibility and execution efficiency by leveraging the properties of relocation-free arrangements.<n>Unlike general centralized planners, the approach exploits the specific invariants of the storage arrangement to guarantee completeness and prevent deadlocks.
  arXiv  Detail & Related papers  (2026-08-07T19:55:58Z)
• Occluding the Solution Space: Planner-Agnostic Adversarial Attacks on Tolerance-Aware Manipulation [57.9825059129472]
  We propose a planner-agnostic attack framework for tolerance-aware manipulation.<n>Our approach shifts the evaluation paradigm to task-level feasibility over goal regions.<n>Online, we formulate the attack as a budgeted maximum-coverage optimization.
  arXiv  Detail & Related papers  (2026-07-04T08:14:44Z)
• 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)
• Ultrafast Sampling-based Kinodynamic Planning via Differential Flatness [15.37007491684187]
  AkinoPDF is a fast parallelized sampling-based kinodynamic motion planning technique for a broad class of differentially flat robot systems.<n>Our method is fast, exact, and compatible with any sampling-based motion planner.
  arXiv  Detail & Related papers  (2026-03-17T01:53:10Z)
• 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)
• HAIC: Humanoid Agile Object Interaction Control via Dynamics-Aware World Model [56.4392302336014]
  We present HAIC, a framework for robust interaction across diverse object dynamics without external state estimation.<n>Our key contribution is a dynamics predictor that estimates high-order object states (velocity, acceleration) solely from proprioceptive history.<n> Experiments on a humanoid robot show HAIC achieves high success rates in agile tasks.
  arXiv  Detail & Related papers  (2026-02-12T09:34:35Z)
• ReloPush-BOSS: Optimization-guided Nonmonotone Rearrangement Planning for a Car-like Robot Pusher [1.0828616610785522]
  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.
  arXiv  Detail & Related papers  (2026-01-29T20:03:33Z)
• 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)
• Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT) [5.013737017051114]
  We consider a setup where $M robots are tasked to navigate to $M targets in a common space with deadlock obstacles.<n>We derive a strategy based on optimal plannings and guarantee non-overlapping trajectories.<n>We show that a temporal structure can be integrated into optimal transport with the help of textitremodelplans and textitremodelplans as predictive.
  arXiv  Detail & Related papers  (2025-08-28T20:47:33Z)
• RoomCraft: Controllable and Complete 3D Indoor Scene Generation [51.19602078504066]
  RoomCraft is a multi-stage pipeline that converts real images, sketches, or text descriptions into coherent 3D indoor scenes.<n>Our approach combines a scene generation pipeline with a constraint-driven optimization framework.<n>RoomCraft significantly outperforms existing methods in generating realistic, semantically coherent, and visually appealing room layouts.
  arXiv  Detail & Related papers  (2025-06-27T15:03:17Z)
• Efficient Masked AutoEncoder for Video Object Counting and A Large-Scale Benchmark [52.339936954958034]
  The dynamic imbalance of the fore-background is a major challenge in video object counting.<n>We propose a density-embedded Efficient Masked Autoencoder Counting (E-MAC) framework in this paper.<n>In addition, we first propose a large video bird counting dataset, DroneBird, in natural scenarios for migratory bird protection.
  arXiv  Detail & Related papers  (2024-11-20T06:08:21Z)
• BitStack: Any-Size Compression of Large Language Models in Variable Memory Environments [53.71158537264695]
  Large language models (LLMs) have revolutionized numerous applications, yet their deployment remains challenged by memory constraints on local devices.<n>We introduce textbfBitStack, a novel, training-free weight compression approach that enables megabyte-level trade-offs between memory usage and model performance.
  arXiv  Detail & Related papers  (2024-10-31T13:26:11Z)
• 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)
• Mesa: A Memory-saving Training Framework for Transformers [58.78933015299703]
  We present Mesa, a memory-saving training framework for Transformers. Mesa uses exact activations during forward pass while storing a low-precision version of activations to reduce memory consumption during training. Experiments on ImageNet, CIFAR-100 and ADE20K demonstrate that Mesa can reduce half of the memory footprints during training.
  arXiv  Detail & Related papers  (2021-11-22T11:23:01Z)
• 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)
• OSCAR: Data-Driven Operational Space Control for Adaptive and Robust Robot Manipulation [50.59541802645156]
  Operational Space Control (OSC) has been used as an effective task-space controller for manipulation. We propose OSC for Adaptation and Robustness (OSCAR), a data-driven variant of OSC that compensates for modeling errors. We evaluate our method on a variety of simulated manipulation problems, and find substantial improvements over an array of controller baselines.
  arXiv  Detail & Related papers  (2021-10-02T01:21:38Z)
• Goal Kernel Planning: Linearly-Solvable Non-Markovian Policies for Logical Tasks with Goal-Conditioned Options [54.40780660868349]
  We introduce a compositional framework called Linearly-Solvable Goal Kernel Dynamic Programming (LS-GKDP)<n>LS-GKDP combines the Linearly-Solvable Markov Decision Process (LMDP) formalism with the Options Framework of Reinforcement Learning.<n>We show how an LMDP with a goal kernel enables the efficient optimization of meta-policies in a lower-dimensional subspace defined by the task grounding.
  arXiv  Detail & Related papers  (2020-07-06T05:13:20Z)
• Human-like Planning for Reaching in Cluttered Environments [11.55532557594561]
  Humans are remarkably adept at reaching for objects in cluttered environments. We identify high-level manipulation plans in humans, and transfer these skills to robot planners. We found that the human-like planner outperformed a state-of-the-art standard trajectory optimisation algorithm.
  arXiv  Detail & Related papers  (2020-02-28T14:28:50Z)
• Scalable and Probabilistically Complete Planning for Robotic Spatial Extrusion [0.755972004983746]
  We present a rigorous formalization of robotic spatial extrusion planning. We show that, although these constraints often conflict with each other, a greedy backward state-space search guided by a stiffness-aware is able to successfully balance both constraints.
  arXiv  Detail & Related papers  (2020-02-06T17:05:55Z)

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.