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

多智能体RRT *:基于采样的协作寻路(扩展摘要)

Multi-agent RRT*: Sampling-based Cooperative Pathfinding (Extended Abstract)

Czech Technical University in Prague(捷克布拉格技术大学);Delft University of Technology(代尔夫特理工大学)

Michal Čáp, Peter Novák, Jiří Vokřínek, Michal Pěchouček

摘要:

合作寻路是为多个移动代理寻找一组不冲突的轨迹的问题。它的应用包括移动机器人团队的规划,如自主飞机,汽车或水下航行器。用于协作寻路的最先进的算法通常依赖于一些启发式前向搜索寻路技术,其中A* 通常是选择的算法。在这里,我们提出了MA-RRT*,一种新的算法,多代理路径规划,建立在最近提出的渐近最优采样为基础的算法,寻找单代理最短路径称为RRT*。我们实验评估的算法的性能,并表明,基于采样的方法提供了更好的可扩展性比经典的前向搜索方法在相对较大,但稀疏的环境,这是典型的在现实世界中的应用,如多飞机防撞。

英文摘要:

Cooperative pathfinding is a problem of finding a set of non-conflicting trajectories for a number of mobile agents. Its applications include planning for teams of mobile robots, such as autonomous aircrafts, cars, or underwater vehicles. The state-of-the-art algorithms for cooperative pathfinding typically rely on some heuristic forward-search pathfinding technique, where A* is often the algorithm of choice. Here, we propose MA-RRT*, a novel algorithm for multi-agent path planning that builds upon a recently proposed asymptotically-optimal sampling-based algorithm for finding single-agent shortest path called RRT*. We experimentally evaluate the performance of the algorithm and show that the sampling-based approach offers better scalability than the classical forward-search approach in relatively large, but sparse environments, which are typical in real-world applications such as multi-aircraft collision avoidance.

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

↑