Skip to content
Trending eventHistorical event

Dual-Arm Tabletop Rearrangement with Movable Stacking and Gap-Aware Push Transfers

1 reports1 reporting sourcesUpdated 4 days ago

Overview

Event synthesis

This research presents a dual-arm rearrangement framework that integrates movable stacking with gap-aware push transfers to facilitate asynchronous cross-boundary object exchanges in cluttered tabletop environments. The method identifies collision-free transfer gaps along shared boundaries, places objects near selected crossing points, and pushes them into receiving workspaces without requiring simultaneous arm interaction. A joint Monte Carlo Tree Search (MCTS)-based planner coordinates both manipulators while reasoning over buffering and transfer decisions, with execution cost used post-planning to assess plan quality. Experiments demonstrate that the proposed approach shortens joint execution sequences and outperforms fixed handoff baselines as scene density increases, achieving lower execution costs in denser scenes while remaining competitive in lighter ones.

Generated from attributed reports · Updated 2 days ago

Event evidence and corrections

0 attributed source owners. Ownership does not establish independent confirmation. Quantities are reported separately and are never added together.

No current evidence-backed claims. Missing information remains not reported.

Report timeline

Follow attributed reports and material updates.

11/6
  1. arXiv Robotics — research abstractsSignal
    Dual-Arm Tabletop Rearrangement with Movable Stacking and Gap-Aware Push Transfers

    This research presents a dual-arm rearrangement framework that integrates movable stacking with gap-aware push transfers to facilitate asynchronous cross-boundary object exchanges in cluttered tabletop environments. The method identifies collision-free transfer gaps along shared boundaries, places objects near selected crossing points, and pushes them into receiving workspaces without requiring simultaneous arm interaction. A joint Monte Carlo Tree Search (MCTS)-based planner coordinates both manipulators while reasoning over buffering and transfer decisions, with execution cost used post-planning to assess plan quality. Experiments demonstrate that the proposed approach shortens joint execution sequences and outperforms fixed handoff baselines as scene density increases, achieving lower execution costs in denser scenes while remaining competitive in lighter ones.

Timezone · UTC

Article dates follow your selected timezone. Briefing editions use Hong Kong time (UTC+8).