Bi-directional search in route planning in navigation

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

Abstrakty

EN

The shortest path problem is one of the most significant ones in the field of maritime navigation. One of the most efficient algorithms was proposed by E. Dijkstra in 1959. Taking into account the development of computer technology was offered another interesting approach to the issue. The main idea is to execute the shortest path algorithm simultaneously forward from the source and backward from the target. The results are presented and discussed.

Słowa kluczowe

EN

shortest path; safe route; restricted area; bi-directional search; Dijkstra algorithm

• Wydawca: Wydawnictwo Naukowe Akademii Morskiej w Szczecinie
• Czasopismo: Zeszyty Naukowe / Akademia Morska w Szczecinie
• Rocznik: 2014
• Tom: nr 39 (111)
• Strony: 57--62
• Opis fizyczny: Bibliogr. 7 poz., rys.

Twórcy

autor

Dramski M.

• Maritime University of Szczecin 70-500 Szczecin, ul. Wały Chrobrego 1–2

Bibliografia

• 1. DELLING D., SANDERS P., SCHULTES D., WAGNER D.: Engineering Route Planning Algorithms. Algorithmics of Large and Complex Networks, Springer, 2009.
• 2. DRAMSKI M.: Shortest path problem in static navigation situations. Metody Informatyki Stosowanej 5, 2011.
• 3. DIJKSTRA E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 1959, 269–271.
• 4. POHL I.: Bi-directional Search. In Meltzer Bernard; Michie Donald, Machine Intelligence 6, Edinburgh University Press, 1971, 127–140.
• 5. LI L.N., YANG S.H., CAO B.G., LI Z.F.: A summary of studies on the automation of ship collision avoidance intelligence. Journal of Jimei University, China, Vol. 11, No. 2, 2006, 188–192.
• 6. DRAMSKI M., MĄKA M.: Algorithm of Solving Collision Problem of Two Objects in Restricted Area. Communications in Computer and Information Science 395, Springer 2013, 251–257.
• 7. LIPSKI W.: Kombinatoryka dla programistów. WNT, 2007.