arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.14568cs.AIquant-ph
收藏

混合量子-经典多智能体路径规划

Hybrid Quantum-Classical Multi-Agent Pathfinding

University of Bonn(波恩大学)

Thore Gerlach, Loong Kuan Lee, Frédéric Barbaresco, Nico Piatkowski

AI总结:

该研究提出首个基于分支切割定价的混合量子-经典多智能体路径规划算法,通过迭代求解QUBO问题集成量子计算,在真实量子硬件和基准上优于现有方法。

摘要:

多智能体路径规划(MAPF)专注于为在共享空间中导航以到达指定目标位置的多个智能体确定无冲突路径。当处理大量智能体时,这一问题在计算上变得具有挑战性,这在诸如协调自动驾驶车辆等实际应用中经常遇到。量子计算(QC)是克服此类限制的有前景的候选方案。然而,当前量子硬件仍处于初期阶段,因此在计算能力和错误鲁棒性方面受限。在这项工作中,我们提出了首个基于分支切割定价的最优混合量子-经典MAPF算法。通过基于冲突图迭代求解QUBO问题来集成量子计算。在真实量子硬件上的实验和基准数据结果表明,我们的方法优于先前的QUBO公式和最先进的MAPF求解器。

英文摘要:

Multi-Agent Path Finding (MAPF) focuses on determining conflict-free paths for multiple agents navigating through a shared space to reach specified goal locations. This problem becomes computationally challenging, particularly when handling large numbers of agents, as frequently encountered in practical applications like coordinating autonomous vehicles. Quantum Computing (QC) is a promising candidate in overcoming such limits. However, current quantum hardware is still in its infancy and thus limited in terms of computing power and error robustness. In this work, we present the first optimal hybrid quantum-classical MAPF algorithms which are based on branch-andcut-and-price. QC is integrated by iteratively solving QUBO problems, based on conflict graphs. Experiments on actual quantum hardware and results on benchmark data suggest that our approach dominates previous QUBO formulationsand state-of-the-art MAPF solvers.

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

↑