Bipartite Cooperative Coevolution for Energy-Aware Coverage Path Planning of UAVs
- Authors
- Shao, Xian-Xin; Gong, Yue-Jiao; Zhan, Zhi-Hui; Zhang, Jun
- Issue Date
- Feb-2022
- Publisher
- IEEE
- Keywords
- Cooperative coevolution; coverage path planning (CPP); energy consumption; heuristic; UAVs
- Citation
- IEEE Transactions on Artificial Intelligence (TAI), v.3, no.1, pp 29 - 42
- Pages
- 14
- Indexed
- SCOPUS
- Journal Title
- IEEE Transactions on Artificial Intelligence (TAI)
- Volume
- 3
- Number
- 1
- Start Page
- 29
- End Page
- 42
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/117990
- DOI
- 10.1109/TAI.2021.3103143
- ISSN
- 2691-4581
- Abstract
- The coverage path planning of unmanned aerial vehicles (UAVs) is a complex optimization problem in practice, especially for those involving multiple target areas. It is challenging to comprehensively plan the inter-area visiting order and the intra-area coverage paths simultaneously. Due to the battery limitation, usually the task can hardly be finished by a single UAV, and instead a fleet of UAVs are required. In this article, we first formulate an energy-aware multi-UAV multi-area coverage path planning (EM2CPP) model, in order to characterize the practical path planning requirements of UAVs in complex conditions. Subsequently, to accomplish the optimization task, we propose a bipartite cooperative coevolution (BiCC) algorithm that coevolves an inter-area path planning and an intra-area path planning components to obtain good solutions. The basic operators in BiCC, such as the initialization and the reproduction operators, are tailored for the task of EM2CPP. Besides, we also develop a fast heuristic algorithm for EM2CPP, which is able to produce approximate solutions in a short time. Simulations on real-world datasets validate the good performance of the proposed methods. © 2020 IEEE.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.