arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.03992cs.AI
收藏

多智能体寻路算法的自动选择

Automatic Algorithm Selection In Multi-agent Pathfinding

University of Alberta(阿尔伯塔大学);Washington University in St. Louis(圣路易斯华盛顿大学);Universidad Andres Bello(安德烈斯·贝略大学);University of Southern California(南加州大学)

Devon Sigurdson, Vadim Bulitko, Sven Koenig, Carlos Hernandez, William Yeoh

摘要:

在多智能体寻路(MAPF)问题中,智能体需要从它们的起点导航到它们的目标位置,而不会相互碰撞。有各种MAPF算法,包括窗口层次合作A*,流注释重规划,有界多智能体A*。通常情况下,没有一个单一的算法可以支配所有的MAPF实例。因此,在本文中,我们研究了使用深度学习从给定MAPF问题实例的算法组合中自动选择最佳MAPF算法。实证结果表明,我们的自动算法选择方法,它使用了现成的卷积神经网络,是能够优于任何个人的MAPF算法在我们的投资组合。

英文摘要:

In a multi-agent pathfinding (MAPF) problem, agents need to navigate from their start to their goal locations without colliding into each other. There are various MAPF algorithms, including Windowed Hierarchical Cooperative A*, Flow Annotated Replanning, and Bounded Multi-Agent A*. It is often the case that there is no a single algorithm that dominates all MAPF instances. Therefore, in this paper, we investigate the use of deep learning to automatically select the best MAPF algorithm from a portfolio of algorithms for a given MAPF problem instance. Empirical results show that our automatic algorithm selection approach, which uses an off-the-shelf convolutional neural network, is able to outperform any individual MAPF algorithm in our portfolio.

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

↑