Genetic algorithm-based multiple moving target reaching using a fleet of sailboats
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 tim...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-11-01
|
Series: | IET Cyber-systems and Robotics |
Subjects: | |
Online Access: | https://digital-library.theiet.org/content/journals/10.1049/iet-csr.2019.0029 |
id |
doaj-2e286ad06b144546be114c37912c84bc |
---|---|
record_format |
Article |
spelling |
doaj-2e286ad06b144546be114c37912c84bc2021-04-02T13:48:13ZengWileyIET Cyber-systems and Robotics2631-63152019-11-0110.1049/iet-csr.2019.0029IET-CSR.2019.0029Genetic algorithm-based multiple moving target reaching using a fleet of sailboatsViel Christophe0Vaultier Ulysse1Vaultier Ulysse2Wan Jian3Jaulin Luc4School of Engineering, Computing and Mathematics, University of PlymouthSchool of Engineering, Computing and Mathematics, University of PlymouthSchool of Engineering, Computing and Mathematics, University of PlymouthSchool of Engineering, Computing and Mathematics, University of PlymouthLab STICC, ENSTA BretagneThis 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.https://digital-library.theiet.org/content/journals/10.1049/iet-csr.2019.0029travelling salesman problemsmulti-agent systemsgenetic algorithmsautonomous underwater vehiclesmarine propulsionautonomous underwater vehiclesmotorised vehiclessailboat movementsgenetic algorithmdynamic travelling salesman problemmulti-agent systemgasuboptimal solutionwind directionpropulsion |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Viel Christophe Vaultier Ulysse Vaultier Ulysse Wan Jian Jaulin Luc |
spellingShingle |
Viel Christophe Vaultier Ulysse Vaultier Ulysse Wan Jian Jaulin Luc Genetic algorithm-based multiple moving target reaching using a fleet of sailboats IET Cyber-systems and Robotics 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 |
author_facet |
Viel Christophe Vaultier Ulysse Vaultier Ulysse Wan Jian Jaulin Luc |
author_sort |
Viel Christophe |
title |
Genetic algorithm-based multiple moving target reaching using a fleet of sailboats |
title_short |
Genetic algorithm-based multiple moving target reaching using a fleet of sailboats |
title_full |
Genetic algorithm-based multiple moving target reaching using a fleet of sailboats |
title_fullStr |
Genetic algorithm-based multiple moving target reaching using a fleet of sailboats |
title_full_unstemmed |
Genetic algorithm-based multiple moving target reaching using a fleet of sailboats |
title_sort |
genetic algorithm-based multiple moving target reaching using a fleet of sailboats |
publisher |
Wiley |
series |
IET Cyber-systems and Robotics |
issn |
2631-6315 |
publishDate |
2019-11-01 |
description |
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. |
topic |
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 |
url |
https://digital-library.theiet.org/content/journals/10.1049/iet-csr.2019.0029 |
work_keys_str_mv |
AT vielchristophe geneticalgorithmbasedmultiplemovingtargetreachingusingafleetofsailboats AT vaultierulysse geneticalgorithmbasedmultiplemovingtargetreachingusingafleetofsailboats AT vaultierulysse geneticalgorithmbasedmultiplemovingtargetreachingusingafleetofsailboats AT wanjian geneticalgorithmbasedmultiplemovingtargetreachingusingafleetofsailboats AT jaulinluc geneticalgorithmbasedmultiplemovingtargetreachingusingafleetofsailboats |
_version_ |
1721563912276541440 |