Shortest path problem in static navigation situations

• Autorzy: Dramski, M.
• Języki publikacji: EN

Abstrakty

EN

The main task of each navigator is to conduct safely the ship from the point of departure to destination. Although there are many different solutions of this problem, it's still necessary to carry out further research. This is dictated by the specific requirements that are specified, for example by the dynamics of the ship's own or reservoir characteristics. This article presents a short review of different methods such Dijkstra, Bellman-Ford, Floyd or A* algorithms applied to navigation problems. Besides some alternative methods based on artificial intelligence are mentioned. At the end a comparison of these solutions showed the advantages and disadvantages of each approach.

Słowa kluczowe

EN

shortest path; navigation; restricted area

• Czasopismo: Metody Informatyki Stosowanej
• Rocznik: 2011
• Tom: nr 5
• Strony: 173-180
• Opis fizyczny: Bibliogr. 5 poz., rys., tab.

Twórcy

autor

Dramski, M.

• Maritime University of Szczecin

Bibliografia

• [1] Dijkstra, E. W. A note on two problems in connexion with graphs. Numerische Mathematik 1, 1959, pp. 269–271
• [2] Dorigo M., Stutzle T. Ant Colony Optimization. MIT Press, 2004.
• [3] Dramski M., Mąka M., The choice of ship's safe route in a restricted area with the use of quadtrees for a simplified ant algorithm. Marine Traffic Engineering Conference MTE 2011, October 12-14, Świnoujście 2011
• [4] Lipski W., Kombinatoryka dla programistów, WNT 2007
• [5] Śmierzchalski R., Michalewicz Z. Modeling of ship trajectory in collision situations by an evolutionary algorithm. IEEE Transactions on Evolutionary Computation, Vol. 4, 2000, pp. 227-241.