arXiv (All)
open access
Dynamic Buffers: Cost-Efficient Planning for Tabletop Rearrangement with Stacking
Rearranging objects in cluttered tabletop environments remains a long-standing challenge in robotics. Classical planners often generate inefficient, high-cost plans by moving objects individually and using fixed buffers, temporary spaces such as unoccupied tabletop regions or static stacks, to resol
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Neural Centroidal Voronoi Tessellations#985847
- Grasping by interconnection: robust closing motions from coarse object templates#1013827
- Let It Go or Learn to Self-Correct: Continuous Diffusion for Constrained Discrete Tasks#668036
- CAVEAT: Recurrent Multimodal Diffusion Planning for Mapless Aerial Exploration#974730
- Achieving Asymptotic Near-Optimality Without $δ$-Similarity#927752
Record · ID 1115481
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive