量子黏菌算法在路径规划中的应用OA
Application of Quantum Slime Mold Algorithm in Path Planning
针对黏菌算法在路径规划中寻优精度不高和易陷入局部最优的问题,创新性地提出了一种量子-经典混合算法——量子黏菌算法,以探索量子计算与黏菌算法的混合优化潜力.算法深度融合量子计算与黏菌算法框架,利用量子比特叠加态的性质提升搜索空间覆盖能力,并通过单次量子测量高效映射至解空间.算法设计包含可实现个体信息交互的加权变换机制和基于信道组合模型的黏菌位置更新机制,并引入量子旋转门自适应调整策略引导算法不断趋向全局最优解.基于栅格地图的实验仿真结果表明,即使在量子噪声干扰下,量子黏菌算法生成的路径长度与黏菌算法相同,且能稳定收敛,迭代次数增幅较小,验证了算法良好的噪声鲁棒性.通过量子-经典算法混合创新设计,量子黏菌算法成功应用于栅格地图环境下的路径规划问题.
To address the issues of low optimization accuracy and susceptibility to local optima in the standard slime mold algorithm(SMA)for path planning,this paper proposes a novel quantum-classical hybrid algorithm,the quantum slime mold algorithm(QSMA).QSMA integrates quantum computing principles into the SMA framework,leveraging the superposition property of qubits to enhance solution space coverage and utilizing single quantum measurement for effi-cient solution mapping.Key features include a weighted transformation mechanism facilitating information exchange among individuals and a position update mechanism based on a combined quantum channel model(amplitude and phase damping),complemented by an adaptive quantum rotation gate strategy to steer the search towards the global optimum.Crucially,simulation results on grid maps demonstrate the effectiveness of the algorithm and notable noise robustness under quantum noise interference.Even with added noise,QSMA consistently finds paths of the same optimal length as SMA,maintains stable convergence,and exhibits only a modest increase in iteration count.This innovative quantum-classical hybrid design enables the successful application of QSMA to path planning problems in grid map environments.
刘凯;石皓;张明
国防科技大学 智能科学学院,长沙 410073国防科技大学 智能科学学院,长沙 410073国防科技大学 智能科学学院,长沙 410073
信息技术与安全科学
量子黏菌算法路径规划量子计算噪声鲁棒性启发式算法
quantum slime mold algorithmpath planningquantum computingnoise robustnessheuristic algorithm
《计算机工程与应用》 2026 (15)
133-144,12
国家自然科学基金(61673389).
评论