优先约束规划任务的多智能体最优路径搜索
Optimal Multi-Agent Path Finding for Precedence Constrained Planning Tasks
摘要:
多智能体路径查找(MAPF)是为多个智能体寻找从其起始位置到结束位置的无冲突路径的问题。我们认为这个问题的扩展,优先约束的多智能体路径查找(PC-MAPF),其中代理被分配一系列的规划任务,其中包含优先约束。PC-MAPF具有各种应用,例如在多代理拾取和递送问题中,其中某些对象可能需要多个代理协同拾取并一致地移动它们。优先约束也出现在仓库装配问题中,在制造任务可以开始之前,其输入资源必须被制造和交付。我们提出了一种新的算法,优先约束的基于冲突的搜索(PC-CBS),这类问题的最大完工时间的最佳解决方案。PC-CBS利用优先级约束任务图为每个计划任务定义有效的时间间隔,并在遇到优先级冲突时更新它们。我们基准测试该算法的性能在各种仓库组装,和多代理的皮卡和交付任务,并使用它来评估最近提出的有效的基线的次优。
英文摘要:
Multi-Agent Path Finding (MAPF) is the problem of finding collision-free paths for multiple agents from their start locations to end locations. We consider an extension to this problem, Precedence Constrained Multi-Agent Path Finding (PC-MAPF), wherein agents are assigned a sequence of planning tasks that contain precedence constraints between them. PC-MAPF has various applications, for example in multi-agent pickup and delivery problems where some objects might require multiple agents to collaboratively pickup and move them in unison. Precedence constraints also arise in warehouse assembly problems where before a manufacturing task can begin, its input resources must be manufactured and delivered. We propose a novel algorithm, Precedence Constrained Conflict Based Search (PC-CBS), which finds makespan-optimal solutions for this class of problems. PC-CBS utilizes a Precedence-Constrained Task-Graph to define valid intervals for each planning task and updates them when precedence conflicts are encountered. We benchmark the performance of this algorithm over various warehouse assembly, and multi-agent pickup and delivery tasks, and use it to evaluate the sub-optimality of a recently proposed efficient baseline.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。