科技创新与应用2024，Vol.14Issue(30)：12-15,4.DOI:10.19981/j.CN23-1581/G3.2024.30.003
水库库容无人船自动巡航路径规划算法与仿真实验
吴健 1何良 1曹晓桢1
作者信息
- 1. 长江水利委员会水文局长江下游水文水资源勘测局,南京 210011
- 折叠
摘要
Abstract
This paper mainly explores the shortest path planning algorithm for automatic cruising of unmanned ships in reservoir storage capacity,and carries out simulation verification to the application effect of the algorithm.Using the simulated annealing algorithm,the shortest path can be found based on the supplementary measurement points,but the number of cycles is large and the time is long.Through the supplementary measurement point clustering process,the supplementary measurement points are divided into several point clusters and then the shortest path is found again,which takes a significantly shorter time.However,there is still a problem of large path differences between different point clusters.After using the point cluster adjustment algorithm,the shortest paths between different point clusters are ensured to be similar,achieving the purposes of reducing energy consumption and improving efficiency.The simulation results show that after the adjustment of the point clusters,the difference between the shortest paths among the three point clusters changes from 70 398.48 m to 15 356.29 m,which achieves balanced energy consumption and high accuracy in the automatic cruise path planning of multiple unmanned ships.关键词
无人船/自动巡航路径规划/模拟退火算法/聚类算法/最短路径Key words
unmanned ship/automatic cruise path planning/simulated annealing algorithm/clustering algorithm/shortest path分类
交通工程引用本文复制引用
吴健,何良,曹晓桢..水库库容无人船自动巡航路径规划算法与仿真实验[J].科技创新与应用,2024,14(30):12-15,4.
