By Topic

Modeling of ship trajectory in collision situations by an evolutionary algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. Smierzchalski ; Dept. of Ship Autom., Gdynia Maritime Acad., Poland ; Z. Michalewicz

For a given circumstance (i.e., a collision situation at sea), a decision support system for navigation should help the operator to choose a proper manoeuvre, teach him good habits, and enhance his general intuition on how to behave in similar situations in the future. By taking into account certain boundaries of the maneuvering region along with information on navigation obstacles and other moving ships, the problem of avoiding collisions is reduced to a dynamic optimization task with static and dynamic constraints. This paper presents experiments with a modified version of the Evolutionary Planner/Navigator (EP/N). Its new version, ϑEP/N++, is a major component of a such decision support system. This new extension of EP/N computes a safe-optimum path of a ship in given static and dynamic environments. A safe trajectory of the ship in a collision situation is determined on the basis of this algorithm. The introduction of a time parameter, the variable speed of the ship, and time-varying constraints representing movable ships are the main features of the new system. Sample results of ship trajectories obtained for typical navigation situations are presented

Published in:

IEEE Transactions on Evolutionary Computation  (Volume:4 ,  Issue: 3 )