Analysis of Graph Searching Algorithms for Route Planning in Inland Navigation

Abstract

Route planning is one of the core functionalities of modern navigational systems also in inland waters. There is a possibility of at least partial automation of this process with the use of graph searching algorithms. Main problem here is to create a graph based on nautical spatial data. The paper presents research on examining dif-ferent graph searching methods for inland waters. The concept of using combined approach for vector and ras-ter data is given, followed by research results for raster data.

Keywords

• Inland Navigation
• Route Planning
• Graph Searching Algorithms
• Inland Waters
• Nautical Spatial Data
• Raster Data
• Vector Data
• Dijkstra’s Algorithm