3.8 Article

Genetic algorithm-based multiple moving target reaching using a fleet of sailboats

Journal

IET CYBER-SYSTEMS AND ROBOTICS
Volume 1, Issue 3, Pages 93-100

Publisher

WILEY
DOI: 10.1049/iet-csr.2019.0029

Keywords

travelling salesman problems; multi-agent systems; genetic algorithms; autonomous underwater vehicles; marine propulsion; autonomous underwater vehicles; motorised vehicles; sailboat movements; genetic algorithm; dynamic travelling salesman problem; multi-agent system; GA; suboptimal solution; wind direction; propulsion

Funding

  1. Engineering and Physical Sciences Research Council (EPSRC) of the UK [EP/R005532/1]

Ask authors/readers for more resources

This study addresses the problem of Dynamic Travelling Salesman Problem for a multi-agent system using a fleet of sailboats. A genetic algorithm (GA) is proposed, which attributes to each agent a varying number of targets to be collected. GA allows obtaining a suboptimal solution in the shortest time possible. Moreover, this study adapts it to the specific problem involving a fleet of sailboats, which is a challenging task with comparison to autonomous underwater vehicles or motorised vehicles in terms of the propulsion. Therein motors can be flexibly controlled while sailboat movements are constrained by available wind direction and speed. Thus the method takes into account wind conditions at various locations of the sailboat. Simulation results demonstrate the effectiveness of the proposed approach.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available