arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.26684cs.MAcs.RO
收藏

解耦几何规划与执行的可扩展多智能体路径寻找

Decoupling Geometric Planning and Execution in Scalable Multi-Agent Path Finding

Fernando Salanova, Eduardo Montijano, Cristian Mahulea

AI总结:

本文提出一种混合优先级框架,将几何规划与执行时的冲突解决解耦,通过几何冲突预emption和去中心化局部控制器实现高效多智能体路径寻找,实验表明方法在大规模实例中具有线性运行时间趋势和100%成功率。

摘要:

多智能体路径寻找(MAPF)要求在共享图上为多个智能体规划无碰撞轨迹,通常以最小化总成本(SOC)为目标。许多最优和有界次优求解器依赖于时间扩展模型和集中式冲突解决,这限制了在大规模或密集实例中的可扩展性。我们提出了一种混合优先级框架,将几何规划与执行时间冲突解决解耦。第一阶段,几何冲突预emption(GCP)在原始图上使用A*依次规划智能体,通过增加进入已被更高优先级路径使用的顶点的转换成本,鼓励空间绕行,而无需显式时间推理。第二阶段,去中心化局部控制器(DLC)使用每顶点FIFO授权队列执行几何路径,并插入等待动作以避免顶点和边交换冲突。在标准基准地图上进行的实验表明,该方法在1000个智能体的实例中具有接近线性的运行时间趋势,并在满足几何可行性假设的实例中实现了100%的成功率。项目页面:https://sites.google.com/unizar.es/multi-agent-path-finding/home

英文摘要:

Multi-Agent Path Finding (MAPF) requires collision-free trajectories for multiple agents on a shared graph, often with the objective of minimizing the sum-of-costs (SOC). Many optimal and bounded-suboptimal solvers rely on time-expanded models and centralized conflict resolution, which limits scalability in large or dense instances. We propose a hybrid prioritized framework that separates \emph{geometric planning} from \emph{execution-time conflict resolution}. In the first stage, \emph{Geometric Conflict Preemption (GCP)} plans agents sequentially with A* on the original graph while inflating costs for transitions entering vertices used by higher-priority paths, encouraging spatial detours without explicit time reasoning. In the second stage, a \emph{Decentralized Local Controller (DLC)} executes the geometric paths using per-vertex FIFO authorization queues and inserts wait actions to avoid vertex and edge-swap conflicts. Experiments on standard benchmark maps with up to 1000 agents show that the method scales with an near-linear runtime trend and attains a 100\% success rate on instances satisfying the geometric feasibility assumption. Page of the project: https://sites.google.com/unizar.es/multi-agent-path-finding/home

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

↑