arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.08025cs.ROcs.MA
收藏

STT-CBS:一种基于启发式的多Agent随机行程路径搜索算法

STT-CBS: A Conflict-Based Search Algorithm for Multi-Agent Path Finding with Stochastic Travel Times

Stanford University(斯坦福大学);Cruise Automation

Oriana Peltzer, Kyle Brown, Mac Schwager, Mykel J. Kochenderfer, Martin Sehr

摘要:

我们提出了一个算法,找到最佳路径的多个随机代理在一个图中到达他们的目的地与用户指定的最大成对碰撞概率。我们的算法,称为STT-CBS,使用基于搜索(CBS)与随机旅行时间(STT)模型的代理。我们沿着图的每个边缘的独立的伽马分布的随机变量模型的机器人旅行时间,并提出概率碰撞识别和约束创建方法来鲁棒地处理旅行时间的不确定性。我们表明,在合理的假设下,我们的算法是最佳的旅行时间的预期总和,同时确保每个成对冲突概率的上限。仿真和硬件实验表明,STT-CBS能够显着降低冲突概率CBS,而保持在相同的复杂度类。

英文摘要:

We present an algorithm for finding optimal paths for multiple stochastic agents in a graph to reach their destinations with a user-specified maximum pairwise collision probability. Our algorithm, called STT-CBS, uses Conflict-Based Search (CBS) with a stochastic travel time (STT) model for the agents. We model robot travel time along each edge of the graph by independent gamma-distributed random variables, and propose probabilistic collision identification and constraint creation methods to robustly handle travel time uncertainty. We show that under reasonable assumptions our algorithm is optimal in terms of expected sum of travel times, while ensuring an upper bound on each pairwise conflict probability. Simulations and hardware experiments show that STT-CBS is able to significantly decrease conflict probability over CBS, while remaining within the same complexity class.

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

↑