基于冲突搜索的多机器人路径规划的目标并行化
Targeted Parallelization of Conflict-Based Search for Multi-Robot Path Planning
AI总结:
本研究针对多机器人路径规划(MRPP),提出目标并行化策略加速基于冲突的搜索,通过分散并行探索或优先节点扩展,显著提升成功率与运行效率。
摘要:
图上的多机器人路径规划(MRPP),等价于多智能体路径规划(MAPF),是一个公认的NP难问题,具有极其重要的应用。当串行计算在(近)最优求解MRPP时接近计算效率极限,并行化提供了一条有前景的途径来进一步突破极限,尤其是在处理困难或大规模的MRPP实例时。在本研究中,我们发起了一项“目标”并行化工作,以提升用于MRPP的基于冲突搜索的性能。具体而言,当实例相对较小但机器人密集且相互作用强烈时,我们采用一种分散式并行算法,并发探索多个分支,从而显著增强解的发现。另一方面,当实例较大且机器人间相互作用稀疏时,我们优先进行节点扩展和冲突解决。我们创新的多线程方法并行化有界次优的基于冲突搜索算法,在成功率或运行时间上相较于基线串行方法展现出显著改进。我们的贡献进一步推进了对MRPP的理解,并为通过并行算法策略提升解质量和计算效率描绘了一条有前景的路径。
英文摘要:
Multi-Robot Path Planning (MRPP) on graphs, equivalently known as Multi-Agent Path Finding (MAPF), is a well-established NP-hard problem with critically important applications. As serial computation in (near)-optimally solving MRPP approaches the computation efficiency limit, parallelization offers a promising route to push the limit further, especially in handling hard or large MRPP instances. In this study, we initiated a \emph{targeted} parallelization effort to boost the performance of conflict-based search for MRPP. Specifically, when instances are relatively small but robots are densely packed with strong interactions, we apply a decentralized parallel algorithm that concurrently explores multiple branches that leads to markedly enhanced solution discovery. On the other hand, when instances are large with sparse robot-robot interactions, we prioritize node expansion and conflict resolution. Our innovative multi-threaded approach to parallelizing bounded-suboptimal conflict search-based algorithms demonstrates significant improvements over baseline serial methods in success rate or runtime. Our contribution further pushes the understanding of MRPP and charts a promising path for elevating solution quality and computational efficiency through parallel algorithmic strategies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。