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

改进的连续时间冲突搜索算法

Improving Continuous-time Conflict Based Search

Peoples’ Friendship University of Russia (RUDN University)(俄罗斯人民友谊大学);Federal Research Center for Computer Science and Control of Russian Academy of Sciences(俄罗斯科学院计算机科学与控制联邦研究中心);HSE University(高等经济学院);Ben-Gurion University of the Negev(内盖夫本-古里安大学);Palo Alto Research Center(帕洛阿尔托研究中心)

Anton Andreychuk, Konstantin Yakovlev, Eli Boyarski, Roni Stern

摘要:

基于时间的搜索(CBS)是一个强大的算法框架,用于优化解决经典的多智能体路径寻找(MAPF)问题,其中时间被离散为时间步长。连续时间CBS(CCBS)是最近提出的CBS版本,保证最优解,而不需要离散时间。然而,CCBS的可扩展性是有限的,因为它不包括CBS的任何已知的改进。在本文中,我们开始缩小这一差距,并探讨如何适应成功的CBS的改进,即优先冲突(PC),不相交的分裂(DS),和高层次的竞争,连续时间设置的CCBS。这些适应是不平凡的,需要仔细处理不同类型的约束,应用广义版本的安全间隔路径规划(SIPP)算法,并扩展基数冲突的概念。我们通过在一般图和$2^k$邻域网格上运行实验来评估所建议的增强效果。具有这些改进的CCBS显著优于普通CCBS,在某些情况下解决了几乎两倍于多代理的问题,并在连续时间域中推动了多代理路径查找的极限。

英文摘要:

Conflict-Based Search (CBS) is a powerful algorithmic framework for optimally solving classical multi-agent path finding (MAPF) problems, where time is discretized into the time steps. Continuous-time CBS (CCBS) is a recently proposed version of CBS that guarantees optimal solutions without the need to discretize time. However, the scalability of CCBS is limited because it does not include any known improvements of CBS. In this paper, we begin to close this gap and explore how to adapt successful CBS improvements, namely, prioritizing conflicts (PC), disjoint splitting (DS), and high-level heuristics, to the continuous time setting of CCBS. These adaptions are not trivial, and require careful handling of different types of constraints, applying a generalized version of the Safe interval path planning (SIPP) algorithm, and extending the notion of cardinal conflicts. We evaluate the effect of the suggested enhancements by running experiments both on general graphs and $2^k$-neighborhood grids. CCBS with these improvements significantly outperforms vanilla CCBS, solving problems with almost twice as many agents in some cases and pushing the limits of multiagent path finding in continuous-time domains.

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

↑