arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.18145cs.AIcs.MAcs.RO
收藏

一种用于多机器人计划执行的实时重调度算法

A Real-Time Rescheduling Algorithm for Multi-robot Plan Execution

Carnegie Mellon University(卡内基梅隆大学);Monash University(蒙纳士大学)

Ying Feng, Adittyo Paul, Zhe Chen, Jiaoyang Li

AI总结:

针对多智能体路径寻找中执行延迟引发的重规划问题,提出A*风格的Switchable-Edge Search (SES)算法以寻找最优通过顺序,理论证明其最优性且仿真显示在大型问题上比基线快达4倍。

摘要:

多智能体路径寻找中的一个研究方向是确定在执行期间智能体发生延迟时如何高效实现重规划。一种选择是重新调度智能体的通过顺序,即智能体访问同一位置的先后序列。为此,我们提出 Switchable-Edge Search (SES),这是一种 A* 风格的算法,旨在寻找最优的通过顺序。我们证明了 SES 的最优性,并通过仿真评估了其效率。SES 的最佳变体在中小型问题上耗时不到 1 秒,在大型问题上运行速度比基线快达 4 倍。

英文摘要:

One area of research in multi-agent path finding is to determine how replanning can be efficiently achieved in the case of agents being delayed during execution. One option is to reschedule the passing order of agents, i.e., the sequence in which agents visit the same location. In response, we propose Switchable-Edge Search (SES), an A*-style algorithm designed to find optimal passing orders. We prove the optimality of SES and evaluate its efficiency via simulations. The best variant of SES takes less than 1 second for small- and medium-sized problems and runs up to 4 times faster than baselines for large-sized problems.

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

↑