Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Dijkstra" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    Learning Search Algorithms: An Educational View
    Autorzy:
    Janota, M.
    Šimák, V.
    Hrbček, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/116502.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Search Algorithm
    Learning Search Algorithms
    educational view
    Artificial Intelligence Method
    Search Method
    Labyrinth
    Dijkstra algorithm
    Opis:
    Artificial intelligence methods find their practical usage in many applications including maritime industry. The paper concentrates on the methods of uninformed and informed search, potentially usable in solving of complex problems based on the state space representation. The problem of introducing the search algorithms to newcomers has its technical and psychological dimensions. The authors show how it is possible to cope with both of them through design and use of specialized authoring systems. A typical example of searching a path through the maze is used to demonstrate how to test, observe and compare properties of various search strategies. Performance of search methods is evaluated based on the common criteria.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8 no. 4; 565-570
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of Graph Searching Algorithms for Route Planning in Inland Navigation
    Autorzy:
    Kazimierski, W.
    Sawczak, A.
    Wawrzyniak, N.
    Powiązania:
    https://bibliotekanauki.pl/articles/117106.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Inland Navigation
    route planning
    Graph Searching Algorithms
    Inland Waters
    Nautical Spatial Data
    Raster Data
    vector data
    Dijkstra’s Algorithm
    Opis:
    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.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 2; 281-286
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the Fuel Saving Operation for Coastal Merchant Ships using Weather Routing
    Autorzy:
    Takashima, K.
    Mezaoui, B.
    Shoji, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/116404.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Weather Routing
    route planning
    Weather Navigation
    Coastal Merchant Ship
    Fuel Saving Operation
    Dijkstra’s Algorithm
    Simulation Study
    Fuel Consumption
    Opis:
    It is well known that Weather Routing is one of the effective ship operation methods to reduce fuel consumption and many studies have been conducted to develop the effective calculation methods. However, most studies were performed focusing on the ocean going ships, and there were few studies made for coastal ships. The authors propose a minimum fuel route calculation method for coastal ships that use the precise forecasted environmental data and the propulsion performance data of the ship on actual seas. In the proposed method, we use the Dijkstra’s algorithm to calculate an optimum minimum fuel route suitable for coastal ships. Simulation study was carried out to evaluate the effectiveness of the proposed method using two coastal ships. As the result of study, the authors confirmed that the proposed calculation method is effective for fuel consumption reduction and is applicable for the operation of coastal merchant ships.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2009, 3, 4; 401-406
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Ship route planning using historical trajectories derived from AIS Data
    Autorzy:
    He, Y. K.
    Zhang, D.
    Zhang, J. F.
    Zhang, M. Y.
    Li, T. W.
    Powiązania:
    https://bibliotekanauki.pl/articles/116536.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    AIS Data
    Automatic Identification System (AIS)
    route planning
    historical trajectories
    AIS messages
    marine traffic
    Dijkstra algorithm
    ant colony algorithm
    Opis:
    Ship route planning is one of the key issues in enhancing traffic safety and efficiency. Many route planning methods have been developed, but most of them are based on the information from charts. This paper proposes a method to generate shipping routes based on historical ship tracks. The ship's historical route information was obtained by processing the AIS data. From which the ship turning point was extracted and clustered as nodes. The ant colony algorithm was used to generate the optimize route. The ship AIS data of the Three Gorges dam area was selected as a case study. The ships’ optimized route was generated, and further compared with the actual ship's navigation trajectory. The results indicate that there is space of improvement for some of the trajectories, especially near the turning areas.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 1; 69-76
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Method of Path Selection in the Graph - Case Study
    Autorzy:
    Neumann, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/116904.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Path Selection
    Method of Path Selection
    graph theory
    Dijkstra algorithm
    route planning
    Cutting-Edge Thinking Mechanisms
    New Paths Searching
    shortest path
    Opis:
    This paper presents a different perspective on the Dijkstra algorithm. In this paper algorithm will be used in the further analysis to find additional paths between nodes in the maritime sector. In many cases, the best solution for a single criterion is not sufficient. I would be the search for more effective solutions of the starting point to use for subsequent analysis or decision making by the captain of the ship. Using cutting-edge thinking mechanisms, it is possible to create a decision support system based on known Dijkstra's algorithm.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8 no. 4; 557-562
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Vessels Route Planning Problem with Uncertain Data
    Autorzy:
    Neumann, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/115957.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    maritime-related data
    route planning
    dempster-shafer theory (DST)
    vessels route planning
    Dijkstra's algorithm
    decision rules
    mathematical theory of evidence
    uncertain data
    Opis:
    The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra's algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2016, 10, 3; 459-464
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    AIS based shipping routes using the dijkstra algorithm
    Autorzy:
    Silveira, P.
    Teixeira, A. P.
    Guedes-Soares, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/116029.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Dijkstra’s Algorithm
    AIS Data
    Automatic Identification System (AIS)
    AIS based shipping routes
    shipping routes
    Vessel Traffic Service (VTS)
    port of Setubal
    Ro-Ro Terminal
    Opis:
    This paper proposes an approach for identifying and characterizing shipping routes using information contained in Automatic Identification System messages broadcasted by ships and recorded by the coastal Vessel Traffic Service centre. The approach consists of using historical Automatic Identification System data to build a graph, where nodes are cells of a grid covering the geographical area being studied and the weights of directional edges are inversely related to ship movements between cells. Based on this graph, the Dijkstra algorithm is used to identify a potential safe route, assumed to be the most used route by ships between two locations. A second graph is created simultaneously, with the same nodes and edges, but with edge weights equal to the average speed of transitions between cells, thus allowing the determination of the average speed profile for any possible path within the graph. The proposed approach is applied to two scenarios: an approach to the port of Lisbon and the entry through the fairway to a RO-RO terminal in the port of Setubal in Portugal.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 3; 565-571
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Towards use of dijkstra algorithm for optimal navigation of an unmanned surface vehicle in a real-time marine environment with results from artificial potential field
    Autorzy:
    Singh, Y.
    Sharma, S.
    Sutton, R.
    Hatton, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/116058.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    autonomous vehicles
    dijkstra’s algorithm
    Unmanned Surface Vehicle (USV)
    port of portsmouth
    Artificial Path Planning (APF)
    Artificial Potential Field
    real-time marine environment
    optimal navigation
    Opis:
    The growing need of ocean surveying and exploration for scientific and industrial application has led to the requirement of routing strategies for ocean vehicles which are optimal in nature. Most of the op-timal path planning for marine vehicles had been conducted offline in a self-made environment. This paper takes into account a practical marine environment, i.e. Portsmouth Harbour, for finding an optimal path in terms of computational time between source and end points on a real time map for an USV. The current study makes use of a grid map generated from original and uses a Dijkstra algorithm to find the shortest path for a single USV. In order to benchmark the study, a path planning study using a well-known local path planning method artificial path planning (APF) has been conducted in a real time marine environment and effectiveness is measured in terms of path length and computational time.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2018, 12, 1; 125-131
    2083-6473
    2083-6481
    Pojawia się w:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies