An Improved A-Star Algorithm Considering Water Current, Traffic Separation and Berthing for Vessel Path Planning
Source abstract
Abstract
A traditional A-Star (A*) algorithm generates an optimal path by minimizing the path cost. For a vessel, factors of path length, obstacle collision risk, traffic separation rule and manoeuvrability restriction should be all taken into account for path planning. Meanwhile, the water current also plays an important role in voyaging and berthing for vessels. In consideration of these defects of the traditional A-Star algorithm when it is used for vessel path planning, an improved A-Star algorithm has been proposed. To be specific, the risk models of obstacles (bridge pier, moored or anchored ship, port, shore, etc.) considering currents, traffic separation, berthing, manoeuvrability restriction have been built firstly. Then, the normal path generation and the berthing path generation with the proposed improved A-Star algorithm have been represented, respectively. Moreover, the problem of combining the normal path and the berthing path has been also solved. To verify the effectiveness of the proposed A-Star path planning methods, four cases have been studied in simulation and real scenarios. The results of experiments show that the proposed A-Star path planning methods can deal with the problems denoted in this article well, and realize the trade-off between the path length and the navigation safety.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Maritime Navigation and Safety · Maritime Security and History · Maritime Ports and Logistics
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan 430079, China
School of Remote Sensing and Information Engineering, Wuhan University, Wuhan 430079, China
National Engineering Research Center for Water Transport Safety, Wuhan University of Technology, Wuhan 430063, China
Funding
China Postdoctoral Science Foundation · Wuhan Science and Technology Project · Fundamental Research Funds for the Central Universities
References (19)
Show source-provided references
1. Safe trajectory planning for autonomous intersection management by using vehicle to infrastructure communication10.1186/s13638-015-0243-3 ↗
2. Fernandes, E., Costa, P., Lima, J., and Veiga, G. (2015, January 18). Towards an orientation enhanced Astar algorithm for robotic navigation. Proceedings of the 2015 IEEE International Conference on Industrial Technology (ICIT), Seville, Spain.10.1109/ICIT.2015.7125590 ↗
3. Optimal path planning of mobile robots: A review10.5897/IJPS11.1745 ↗
4. A new method of ship routing on raster grids, with turn penalties and collision avoidance10.1017/S0373463305003528 ↗
5. Kim, H., Park, B., and Myung, H. Curvature path planning with high resolution graph for unmanned surface vehicle. Proceedings of the Robot Intelligence Technology and Applications (RiTA).
6. Lyu, H., and Yin, Y. (2018). Fast path planning for autonomous ships in restricted waters. Appl. Sci., 8.10.3390/app8122592 ↗
7. Lyu, H., and Yin, Y. (2018). COLREGS-constrained real-time path planning for autonomous ships using modified artificial potential fields. J. Navig., 1–21.10.1017/S0373463318000796 ↗
8. Multi-objective path planning for unmanned surface vehicle with currents effects10.1016/j.isatra.2018.02.003 ↗
9. Energy efficient path planning for a marine surface vehicle considering heading angle10.1016/j.oceaneng.2015.07.030 ↗
10. Murdoch, E. (2004). A Master’s Guide to Berthing, Witherby & Company. The Standard.
11. Evolutionary Sets of Safe Ship Trajectories Within Traffic Separation Schemes10.1017/S0373463312000422 ↗
12. Angular rate-constrained path planning algorithm for unmanned surface vehicles10.1016/j.oceaneng.2014.03.034 ↗
13. A note on two problems in connexion with graphs10.1007/BF01386390 ↗
14. Hyperstar: A multi-path Astar algorithm for risk averse vehicle navigation10.1016/j.trb.2008.05.010 ↗
15. A formal basis for the heuristic determination of minimum cost paths10.1109/TSSC.1968.300136 ↗
16. Path planning for robotic boats in a rescue system
17. Multiple UAVs path planning algorithms: A comparative study10.1007/s10700-008-9035-0 ↗
18. Yao, J., Lin, C., Xie, X., Wang, A.J.A., and Hung, C.C. (2010, January 1). Path planning for virtual human motion using improved A* star algorithm. Proceedings of the Seventh International Conference on Information Technology: New Generations (ITNG), Las Vegas, NV, USA.10.1109/ITNG.2010.53 ↗
19. Pochmara, J., Grygiel, W., Koppa, R., and Kaminski, K. (2013, January 10). Mobile robot platform for real-time search algorithms. Proceedings of the 20th International Conference on Mixed Design of Integrated Circuits and Systems, Gdynia, Poland.