检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:耿正霖 程兴华[2] 包长春[2] GENG Zhenglin;CHENG Xinghua;BAO Changchun(College of Electronic Science and Technology,National University of Defense Technology,Changsha 410073,China;College of Meteorology and Oceanography,National University of Defense Technology,Changsha 410073,China)
机构地区:[1]国防科技大学电子科学学院,湖南长沙410073 [2]国防科技大学气象海洋学院,湖南长沙410073
出 处:《国防科技大学学报》2024年第6期88-95,共8页Journal of National University of Defense Technology
基 金:国家自然科学基金资助项目(61702531)。
摘 要:针对目前水下航行器航路规划结果适用性不强的问题,提出一种基于改进粒子群算法的水下航行器三维航路规划算法。基于海区真实地形数据构建维诺图,利用Dijkstra算法生成满足航行安全要求的初始航路集,作为粒子群算法的初始粒子,提高了初始粒子生成效率,同时改进粒子位置更新方法,根据航路上节点的毗邻节点的位置引导粒子位置变化,使得规划航路更加平滑,更适于水下航行器的航行。仿真结果表明,该算法较传统粒子群算法,规划航路适用性更好,且优化结果更稳健。Aiming at the problem of poor applicability of current path planning results for underwater vehicles,a three-dimensional path planning algorithm for underwater vehicles based on improved particle swarm optimization algorithm was proposed.A Voronoi map based on the real terrain data of sea area was built,and the Dijkstra algorithm was used to generate the initial path set that meets the requirements of navigation safety as the initial particles of particle swarm optimization algorithm,so the generation efficiency of initial particles was improved.At the same time,the particles′position update method was improved to guide the particle position change according to the position of adjacent nodes on the route,which makes the planned route smoother and more suitable for the navigation of underwater vehicles.Simulation results show that the proposed algorithm is more robust and has better applicability than the traditional particle swarm optimization algorithm in path planning.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38