.png){kind=icon}
Return
On evolutionary computing in multi-ship trajectory planning
.png){kind=icon}
OA
AI
DOI：10.1007/s10489-011-0319-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Evolutionary algorithms
Ship collision avoidance
Decision support systems
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
Genetic engineering versus natural evolution -: Genetic algorithms with deterministic operators
.png){kind=icon}
PREAI
ShareSave
ShareSaveShareSaveShareSave
View more