Lazy-DaSH:基于超图的多机器人任务与运动规划的惰性方法
Lazy-DaSH: Lazy Approach for Hypergraph-based Multi-robot Task and Motion Planning
AI总结:
Lazy-DaSH通过分层惰性验证和约束反馈机制,在超图多机器人任务与运动规划中实现两倍以上扩展和十倍提速。
摘要:
我们提出了Lazy-DaSH,这是对近期最先进的多机器人任务与运动规划方法DaSH的改进。在应用于多机械臂物体重排问题时,Lazy-DaSH可扩展到的机器人和物体数量是原始方法的两倍以上,并且规划速度提高了一个数量级。我们通过分层方法实现这一改进,其中高层任务规划层识别完成任务所需的规划空间,并且仅在这些空间内惰性地验证运动可行性。相比之下,DaSH预先计算所有可能动作的运动可行性,导致构建状态空间表示的成本更高。Lazy-DaSH通过在其分层结构内利用约束反馈机制来保持高效的查询性能,确保运动可行性有效地传达给查询过程。通过保持更小的状态空间表示,我们的方法显著减少了表示构建时间和查询时间。我们在四个不同场景中评估了Lazy-DaSH,展示了其对不断增加机器人和物体数量的可扩展性,以及通过约束反馈机制解决冲突的适应性。
英文摘要:
We introduce Lazy-DaSH, an improvement over the recent state of the art multi-robot task and motion planning method DaSH, which scales to more than double the number of robots and objects compared to the original method and achieves an order of magnitude faster planning time when applied to a multi-manipulator object rearrangement problem. We achieve this improvement through a hierarchical approach, where a high-level task planning layer identifies planning spaces required for task completion, and motion feasibility is validated lazily only within these spaces. In contrast, DaSH precomputes the motion feasibility of all possible actions, resulting in higher costs for constructing state space representations. Lazy-DaSH maintains efficient query performance by utilizing a constraint feedback mechanism within its hierarchical structure, ensuring that motion feasibility is effectively conveyed to the query process. By maintaining smaller state space representations, our method significantly reduces both representation construction time and query time. We evaluate Lazy-DaSH in four distinct scenarios, demonstrating its scalability to increasing numbers of robots and objects, as well as its adaptability in resolving conflicts through the constraint feedback mechanism.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。