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

7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Christophe, V., Ulysse, V., Jian, W., & Luc, J. (2019). Genetic algorithm-based multiple moving target reaching using a fleet of sailboats. IET Cyber-Systems and Robotics, 1(3), 93–100. https://doi.org/10.1049/iet-csr.2019.0029

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free