Handling swarm of UAVs based on evolutionary multi-objective optimization. Ramirez-Atencia, C., R-Moreno, M., & Camacho, D. Progress in Artificial Intelligence, 2017. abstract bibtex © 2017, Springer-Verlag Berlin Heidelberg. The fast technological improvements in unmanned aerial vehicles (UAVs) has created new scenarios where a swarm of UAVs could operate in a distributed way. This swarm of vehicles needs to be controlled from a set of ground control stations, and new reliable mission planning systems, which should be able to handle the large amount of variables and constraints. This paper presents a new approach where this complex problem has been modelled as a constraint satisfaction problem (CSP), and is solved using a multi-objective genetic algorithm (MOGA). The algorithm has been designed to minimize several variables of the mission, such as the fuel consumption or the makespan among others. The designed fitness function, used by the algorithm, takes into consideration, as a weighted penalty function, the number of constraints fulfilled for each solution. Therefore, the MOGA algorithm is able to manage the number of constraints fulfilled by the selected plan, so it is possible to maximize in the elitism phase of the MOGA the quality of the solutions found. This approach allows to alleviate the computational effort carried out by the CSP solver, finding new solutions from the Pareto front, and therefore reducing the execution time to obtain a solution. In order to test the performance of this new approach 16 different mission scenarios have been designed. The experimental results show that the approach outperforms the convergence of the algorithm in terms of number of generations and runtime.
@article{
title = {Handling swarm of UAVs based on evolutionary multi-objective optimization},
type = {article},
year = {2017},
identifiers = {[object Object]},
keywords = {Constraint satisfaction problems,Mission planning,Multi-objective genetic algorithm,Unmanned aerial vehicles},
volume = {6},
id = {ed7b8b90-b395-31f6-8fe8-0f76519e6527},
created = {2019-03-18T15:00:28.450Z},
file_attached = {false},
profile_id = {77ead516-4fb7-3189-a920-09efa515b9dd},
last_modified = {2019-03-18T15:00:28.450Z},
read = {false},
starred = {false},
authored = {true},
confirmed = {false},
hidden = {false},
private_publication = {false},
abstract = {© 2017, Springer-Verlag Berlin Heidelberg. The fast technological improvements in unmanned aerial vehicles (UAVs) has created new scenarios where a swarm of UAVs could operate in a distributed way. This swarm of vehicles needs to be controlled from a set of ground control stations, and new reliable mission planning systems, which should be able to handle the large amount of variables and constraints. This paper presents a new approach where this complex problem has been modelled as a constraint satisfaction problem (CSP), and is solved using a multi-objective genetic algorithm (MOGA). The algorithm has been designed to minimize several variables of the mission, such as the fuel consumption or the makespan among others. The designed fitness function, used by the algorithm, takes into consideration, as a weighted penalty function, the number of constraints fulfilled for each solution. Therefore, the MOGA algorithm is able to manage the number of constraints fulfilled by the selected plan, so it is possible to maximize in the elitism phase of the MOGA the quality of the solutions found. This approach allows to alleviate the computational effort carried out by the CSP solver, finding new solutions from the Pareto front, and therefore reducing the execution time to obtain a solution. In order to test the performance of this new approach 16 different mission scenarios have been designed. The experimental results show that the approach outperforms the convergence of the algorithm in terms of number of generations and runtime.},
bibtype = {article},
author = {Ramirez-Atencia, C. and R-Moreno, M.D. and Camacho, D.},
journal = {Progress in Artificial Intelligence},
number = {3}
}
Downloads: 0
{"_id":"cKgvJnt5sgwufZxfk","bibbaseid":"ramirezatencia-rmoreno-camacho-handlingswarmofuavsbasedonevolutionarymultiobjectiveoptimization-2017","authorIDs":["5d15e717ca6007da010000a6"],"author_short":["Ramirez-Atencia, C.","R-Moreno, M.","Camacho, D."],"bibdata":{"title":"Handling swarm of UAVs based on evolutionary multi-objective optimization","type":"article","year":"2017","identifiers":"[object Object]","keywords":"Constraint satisfaction problems,Mission planning,Multi-objective genetic algorithm,Unmanned aerial vehicles","volume":"6","id":"ed7b8b90-b395-31f6-8fe8-0f76519e6527","created":"2019-03-18T15:00:28.450Z","file_attached":false,"profile_id":"77ead516-4fb7-3189-a920-09efa515b9dd","last_modified":"2019-03-18T15:00:28.450Z","read":false,"starred":false,"authored":"true","confirmed":false,"hidden":false,"private_publication":false,"abstract":"© 2017, Springer-Verlag Berlin Heidelberg. The fast technological improvements in unmanned aerial vehicles (UAVs) has created new scenarios where a swarm of UAVs could operate in a distributed way. This swarm of vehicles needs to be controlled from a set of ground control stations, and new reliable mission planning systems, which should be able to handle the large amount of variables and constraints. This paper presents a new approach where this complex problem has been modelled as a constraint satisfaction problem (CSP), and is solved using a multi-objective genetic algorithm (MOGA). The algorithm has been designed to minimize several variables of the mission, such as the fuel consumption or the makespan among others. The designed fitness function, used by the algorithm, takes into consideration, as a weighted penalty function, the number of constraints fulfilled for each solution. Therefore, the MOGA algorithm is able to manage the number of constraints fulfilled by the selected plan, so it is possible to maximize in the elitism phase of the MOGA the quality of the solutions found. This approach allows to alleviate the computational effort carried out by the CSP solver, finding new solutions from the Pareto front, and therefore reducing the execution time to obtain a solution. In order to test the performance of this new approach 16 different mission scenarios have been designed. The experimental results show that the approach outperforms the convergence of the algorithm in terms of number of generations and runtime.","bibtype":"article","author":"Ramirez-Atencia, C. and R-Moreno, M.D. and Camacho, D.","journal":"Progress in Artificial Intelligence","number":"3","bibtex":"@article{\n title = {Handling swarm of UAVs based on evolutionary multi-objective optimization},\n type = {article},\n year = {2017},\n identifiers = {[object Object]},\n keywords = {Constraint satisfaction problems,Mission planning,Multi-objective genetic algorithm,Unmanned aerial vehicles},\n volume = {6},\n id = {ed7b8b90-b395-31f6-8fe8-0f76519e6527},\n created = {2019-03-18T15:00:28.450Z},\n file_attached = {false},\n profile_id = {77ead516-4fb7-3189-a920-09efa515b9dd},\n last_modified = {2019-03-18T15:00:28.450Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {© 2017, Springer-Verlag Berlin Heidelberg. The fast technological improvements in unmanned aerial vehicles (UAVs) has created new scenarios where a swarm of UAVs could operate in a distributed way. This swarm of vehicles needs to be controlled from a set of ground control stations, and new reliable mission planning systems, which should be able to handle the large amount of variables and constraints. This paper presents a new approach where this complex problem has been modelled as a constraint satisfaction problem (CSP), and is solved using a multi-objective genetic algorithm (MOGA). The algorithm has been designed to minimize several variables of the mission, such as the fuel consumption or the makespan among others. The designed fitness function, used by the algorithm, takes into consideration, as a weighted penalty function, the number of constraints fulfilled for each solution. Therefore, the MOGA algorithm is able to manage the number of constraints fulfilled by the selected plan, so it is possible to maximize in the elitism phase of the MOGA the quality of the solutions found. This approach allows to alleviate the computational effort carried out by the CSP solver, finding new solutions from the Pareto front, and therefore reducing the execution time to obtain a solution. In order to test the performance of this new approach 16 different mission scenarios have been designed. The experimental results show that the approach outperforms the convergence of the algorithm in terms of number of generations and runtime.},\n bibtype = {article},\n author = {Ramirez-Atencia, C. and R-Moreno, M.D. and Camacho, D.},\n journal = {Progress in Artificial Intelligence},\n number = {3}\n}","author_short":["Ramirez-Atencia, C.","R-Moreno, M.","Camacho, D."],"bibbaseid":"ramirezatencia-rmoreno-camacho-handlingswarmofuavsbasedonevolutionarymultiobjectiveoptimization-2017","role":"author","urls":{},"keyword":["Constraint satisfaction problems","Mission planning","Multi-objective genetic algorithm","Unmanned aerial vehicles"],"downloads":0},"bibtype":"article","creationDate":"2019-06-28T10:08:23.809Z","downloads":0,"keywords":["constraint satisfaction problems","mission planning","multi-objective genetic algorithm","unmanned aerial vehicles"],"search_terms":["handling","swarm","uavs","based","evolutionary","multi","objective","optimization","ramirez-atencia","r-moreno","camacho"],"title":"Handling swarm of UAVs based on evolutionary multi-objective optimization","year":2017}