Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: safe route

Sortuj według:

Ogranicz wyniki do:

Bi-directional search in route planning in navigation

100%

Dramski M.

Zeszyty Naukowe / Akademia Morska w Szczecinie

2014

tom nr 39 (111)

57--62

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.

Artificial intelligence in solving collision problem in restricted area

86%

Mąka M. , Dramski M.

Zeszyty Naukowe / Akademia Morska w Szczecinie

2013

tom nr 36 (108) z. 2

118--122

This paper presents one of the approaches to solve the collision problem in restricted area for two moving objects using artificial intelligence (SACO algorithm). Although AI should be used only when the classic methods fail, a simple comparison between them is very interesting. As we know the main task of navigation is to conduct safely an object from the point of departure to destination. This problem does not seem easy, especially if we consider the movement in restricted areas such narrow passages, ports etc.

Selected shortest path in the graph algorithms with a use of trapezoidal grid

72%

Dramski M. , Mąka M.

Archives of Transport System Telematics

2012

tom Vol. 5, iss. 4

3-7

This paper presents the possiblities of the use of the shortest path in the graph algorithms in ship’s safe route choice process in a restricted area. To create a graph, a trapezoidal mesh based on the S-57 digital map data was used. Numerical experiments were carried out and their results are discussed.