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

可解释多智能体路径搜索算法

Conflict-Based Search for Explainable Multi-Agent Path Finding

University of Colorado Boulder(科罗拉多大学博尔德分校);Technion(以色列理工学院)

Justin Kottinger, Shaull Almagor, Morteza Lahijanian

摘要:

在多智能体路径查找(MAPF)问题中,目标是为环境中的智能体找到无冲突的路径,使得每个智能体从其初始位置到达其目标。在安全关键应用中,人类监督者可能想要验证计划确实是无冲突的。为此,最近的工作介绍了一个概念的可解释性MAPF的基础上可视化的计划作为一个短序列的图像表示的时间段,其中在每个时间段的代理的轨迹是不相交的。然后,可解释的MAPF问题要求一组不冲突的路径,承认一个足够短的解释。可解释的MAPF给MAPF增加了一个新的困难,因为它是NP难的环境的大小,而不仅仅是代理的数量。因此,传统的MAPF算法不具备直接处理可解释的MAPF。在这项工作中,我们适应基于冲突的搜索(CBS),一个研究的算法MAPF,处理可解释的MAPF。我们将展示如何在标准CBS树及其底层A* 搜索之上添加可解释性约束。我们研究这种方法的有用性,特别是规划时间和可解释性之间的权衡。

英文摘要:

In the Multi-Agent Path Finding (MAPF) problem, the goal is to find non-colliding paths for agents in an environment, such that each agent reaches its goal from its initial location. In safety-critical applications, a human supervisor may want to verify that the plan is indeed collision-free. To this end, a recent work introduces a notion of explainability for MAPF based on a visualization of the plan as a short sequence of images representing time segments, where in each time segment the trajectories of the agents are disjoint. Then, the explainable MAPF problem asks for a set of non-colliding paths that admits a short-enough explanation. Explainable MAPF adds a new difficulty to MAPF, in that it is NP-hard with respect to the size of the environment, and not just the number of agents. Thus, traditional MAPF algorithms are not equipped to directly handle explainable-MAPF. In this work, we adapt Conflict Based Search (CBS), a well-studied algorithm for MAPF, to handle explainable MAPF. We show how to add explainability constraints on top of the standard CBS tree and its underlying A* search. We examine the usefulness of this approach and, in particular, the tradeoff between planning time and explainability.

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

↑