Dijkstra算法
计算机科学
最短路径问题
锁(火器)
网络拓扑
路径(计算)
频道(广播)
拓扑(电路)
A*搜索算法
算法
计算机网络
工程类
图形
理论计算机科学
电气工程
机械工程
作者
Zhibo He,Chenguang Liu,Xiumin Chu,Kang Zhang,Pulin Zhang,Sumaiye Abduwahap
标识
DOI:10.1109/ictis60134.2023.10243673
摘要
Complex navigational conditions make it difficult for ship navigators to always generate safe and efficient paths in variable ship traffic flow, especially considering navigational constraints such as waterway grade, traffic congestion and lock nodes. This paper proposes a channel-based topology structure and establish a navigable waterway model in consideration of navigational constraints and lock nodes in inland waterway network. Moreover, an improved A-star algorithm based on channel topology is studied to achieve the shortest time path planning for the dynamic waterway network. Results from five case studies show that the proposed method outperforms both Dijkstra algorithm and traditional A-star algorithm in terms of computational efficiency and path generation.
科研通智能强力驱动
Strongly Powered by AbleSci AI