Application of a visibility graph in ship’s path planning

Authors

  • A. Lazarowska Akademia Morska w Gdyni, Morska 81–87, 81-581 Gdynia, Wydział Elektryczny, Katedra Automatyki Okrętowej

Keywords:

Dijkstra’s algorithm, visibility graph, ship’s path planning, graph theory, collision avo

Abstract

The article presents a proposal for solving the problem of determining a ship’s safe path using one of the graph theory methods. The aim of the study was to evaluate the possibility of the selected graph theory method application in planning a ship’s global route, taking into account the static navigational restrictions (lands, shallows). The navigational environment was modelled as a visibility graph using a rotational plane sweep algorithm. The shortest ship’s path is then determined using a Dijkstra's algorithm.

Downloads

Published

2017-10-30

How to Cite

Lazarowska, A. (2017). Application of a visibility graph in ship’s path planning. Scientific Journal of Gdynia Maritime University, (98), 116–121. Retrieved from https://sjgmu.umg.edu.pl/index.php/sjgmu/article/view/221

Issue

No. 98 (2017)

Section

Articles

License

Copyright (c) 2017 The Author(s)

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors retain the copyright to their work, licensing it under the Creative Commons Attribution License Attribution 4.0 International licence (CC BY 4.0) which allows articles to be re-used and re-distributed without restriction, as long as the original work is correctly cited. The author retains unlimited copyright and publishing rights.