Wszystkie pola: shortest route - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Bi-directional search in route planning in navigation
Autorzy:: Dramski, M.
Powiązania:: https://bibliotekanauki.pl/articles/360091.pdf
Data publikacji:: 2014
Wydawca:: Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:: shortest path
safe route
restricted area
bi-directional search
Dijkstra algorithm
Opis:: 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.
Źródło:: Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2014, 39 (111); 57-62
1733-8670
2392-0378
Pojawia się w:: Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Selected shortest path in the graph algorithms with a use of trapezoidal grid
Autorzy:: Dramski, M.
Mąka, M.
Powiązania:: https://bibliotekanauki.pl/articles/393451.pdf
Data publikacji:: 2012
Wydawca:: Polskie Stowarzyszenie Telematyki Transportu
Tematy:: nawigacja
najkrótsza trasa
ograniczony teren
shortest path
safe route
restricted area
navigation
trapezoidal grid
Opis:: 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.
Źródło:: Archives of Transport System Telematics; 2012, 5, 4; 3-7
1899-8208
Pojawia się w:: Archives of Transport System Telematics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Artificial intelligence in solving collision problem in restricted area
Autorzy:: Mąka, M.
Dramski, M.
Powiązania:: https://bibliotekanauki.pl/articles/359349.pdf
Data publikacji:: 2013
Wydawca:: Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:: shortest path
safe route
restricted area
trapezoidal grid
area discretization
simplified ant algorithm
A* algorithm
Opis:: 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.
Źródło:: Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 36 (108) z. 2; 118-122
1733-8670
2392-0378
Pojawia się w:: Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja