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

多智能体路径规划作为QUBO问题

Multi-Agent Route Planning as a QUBO Problem

Department of Computers and Informatics, Faculty of Electrical Engineering and Informatics, Technical University of Košice(科希策技术大学电气工程与信息学院计算机与信息学系)

Renáta Rusnáková, Martin Chovanec, Juraj Gazda

AI总结:

本文将多智能体路径规划问题建模为QUBO问题,通过证明其NP难性并推导出编码路线效用奖励和配对重叠惩罚的二次无约束二进制优化公式,探讨了覆盖与重叠的权衡策略。

摘要:

多智能体路径规划考虑选择车辆,每辆车关联一个预定义路线,以最大化路线级覆盖效用同时限制冗余空间重叠。本文给出了正式的问题定义,通过归约到加权集合打包问题证明了NP难性,并推导出一个二次无约束二进制优化公式,其系数直接编码路线效用奖励和配对重叠惩罚。单个惩罚参数λ控制覆盖-重叠权衡。我们区分了支持多目标探索的软模式和在惩罚足够强以有效强制近似不相交路线的硬模式。我们描述了生成城市实例、构建候选路线、构建QUBO矩阵并使用二元二次规划基线(Gurobi)、模拟退火和D-Wave混合量子退火求解的实用流程。在巴塞罗那实例上进行的实验揭示了清晰的覆盖-重叠膝点,并显示在硬惩罚模式下主要获得帕累托最优解,而D-Wave混合求解器和Gurobi在匹配配置中仅表现出微小的运行时间差异。

英文摘要:

Multi-Agent Route Planning considers selecting vehicles, each associated with a single predefined route, such that route-level coverage utility is maximized while redundant spatial overlaps are limited. This paper gives a formal problem definition, proves NP-hardness by reduction from the Weighted Set Packing problem, and derives a Quadratic Unconstrained Binary Optimization formulation whose coefficients directly encode route utility rewards and pairwise overlap penalties. A single penalty parameter $λ$ controls the coverage--overlap trade-off. We distinguish between a soft regime, which supports multi-objective exploration, and a hard regime, in which the penalty is strong enough to effectively enforce near-disjoint routes. We describe a practical pipeline for generating city instances, constructing candidate routes, building the QUBO matrix, and solving it with a binary quadratic programming baseline (Gurobi), simulated annealing, and D-Wave hybrid quantum annealing. Experiments on Barcelona instances with up to $10{,}000$ vehicles reveal a clear coverage--overlap knee and show that Pareto-optimal solutions are mainly obtained under the hard-penalty regime, while D-Wave hybrid solvers and Gurobi achieve very similar objective values on matching configurations with only minor runtime differences as problem size grows.

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

↑