| Full text | |
| Author(s): |
Total Authors: 4
|
| Affiliation: | [1] Univ Fed Minas Gerais, Grad Program Elect Engn, Ave Antonio Carlos 6627, BR-31270901 Belo Horizonte, MG - Brazil
[2] Univ Fed Vales Jequitinhonha & Mucuri, Dept Comp, Rod MGT 367, Km 583, 5000 Alto da Jacuba, BR-39100000 Diamantina - Brazil
[3] Univ Fed Minas Gerais, Dept Elect Engn, BR-31270901 Belo Horizonte, MG - Brazil
Total Affiliations: 3
|
| Document type: | Journal article |
| Source: | SENSORS; v. 21, n. 5 MAR 2021. |
| Web of Science Citations: | 0 |
| Abstract | |
This paper presents matheuristics for routing a heterogeneous group of capacitated unmanned air vehicles (UAVs) for complete coverage of ground areas, considering simultaneous minimization of the coverage time and locating the minimal number of refueling stations. Whereas coverage path planning (CPP) is widely studied in the literature, previous works did not combine heterogeneous vehicle performance and complete area coverage constraints to optimize UAV tours by considering both objectives. As this problem cannot be easily solved, we designed high-level path planning that combines the multiobjective variable neighborhood search (MOVNS) metaheuristic and the exact mathematical formulation to explore the set of nondominated solutions. Since the exact method can interact in different ways with MOVNS, we evaluated four different strategies using four metrics: execution time, coverage, cardinality, and hypervolume. The experimental results show that applying the exact method as an intraroute operator into the variable neighborhood descent (VND) can return solutions as good as those obtained by the closest to optimal strategy but with higher efficiency. (AU) | |
| FAPESP's process: | 14/50851-0 - INCT 2014: National Institute of Science and Technology for Cooperative Autonomous Systems Applied in Security and Environment |
| Grantee: | Marco Henrique Terra |
| Support Opportunities: | Research Projects - Thematic Grants |