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
The shortest path problem is one of the most significant ones in the field of maritime navigation. O...
The representation of problems and systems is important. The more unificated representation we get, ...
This paper analyzes the existing algorithms for finding the shortest paths in graphs. Based on Dijks...
Route planning is an important problem for many real-time applications in open and complex environme...
In this paper, the route prediction for a person in water was performed on the basis of a developed ...
This paper presents a different perspective on the Dijkstra algorithm. In this paper algorithm will ...
Searching for the best route through geographical area is a very common matter in computer science. ...
In an information design project at Malardalen University in Sweden a computer based 3-D nautical ch...
This diploma paper, as it results from its title, it puts mind to map search engines and concerning ...
The paper shows the problem solving task of finding the graphs shortest paths by using the Dijkstra&...
Route finding based on geodetic data had addressed the growing data management and analysis needs of...
Glavna tema ovog rada su graf algoritmi za pronalaženje najkraće rute na mapama. U prvom poglavlju d...
This paper proposes an approach for identifying and characterizing shipping routes using information...
Contemporary maritime shipping is subject to a large number of constraints given by tight shipping s...
This work is about routing in maps. There are few topics here: How to prepare a graph from a map, wh...
The shortest path problem is one of the most significant ones in the field of maritime navigation. O...
The representation of problems and systems is important. The more unificated representation we get, ...
This paper analyzes the existing algorithms for finding the shortest paths in graphs. Based on Dijks...
Route planning is an important problem for many real-time applications in open and complex environme...
In this paper, the route prediction for a person in water was performed on the basis of a developed ...
This paper presents a different perspective on the Dijkstra algorithm. In this paper algorithm will ...
Searching for the best route through geographical area is a very common matter in computer science. ...
In an information design project at Malardalen University in Sweden a computer based 3-D nautical ch...
This diploma paper, as it results from its title, it puts mind to map search engines and concerning ...
The paper shows the problem solving task of finding the graphs shortest paths by using the Dijkstra&...
Route finding based on geodetic data had addressed the growing data management and analysis needs of...
Glavna tema ovog rada su graf algoritmi za pronalaženje najkraće rute na mapama. U prvom poglavlju d...
This paper proposes an approach for identifying and characterizing shipping routes using information...
Contemporary maritime shipping is subject to a large number of constraints given by tight shipping s...
This work is about routing in maps. There are few topics here: How to prepare a graph from a map, wh...
The shortest path problem is one of the most significant ones in the field of maritime navigation. O...
The representation of problems and systems is important. The more unificated representation we get, ...
This paper analyzes the existing algorithms for finding the shortest paths in graphs. Based on Dijks...