论基于冲突的搜索的完备性:时间相对重复剪枝
On the Completeness of Conflict-Based Search: Temporally-Relative Duplicate Pruning
AI总结:
针对多智能体路径规划中CBS算法对无解问题不完备的缺陷,提出时间相对重复剪枝技术,通过检测避免重复状态扩展填补理论漏洞,在保障终止的同时多数情况不影响运行效率,部分场景还能提升性能。
摘要:
用于多智能体路径规划(MAPF)问题的基于冲突的搜索(CBS)算法存在一个问题:它对于无解的问题是不完备的;若未并行运行缓解程序,给定不可解的问题实例时,CBS将永远运行。在本研究中,我们提出时间相对重复剪枝(Temporally-Relative Duplicate Pruning, TRDP),这是一种可用于经典和连续时间MAPF领域的重复检测与移除技术。TRDP是一种简单的程序,它通过检测并避免重复状态的扩展,填补了CBS长期存在的不完备性理论漏洞。理论和实验均表明,TRDP可确保算法终止,且在大多数问题实例中对运行时间无显著影响;在某些情况下,TRDP还能大幅提升性能。
英文摘要:
Conflict-Based Search (CBS) algorithm for the multi-agent pathfinding (MAPF) problem is that it is incomplete for problems which have no solution; if no mitigating procedure is run in parallel, CBS will run forever when given an unsolvable problem instance. In this work, we introduce Temporally-Relative Duplicate Pruning (TRDP), a technique for duplicate detection and removal in both classic and continuous-time MAPF domains. TRDP is a simple procedure which closes the long-standing theoretic loophole of incompleteness for CBS by detecting and avoiding the expansion of duplicate states. TRDP is shown both theoretically and empirically to ensure termination without a significant impact on runtime in the majority of problem instances. In certain cases, TRDP is shown to increase performance significantly
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。