Abstract
The paper presents the updated version of Evolutionary Sets of Safe Ship Trajectories: a method which applies evolutionary algorithms and some of the assumptions of game theory to solving ship encounter situations. For given positions and motion parameters of the ships, the method finds a near optimal set of safe trajectories of all ships involved in an encounter. The method works in real time and the solutions must be returned within one minute, which enforces speeding up the optimization process. During the development of the method we have tested extensively various formulas for fitness function, problem-dedicated specialized operators as well as methods of selection. In the course of this research it turned out that some of the classic evolutionary mechanisms had to be modified for better performance, which included the order of some operations. The results of the adaptation process are presented here. The paper includes explicit description of all evolutionary mechanisms used and accentuates the research on improving the optimization process by adjusting evolutionary mechanisms to the problem.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bayrak AG, Polat F (2010) Formation preserving path finding in 3-D terrains. Appl Intell. Published online: 27.11.2010. doi:10.1007/s10489-010-0265-9
Cheng X, Liu Z (2007) Trajectory optimization for ship navigation safety using genetic annealing algorithm. In: ICNC 2007. Third international conference on natural computation, vol 4, pp 385–392
Cockroft AN, Lameijer JNF (1993) A guide to collision avoidance rules. Butterworth-Heinemann Ltd, Stoneham
Coldwell TG (1983) Marine traffic behaviour in restricted waters. J Navig 36:431–444
COLREGS (1972) Convention on the international regulations for preventing collisions at sea
Davis PV, Dove MJ, Stockel CT (1982) A computer simulation of multi-ship encounters. J Navig 35:347–352
Deep K, Thakur M (2007) A new mutation operator for real coded genetic algorithms. Appl Math Comput 193:211–230
De Falco I, Della Cioppa A, Tarantino E (2002) Mutation-based genetic algorithm: performance evaluation. Appl Soft Comput 1:285–299
Dong H, He, Huang JH, Hou W (2007) Evolutionary programming using a mixed mutation strategy. Inf Sci 177:312–327
Eiben AE, Schoenauer M (2002) Evolutionary computing. Inf Process Lett 82:1–6
Fuji J, Tanaka K (1971) Traffic capacity. J Navig 24:543–552
Goodwin EM (1975) A statistical study of ship domains. J Navig 28:329–341
Ito M, Feifei Z, Yoshida N (1999) Collision avoidance control of ship with genetic algorithm. In: Proceedings of the 1999 IEEE international conference on control applications, vol 2, pp 1791–1796
Jozwiak L, Postula A (2002) Genetic engineering versus natural evolution: genetic algorithms with deterministic operators. J Syst Archit 48:99–112
Linhares A, Yanasse HH (2010) Search intensity versus search diversity: a false trade off? Appl Intell 32:279–291
Lisowski J (2005) Dynamic games methods in navigator decision support system for safety navigation. In: Proceedings of the European safety and reliability conference, vol 2, pp 1285–1292
Michalewicz Z, Fogel DB (2004) How to solve it: modern heuristics. Springer, Berlin
Michalewicz Z, Schoenauer M (1996) Evolutionary algorithms for constrained parameter optimization problems. J Evol Comput 4(1):1–32
Pradhan SK, Parhi DR, Panda AK, Behera RK (2006) Potential field method to navigate several mobile robots. Appl Intell 25:321–333
Smierzchalski R, Michalewicz Z (2000) Modeling of a ship trajectory in collision situations at sea by evolutionary algorithm. IEEE Trans Evol Comput 3(4):227–241
Statheros T, Howells G, McDonald-Maier K (2008) Autonomous ship collision avoidance navigation concepts, technologies and techniques. J Navig 61:129–142
Szlapczynski R (2006) A unified measure of collision risk derived from the concept of a ship domain. J Navig 59:477–490
Szlapczynski R (2006) A new method of ship routing on raster grids, with turn penalties and collision avoidance. J Navig 59:27–42
Szlapczynski R (2008) A new method of planning collision avoidance manoeuvres for multi target encounter situations. J Navig 61:307–321
Szlapczynski R (2011) Evolutionary sets of safe ship trajectories: a new approach to collision avoidance. J Navig 64:169–181
Tam CK, Bucknall R (2010) Path-planning algorithm for ships in close-range encounters. J Mar Sci Technol 15:395–407
Tsou MC, Hsueh CK (2010) The study of ship collision avoidance route planning by ant colony algorithm. J Mar Sci Technol 18(5):746–756
Tsou M-C, Kao S-L, Su C-M (2010) Decision support from genetic algorithms for ship collision avoidance route planning and alerts. J Navig 63:167–182
Xue Y, Lee BS, Han D (2009) Automatic collision avoidance of ships. Proc Inst Mech Eng, Part M J Eng Marit Environ, 33–46
Yang LL, Cao S-H, Li BZ (2006) A summary of studies on the automation of ship collision avoidance intelligence. J Jimei Univ (Nat Sci):2
Zeng X (2003) Evolution of the safe path for ship navigation. Appl Artif Intell 17:87–104
Zhao X, Gao XS, Hu ZC (2007) Evolutionary programming based on non-uniform mutation. Appl Math Comput 192:1–11
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Szlapczynski, R., Szlapczynska, J. On evolutionary computing in multi-ship trajectory planning. Appl Intell 37, 155–174 (2012). https://doi.org/10.1007/s10489-011-0319-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-011-0319-7