首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >Global Path Planning for Unmanned Surface Vehicle Based on Improved Quantum Ant Colony Algorithm
【24h】

Global Path Planning for Unmanned Surface Vehicle Based on Improved Quantum Ant Colony Algorithm

机译:基于改进量子蚁群算法的无人面车辆的全局路径规划

获取原文
           

摘要

As a tool to monitor marine environments and to perform dangerous tasks instead of manned vessels, unmanned surface vehicles (USVs) have extensive applications. Because most path planning algorithms have difficulty meeting the mission requirements of USVs, the purpose of this study was to plan a global path with multiple objectives, such as path length, energy consumption, path smoothness, and path safety, for USV in marine environments. A global path planning algorithm based on an improved quantum ant colony algorithm (IQACA) is proposed. The improved quantum ant colony algorithm is an algorithm that benefits from the high efficiency of quantum computing and the optimization ability of the ant colony algorithm. The proposed algorithm can plan a path considering multiple objectives simultaneously. The simulation results show that the proposed algorithm’s obtained minimum was 2.1–6.5% lower than those of the quantum ant colony algorithm (QACA) and ant colony algorithm (ACA), and the number of iterations required to converge to the minimum was 11.2–24.5% lower than those of the QACA and ACA. In addition, the optimized path for the USV was obtained effectively and efficiently.
机译:作为监控海洋环境和执行危险任务而不是载人船只的工具,无人面的表面车辆(USV)具有广泛的应用。由于大多数路径规划算法难以满足USV的任务要求,因此本研究的目的是规划具有多种目标的全局路径,例如路径长度,能量消耗,路径平滑度和路径安全,在海洋环境中为USV。提出了一种基于改进量子蚁群算法(IQACA)的全局路径规划算法。改进的量子蚁群算法是一种从量子计算的高效率和蚁群算法的优化能力有益的算法。所提出的算法可以同时考虑多个目标的路径。仿真结果表明,该算法的最低算法低于量子蚁群算法(QACA)和蚁群算法(ACA)的最低算法(QACA),并且收敛到最小值所需的迭代次数为11.2-24.5 %低于Qaca和ACA的%。此外,有效且有效地获得USV的优化路径。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号