Skip to main content
×
×
Home

Distributed Stochastic Search Algorithm for Multi-ship Encounter Situations

  • Donggyun Kim (a1), Katsutoshi Hirayama (a1) and Tenda Okimoto (a1)
Abstract

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 her intention in 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.

  • View HTML
    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Distributed Stochastic Search Algorithm for Multi-ship Encounter Situations
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Distributed Stochastic Search Algorithm for Multi-ship Encounter Situations
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Distributed Stochastic Search Algorithm for Multi-ship Encounter Situations
      Available formats
      ×
Copyright
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Corresponding author
(E-mail: kimdg421@gmail.com)
References
Hide All
COLREGS. (1972). (with amendments adopted from December 2009). Convention on the International Regulations for Preventing Collisions at Sea. International Maritime Organization, London.
Fujii, Y. and Tanaka, K. (1971). Traffic Capacity. The Journal of Navigation, 24(4), 543552.
Glover, F. (1989). Tabu Search-Part I. ORSA. Journal on Computing, 1(3), 190206.
Goodwin, E.M. (1975). A Statistical Study of Ship Domains. The Journal of Navigation, 28(3), 328344.
Hirayama, K. and Yokoo, M. (2005). The Distributed Breakout Algorithms. Artificial Intelligence, 161(1–2), 89115.
Hornauer, S. (2013). Decentralised Collision Avoidance in a Semi-Collaborative Multi-Agent System. Multiagent System Technologies: 11th German Conference, MATES 2013, 412415.
Hornauer, S., Hahn, A., Blaich, M. and Reuter, J. (2015). Trajectory Planning with Negotiation for Maritime Collision Avoidance. International Journal on Marine Navigation and Safety of Sea Transportation, 9(3), 335341.
Hu, Q., Yang., C., Chen., H. and Xiao, B. (2008). Planned Route Based Negotiation for Collision Avoidance between Vessels. The International Journal on Marine Navigation and Safety of Sea Transportation, 2(4), 363368.
Kim, D., Hirayama, K. and Park, G. (2014). Collision Avoidance in Multiple-Ship Situations by Distributed Local Search. Journal of Advanced Computational Intelligence and Intelligent Informatics, 18(5), 839848.
Kim, D., Hirayama, K. and Okimoto, T. (2015). Ship Collision Avoidance by Distributed Tabu Search. The International Journal on Marine Navigation and Safety of Sea Transportation, 9(1), 2329.
Lazarowska, A. (2015). Ship's Trajectory Planning for Collision Avoidance at Sea Based on Ant Colony Optimisation. The Journal of Navigation, 68(2), 291307.
Lamb, W.G.P. and Hunt, J.M. (1995). Multiple Crossing Encounters. The Journal of Navigation, 48(1), 105113.
Lamb, W.G.P. and Hunt, J.M. (2000). Multiple Encounter Avoidance Manoeuvres. The Journal of Navigation, 53(1), 181186.
Lee, S., Kwon, K. and Joh, J. (2004). A Fuzzy Logic for Autonomous Navigation of Marine Vehicles Satisfying COLREG Guidelines. International Journal of Control, Automation and Systems, 2(2), 171181.
Sormunen, O., Hanninen, M. and Kujala, P. (2016). Marine Traffic, Accidents, and Underreporting in the Baltic Sea. Zeszyty Naukowe, 46(118), 163177.
Szlapczynski, R. (2006). A Unified Measure of Collision Risk derived from the Concept of a Ship Domain. The Journal of Navigation, 59(3), 477490.
Szlapczynski, R. (2011). Evolutionary Sets of Safe Ship Trajectories: A New Approach to Collision Avoidance. The Journal of Navigation, 64(1), 169181.
Szlapczynski, R. (2015). Evolutionary Planning of Safe Ship Tracks in Restricted Visibility. The Journal of Navigation, 68(1), 3951.
Tsou, M., Kao, S. and Su, C. (2010). Decision Support from Genetic Algorithms for Ship Collision Avoidance Route Planning and Alerts. The Journal of Navigation, 63(1), 167182.
Tsou, M. and Hsueh, C. (2010). The Study of Ship Collision Avoidance Route Planning by Ant Colony Algorithm. Journal of Marine Science and Technology, 18(5), 746756.
Wang, N., Meng, X., Xu, Q. and Wang, Z. (2009). A Unified Analytical Framework for Ship Domains. The Journal of Navigation, 62(4), 643655.
Yokoo, M. and Hirayama, K. (1996). Distributed Breakout Algorithm for Solving Distributed Constraint. Proceedings of Second International Conference on Multi-Agent Systems (ICMAS-1996), 401408.
Zhang, W., Wang, G. and Wittenburg, L. (2002). Distributed Stochastic Search for Constraint Satisfaction and Optimization: Parallelism, Phase Transitions and Performance: Proceedings of the Association for the Advancement of Artificial Intelligence (AAAI-2002), 5359.
Zhang, W., Wang, G., Xing, Z. and Wittenburg, L. (2005). Distributed Stochastic Search and Distributed Breakout: Properties, Comparison and Applications to Constraint Optimization Problems in Sensor Networks. Artificial Intelligence, 161(1–2), 5587.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Navigation
  • ISSN: 0373-4633
  • EISSN: 1469-7785
  • URL: /core/journals/journal-of-navigation
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Metrics

Full text views

Total number of HTML views: 31
Total number of PDF views: 324 *
Loading metrics...

Abstract views

Total abstract views: 314 *
Loading metrics...

* Views captured on Cambridge Core between 22nd March 2017 - 19th April 2018. This data will be updated every 24 hours.