Genetic algorithm-based multiple moving target reaching using a fleet of sailboats - ENSTA Bretagne - École nationale supérieure de techniques avancées Bretagne Accéder directement au contenu
Article Dans Une Revue IET Cyber-Systems and Robotics Année : 2019

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

Christophe Viel
Jian Wan
  • Fonction : Auteur
Luc Jaulin

Résumé

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.

Dates et versions

hal-02434947 , version 1 (10-01-2020)

Identifiants

Citer

Christophe Viel, Ulysse Vaultier, Jian Wan, Luc Jaulin. Genetic algorithm-based multiple moving target reaching using a fleet of sailboats. IET Cyber-Systems and Robotics, 2019, 1 (3), pp.93-100. ⟨10.1049/iet-csr.2019.0029⟩. ⟨hal-02434947⟩
45 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More