Donggyun Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Donggyun Kim has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
Katsutoshi Hirayama
Graduate School of Maritime Sciences, Kobe University, Japan)
1 shared publicationTenda Okimoto
Graduate School of Maritime Sciences, Kobe University, Japan)
1 shared publication
Latest Publications
- 30 April 2019
- Published by The Korean Society of Marine Environment and Safety in Journal of the Korean Society of Marine Environment & Safety
- Vol. 25 (2) , 178-188
A Study on Cost Function of Distributed Stochastic Search Algorithm for Ship Collision Avoidance
- 30 April 2019
- Published by The Korean Society of Marine Environment and Safety in Journal of the Korean Society of Marine Environment & Safety
- Vol. 25 (2) , 178-188
A Study on Cost Function of Distributed Stochastic Search Algorithm for Ship Collision Avoidance
- Open Access
- 22 March 2017
- Published by Cambridge University Press (CUP) in Journal of Navigation
- Vol. 70 (4) , 699-718
Distributed Stochastic Search Algorithm for Multi-ship Encounter Situations
Ship collision avoidance involves helping ships find routes that will best enable them to avoid a collision. When more than two ships encounter each other, the procedure becomes more complex since a slight change in course by one ship might affect the future decisions of the other ships. Two distributed algorithms have been developed in response to this problem: Distributed Local Search Algorithm (DLSA) and Distributed Tabu Search Algorithm (DTSA). Their common drawback is that it takes a relatively large number of messages for the ships to coordinate their actions. This could be fatal, especially in cases of emergency, where quick decisions should be made. In this paper, we introduce Distributed Stochastic Search Algorithm (DSSA), which allows each ship to change herintentionin a stochastic manner immediately after receiving all of the intentions from the target ships. We also suggest a new cost function that considers both safety and efficiency in these distributed algorithms. We empirically show that DSSA requires many fewer messages for the benchmarks with four and 12 ships, and works properly for real data from the Automatic Identification System (AIS) in the Strait of Dover.
- 22 March 2017
- Published by Cambridge University Press (CUP) in Journal of Navigation
- Vol. 70 (4) , 699-718
Open AccessDistributed Stochastic Search Algorithm for Multi-ship Encounter Situations
Ship collision avoidance involves helping ships find routes that will best enable them to avoid a collision. When more than two ships encounter each other, the procedure becomes more complex since a slight change in course by one ship might affect the future decisions of the other ships. Two distributed algorithms have been developed in response to this problem: Distributed Local Search Algorithm (DLSA) and Distributed Tabu Search Algorithm (DTSA). Their common drawback is that it takes a relatively large number of messages for the ships to coordinate their actions. This could be fatal, especially in cases of emergency, where quick decisions should be made. In this paper, we introduce Distributed Stochastic Search Algorithm (DSSA), which allows each ship to change herintentionin a stochastic manner immediately after receiving all of the intentions from the target ships. We also suggest a new cost function that considers both safety and efficiency in these distributed algorithms. We empirically show that DSSA requires many fewer messages for the benchmarks with four and 12 ships, and works properly for real data from the Automatic Identification System (AIS) in the Strait of Dover.