A new method for searching optimal path on a raster plane including cost of direction changes

• Autorzy: Szłapczyński R.
• Języki publikacji: EN

Abstrakty

EN

The article introduces a new algorithm for finding optimal routes on raster planes. This method takes advantage of the new data structure and results in minimizing the number of direction changes within a route. It has linear time and space complexities and is sufficiently fast to perform real-time routing on the raster grids. Both the algorithm and its data structure are presented in detail in the paper. Possible applications of this method are also discussed.

Słowa kluczowe

EN

navigation; optimal route; turn penalties; Lee's algorithm; vave propagation; raster charts

• Wydawca: Gdańsk University of Technology, Faculty of Ocean Engineering & Ship Technology
• Czasopismo: Polish Maritime Research
• Rocznik: 2005
• Tom: nr 3
• Strony: 27--31
• Opis fizyczny: Bibliogr. 4 poz., rys.

Twórcy

autor

Szłapczyński R.

• Faculty of Ocean Engineering and Ship Technology, Gdańsk University Technology, Narutowicza 11/12, 80-952 Gdańsk, Poland

Bibliografia

• 1. Chang K. Y., Jan G.E, Parberry I. : A Method for Searching Optimal Routes with Collision Avoidance on Raster Charts. Royal Institute of Navigation. The Journal of Navigation No.56/2003
• 2. Kubale M. : Introduction to Computational Complexity. Wydawnictwo Politechniki Gdańskiej (Publishing House of Gdańsk University of Technology). 1994
• 3. Lee C.Y : An Algorithm for Path Connection and Its Applications. IEEE (Institute of Electrical and Electronics Engineers) Transactions on Electronic Computers, EC-10, 1961
• 4. Weintrit A. : The Electronic Chart Systems and Their Classification. Annual of Navigation, No 3/2001. Polish Academy of Sciences. Polish Navigation Forum, Gdynia 2001