arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.02266cs.RO
收藏

面向约束多智能体运动规划的时空冲突球

Space-Time Conflict Spheres for Constrained Multi-Agent Motion Planning

Illinois Mathematics and Science Academy(伊利诺伊数学与科学学院);Carnegie Mellon University(卡内基梅隆大学)

Anirudh Chari, Rui Chen, Changliu Liu

AI总结:

针对多智能体运动规划难题,提出基于时空冲突球与深度优先搜索的方法,兼具可扩展性与计算保证,支持动静态障碍物,在CARLA无信号路口场景中成功率显著提升且扩展性良好。

摘要:

多智能体运动规划(MAMP)是网联自动驾驶车辆、多机器人系统等应用中的关键挑战。本文提出一种面向MAMP的时空冲突消解方法。我们采用一种新颖灵活的基于球体的轨迹离散化方法对问题进行建模。该方法利用深度优先冲突搜索策略,兼具解耦方法的可扩展性与耦合方法的计算保证。我们设计了相关流程,可在生成的解中规避离散化误差并满足运动学约束。理论上,我们证明了算法的连续时间可行性与建模空间完备性。实验方面,我们证明该算法在运行时间与解的质量上均达到当前最优水平,同时通过支持静态与动态障碍物拓展了现有工作的能力边界。我们使用开源车辆模拟器CARLA,在多种无信号交通路口场景下评估算法。结果显示,在涉及网联与非网联车辆的空间受限场景中,成功率显著提升。此外,我们的方法保持了合理的次优比,在复杂度不断提升的场景中具备良好的扩展性。

英文摘要:

Multi-agent motion planning (MAMP) is a critical challenge in applications such as connected autonomous vehicles and multi-robot systems. In this paper, we propose a space-time conflict resolution approach for MAMP. We formulate the problem using a novel, flexible sphere-based discretization for trajectories. Our approach leverages a depth-first conflict search strategy to provide the scalability of decoupled approaches while maintaining the computational guarantees of coupled approaches. We compose procedures for evading discretization error and adhering to kinematic constraints in generated solutions. Theoretically, we prove the continuous-time feasibility and formulation-space completeness of our algorithm. Experimentally, we demonstrate that our algorithm matches the performance of the current state of the art with respect to both runtime and solution quality, while expanding upon the abilities of current work through accommodation for both static and dynamic obstacles. We evaluate our algorithm in various unsignalized traffic intersection scenarios using CARLA, an open-source vehicle simulator. Results show significant success rate improvement in spatially constrained settings, involving both connected and non-connected vehicles. Furthermore, we maintain a reasonable suboptimality ratio that scales well among increasingly complex scenarios.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑