arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.08767quant-phcs.ETcs.RO
收藏

一种面向多机器人覆盖路径规划的量子计算方法

A Quantum Computing Approach for Multi-robot Coverage Path Planning

Poojith U Rao, Florian Speelman, Balwinder Sodhi, Sachin Kinge

AI总结:

针对NP难的多机器人覆盖路径规划问题,提出可与量子启发式算法QAOA集成的二维网格路径探索方法,含目标函数设计、理论证明等五项贡献,为量子计算优化多机器人路径规划奠基。

摘要:

本文研究多机器人覆盖路径规划(Coverage Path Planning, CPP)问题,该问题在搜救、环境监测等场景中具有关键作用。由于其属于NP难问题,当问题规模增大时,传统方法无法求得最优解,因此亟需开发哪怕仅能小幅提升效率的启发式方法。我们提出一种在二维网格中探索路径的新方法,专门设计为可与量子启发式算法Quantum Alternating Operator Ansatz(QAOA,量子交替算子近似)便捷集成。本文的贡献包括:1)专为使用QAOA求解多机器人CPP设计的目标函数;2)证明所提方法有效性的理论推导;3)用于实际落地的QAOA算子高效构建方法;4)评估QAOA执行可行性的资源估算;5)与深度优先搜索等成熟算法的性能对比。本工作为利用量子计算优化多机器人路径规划铺平了道路,有望推动多类应用的实际进展。

英文摘要:

This paper tackles the multi-vehicle Coverage Path Planning (CPP) problem, crucial for applications like search and rescue or environmental monitoring. Due to its NP-hard nature, finding optimal solutions becomes infeasible with larger problem sizes. This motivates the development of heuristic approaches that enhance efficiency even marginally. We propose a novel approach for exploring paths in a 2D grid, specifically designed for easy integration with the Quantum Alternating Operator Ansatz (QAOA), a powerful quantum heuristic. Our contribution includes: 1) An objective function tailored to solve the multi-vehicle CPP using QAOA. 2) Theoretical proofs guaranteeing the validity of the proposed approach. 3) Efficient construction of QAOA operators for practical implementation. 4) Resource estimation to assess the feasibility of QAOA execution. 5) Performance comparison against established algorithms like the Depth First Search. This work paves the way for leveraging quantum computing in optimizing multi-vehicle path planning, potentially leading to real-world advancements in various applications.

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

↑