基于优先级继承和回溯的迭代多智能体路径搜索
Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding
摘要:
在多智能体路径查找(MAPF)问题中,一组在图上移动的智能体必须到达各自的目的地,而不会发生智能体间的冲突。在实际的MAPF应用中,例如自动化仓库中的导航,偶尔会有数百个或更多的代理,MAPF必须在终身的基础上迭代在线解决。这样的场景排除了离线计算密集型最优方法的简单适应;因此,可扩展的次优算法对这样的设置很有吸引力。理想的算法是可扩展的,适用于迭代场景,并在可预测的计算时间内输出合理的解决方案。为了达到上述目的,本研究提出了优先级继承回溯(PIBT),一种新的次优算法来迭代求解MAPF。PIBT依赖于一个自适应的优先级方案,专注于多个代理的相邻运动,因此它可以应用于几个领域。我们证明了,无论他们的数量,所有的代理都保证在有限的时间内到达他们的目的地时,环境是一个图,使得所有对相邻节点属于一个简单的循环(例如,双连接的)。涵盖各种场景的实验结果,包括与真实机器人的演示,揭示了所提出的方法的好处。即使有数百个代理,PIBT几乎立即产生可接受的解决方案,并可以解决其他已建立的MAPF方法无法解决的大型实例。此外,PIBT在运行时和解决方案质量方面都优于在自动化仓库中传送包的迭代场景中的现有方法。
英文摘要:
In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph must reach their own respective destinations without inter-agent collisions. In practical MAPF applications such as navigation in automated warehouses, where occasionally there are hundreds or more agents, MAPF must be solved iteratively online on a lifelong basis. Such scenarios rule out simple adaptations of offline compute-intensive optimal approaches; and scalable sub-optimal algorithms are hence appealing for such settings. Ideal algorithms are scalable, applicable to iterative scenarios, and output plausible solutions in predictable computation time. For the aforementioned purpose, this study presents Priority Inheritance with Backtracking (PIBT), a novel sub-optimal algorithm to solve MAPF iteratively. PIBT relies on an adaptive prioritization scheme to focus on the adjacent movements of multiple agents; hence it can be applied to several domains. We prove that, regardless of their number, all agents are guaranteed to reach their destination within finite time when the environment is a graph such that all pairs of adjacent nodes belong to a simple cycle (e.g., biconnected). Experimental results covering various scenarios, including a demonstration with real robots, reveal the benefits of the proposed method. Even with hundreds of agents, PIBT yields acceptable solutions almost immediately and can solve large instances that other established MAPF methods cannot. In addition, PIBT outperforms an existing approach on an iterative scenario of conveying packages in an automated warehouse in both runtime and solution quality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。