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ę "search algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    Ship Collision Avoidance by Distributed Tabu Search
    Autorzy:
    Kim, D.
    Hirayama, K.
    Okimoto, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/116919.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Safety of Navigation
    Collision Avoidance
    Distributed Tabu Search Algorithm (DTSA)
    Distributed Local Search Algorithm (DLSA)
    Quasi-Local Minimum (QLM)
    Tabu Search Algorithm
    Local Search Algorithm
    Distributed Tabu Search
    Opis:
    More than 90% of world trade is transported by sea. The size and speed of ships is rapidly increasing in order to boost economic efficiency. If ships collide, the damage and cost can be astronomical. It is very difficult for officers to ascertain routes that will avoid collisions, especially when multiple ships travel the same waters. There are several ways to prevent ship collisions, such as lookouts, radar, and VHF radio. More advanced methodologies, such as ship domain, fuzzy theory, and genetic algorithm, have been proposed. These methods work well in one-on-one situations, but are more difficult to apply in multiple-ship situations. Therefore, we proposed the Distributed Local Search Algorithm (DLSA) to avoid ship collisions as a precedent study. DLSA is a distributed algorithm in which multiple ships communicate with each other within a certain area. DLSA computes collision risk based on the information received from neighboring ships. However, DLSA suffers from Quasi-Local Minimum (QLM), which prevents a ship from changing course even when a collision risk arises. In our study, we developed the Distributed Tabu Search Algorithm (DTSA). DTSA uses a tabu list to escape from QLM that also exploits a modified cost function and enlarged domain of next-intended courses to increase its efficiency. We conducted experiments to compare the performance of DLSA and DTSA. The results showed that DTSA outperformed DLSA.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 1; 23-29
    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ł:
    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ł:
    DSSA+: distributed collision avoidance algorithm in an environment where both course and speed changes are allowed
    Autorzy:
    Hirayama, K.
    Miyake, K.
    Shiotani, T.
    Okimoto, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/116483.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    collision avoidance
    collision avoidance algorithm
    vessel course changes
    vessel speed changes
    Distributed Stochastic Search Algorithm (DSSA)
    colregs
    ARPA
    Distributed Constraint Optimization Problem (DCOP)
    Opis:
    Distributed Stochastic Search Algorithm (DSSA) is one of state-of-the-art distributed algorithms for the ship collision avoidance problem. In DSSA, whenever a ship encounters with any number of other ships (neighboring ships), she will select her course with a minimum cost after coordinating their decisions with her neighboring ships. The original DSSA assumes that ships can change only their courses while keeping their speed considering kinematic properties of ships in general. However, considering future possibilities to address more complex situations that may cause ship collision or to deal with collision of other vehicles (such as mobile robots or drones), the options of speed changes are necessary for DSSA to make itself more flexible and extensive. In this paper, we present DSSA+, as a generalization of DSSA, in which speed change are naturally incorporated as decision variables in the original DSSA. Experimental evaluations are provided to show how powerful this generalization is.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 1; 117-123
    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ł:
    Verification of ships trajectory planning algorithms using real navigational data
    Autorzy:
    Lazarowska, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/117103.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    Visibility Graph-search Algorithm (VGA)
    Discrete Artificial Potential Field (DAPF)
    real navigational data
    ARPA
    ship's trajectory planning
    ship's trajectory planning algorithms
    Ant Colony Optimization (ACO)
    Trajectory Base Algorithm (TBA)
    Opis:
    The paper presents results of ship's safe trajectory planning algorithms verification. Real navigational data registered from a radar with an Automatic Radar Plotting Aid on board the research and training ship Horyzont II were used as input data to the algorithms. The algorithms verified in the presented research include the Ant Colony Optimization algorithm (ACO), the Trajectory Base Algorithm (TBA), the Visibility Graph-search Algorithm (VGA) ant the Discrete Artificial Potential Field algorithm (DAPF). Details concerning data registration and exemplary results obtained with the use or real navigational data are introduced and summarized in the paper. Presented results prove the applicability of proposed algorithms for solving the ship's safe trajectory planning problem.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 3; 559-564
    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ł:
    An Adaptation of an Algorithm of Search and Rescue Operations to Ship Manoeuvrability
    Autorzy:
    Kasyk, L.
    Pleskacz, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/116946.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    search and rescue (SAR)
    Ship Manoeuvrability
    Algorithm
    Search and Rescue Operations
    Hydrometeorological Conditions
    IAMSAR
    SAR Action Algorithm
    ECDIS
    Opis:
    This article presents an overview of an algorithm to facilitate action when planning search and rescue operations, taking into account actual hydro-meteorological conditions and the maneuverability of ships involved in the search.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 2; 265-268
    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ł:
    Derivative free optimal thrust allocation in ship dynamic positioning based on direct search algorithms
    Autorzy:
    Valčić, M.
    Prpić-Oršić, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/116991.pdf
    Data publikacji:
    2020
    Wydawca:
    Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
    Tematy:
    algorithm
    dynamic positioning
    direct search algorithms
    sequential quadratic programing (SQP)
    Singular Values Decomposition (SVD)
    Lagrangian Multiplier Method (LMM)
    Direct Search (DS)
    Mesh Adaptive Direct Search (MADS)
    Opis:
    In dynamic positioning systems, nonlinear cost functions, as well as nonlinear equality and inequality constraints within optimal thrust allocation procedures cannot be handled directly by means of the solvers like industry-standardized quadratic programing (QP), at least not without appropriate linearization technique applied, which can be computationally very expensive. Thus, if optimization requirements are strict, and problem should be solved for nonlinear objective function with nonlinear equality and inequality constraints, than one should use some appropriate nonlinear optimization technique. The current state-of-the-art in nonlinear optimization for gradient-based algorithms is surely the sequential quadratic programing (SQP), both for general applications and specific thrust allocation problems. On the other hand, in recent time, one can also notice the increased applications of gradient-free optimization methods in various engineering problems. In this context, the implementation of selected derivative free direct search algorithms in optimal thrust allocation is proposed and discussed in this paper, and avenues for future research are provided.
    Źródło:
    TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2020, 14, 2; 309-314
    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-6 z 6

      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