树上无标记石子移动的最优解及其在多智能体路径寻找中的应用
Optimal Unlabeled Pebble Motion on Trees and its Application to Multi-Agent Path Finding
AI总结:
本文提出树上无标记石子移动问题的最优算法,实现线性时间复杂度,并将其应用于树结构中的多智能体路径寻找问题,提供新的最优完成时间、成本总和和石子移动计划长度的界。
摘要:
给定一棵树,一些石子初始位于树的某些节点,以及一组目标节点,树上无标记石子移动问题(UPMT)要求找到一个计划,将石子逐个从起始节点移动到目标节点,沿树的边移动,同时最小化移动次数。本文提出了首个最优算法来解决UPMT,该算法的时间复杂度与输入大小(树)和输出大小(最优计划)成线性关系。我们扩展该算法以在树上解决无标记多智能体路径寻找(MAPF)问题,提供了新的最优完成时间、成本总和和石子移动计划长度的界。
英文摘要:
Given a tree, a set of pebbles initially stationed at some nodes of the tree, and a set of target nodes, the Unlabeled Pebble Motion on Trees problem (UPMT) asks to find a plan to move the pebbles one-at-a-time from the starting nodes to the target nodes along the edges of the tree while minimizing the number of moves. This paper proposes the first optimal algorithm for UPMT that is asymptotically as fast as possible, as it runs in a time linear in the size of the input (the tree) and the size of the output (the optimal plan). We extend this to solve unlabeled Multi-Agent Path Finding (MAPF) in trees, providing novel bounds on optimal makespan, sum of costs, and pebble motion plan length.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。