基于交互避碰和局部受限路径搜索的分布式多智能体导航
Distributed Multi-agent Navigation Based on Reciprocal Collision Avoidance and Locally Confined Multi-agent Path Finding
摘要:
避碰是多智能体导航的核心问题。在分散的设置中,当代理具有有限的通信和感知能力时,通常以反应方式避免冲突,依赖于本地观察/通信。突出的碰撞避免技术,如ORCA,计算效率高,规模以及大量的代理。然而,在许多情况下,涉及导航通过狭窄的通道或有限的空间,死锁很可能会发生由于自私的行为的代理,因此,后者不能实现他们的目标。为此,我们建议一个应用程序的局部限制多代理路径查找(MAPF)求解器,协调子组的代理,似乎是在一个僵局(检测后者,我们建议一个简单的,但有效的特设例程)。我们提出了一种方法来建立一个基于网格的MAPF实例,通常需要现代MAPF求解器。我们评估其中两个在我们的实验中,即推和旋转和有界次优版本的基于冲突的搜索(ECBS),并表明,他们的列入导航管道显着增加了成功率,从15%到99%,在某些情况下。
英文摘要:
Avoiding collisions is the core problem in multi-agent navigation. In decentralized settings, when agents have limited communication and sensory capabilities, collisions are typically avoided in a reactive fashion, relying on local observations/communications. Prominent collision avoidance techniques, e.g. ORCA, are computationally efficient and scale well to a large number of agents. However, in numerous scenarios, involving navigation through the tight passages or confined spaces, deadlocks are likely to occur due to the egoistic behaviour of the agents and as a result, the latter can not achieve their goals. To this end, we suggest an application of the locally confined multi-agent path finding (MAPF) solvers that coordinate sub-groups of the agents that appear to be in a deadlock (to detect the latter we suggest a simple, yet efficient ad-hoc routine). We present a way to build a grid-based MAPF instance, typically required by modern MAPF solvers. We evaluate two of them in our experiments, i.e. Push and Rotate and a bounded-suboptimal version of Conflict Based Search (ECBS), and show that their inclusion into the navigation pipeline significantly increases the success rate, from 15% to 99% in certain cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。