LAMP让多机器人在密集环境中高效协作完成长时序抓取任务
LAMP: Long-Horizon Adaptive Manipulation Planning for Multi-Robot Collaboration in Cluttered Space

- 用生成模型结合经典规划,分阶段解决多机耦合运动与碰撞问题
- 在高度杂乱场景中成功完成前人无法处理的长时序操作任务
- 适合需要高精度协同作业的工业自动化、仓储物流等场景
多机器人操作需联合考虑接触构型、受耦合动力学影响的机器人运动及避障。系统性搜索该大规模空间极为困难,且随着机器人数量增加、任务周期延长或环境更密集,求解难度急剧上升。现有方法要么通过强化学习端到端求解,要么将规划简化为仅规划物体运动并学习短时接触原语。但二者均难以扩展至我们关注的:极密环境中长时序多机器人操作。本文提出长时序自适应操作规划框架LAMP,融合生成模型与经典规划思想。我们基于成熟规划技术A*和懒惰搜索设计两种算法:LAMP-A*系统搜索耦合的物-机空间;LAMP-Lazy采用延迟评估机制,实现实时重规划。在挑战性仿真环境中验证表明,该方法能解决先前方法无法处理的复杂长时序任务。
原文摘要 · Abstract (English)
Multi-robot manipulation requires jointly reasoning about contact formations, robot motions under coupled dynamics, and collision avoidance. Systematically searching over this large space is difficult and becomes increasingly intractable as the number of robots grows, the task horizon lengthens, or the scene becomes more densely cluttered. Existing approaches therefore either learn to solve the problem end-to-end via reinforcement learning or restrict planning to a simpler surrogate problem, such as planning object motions while learning short-horizon contact primitives. However, neither paradigm scales to the problem instances we target: long-horizon multi-robot manipulation in extremely dense environments. In this paper, we propose Long-horizon Adaptive Manipulation Planning (LAMP), a framework combining a generative model for manipulation with classical planning for long-horizon reasoning. We instantiate our framework with two algorithms leveraging insights from established planning techniques, A* and lazy search: LAMP-A*, which systematically searches over the coupled object-robot space, and LAMP-Lazy, a lazy planner that enables real-time replanning through deferred evaluation. Experiments in challenging simulated environments demonstrate that our approach solves complex long-horizon tasks in highly cluttered environments that prior methods cannot handle.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。