A Multi-Objective Coverage Path Planning Algorithm for UAVs to Cover Spatially Distributed Regions in Urban Environments
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Majeed, Abdul | - |
dc.contributor.author | Hwang, Seong Oun | - |
dc.date.accessioned | 2021-12-06T01:40:44Z | - |
dc.date.available | 2021-12-06T01:40:44Z | - |
dc.date.created | 2021-11-30 | - |
dc.date.issued | 2021-11 | - |
dc.identifier.issn | 2226-4310 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/82852 | - |
dc.description.abstract | This paper presents a multi-objective coverage flight path planning algorithm that finds minimum length, collision-free, and flyable paths for unmanned aerial vehicles (UAV) in three-dimensional (3D) urban environments inhabiting multiple obstacles for covering spatially distributed regions. In many practical applications, UAVs are often required to fully cover multiple spatially distributed regions located in the 3D urban environments while avoiding obstacles. This problem is relatively complex since it requires the optimization of both inter (e.g., traveling from one region/city to another) and intra-regional (e.g., within a region/city) paths. To solve this complex problem, we find the traversal order of each area of interest (AOI) in the form of a coarse tour (i.e., graph) with the help of an ant colony optimization (ACO) algorithm by formulating it as a traveling salesman problem (TSP) from the center of each AOI, which is subsequently optimized. The intra-regional path finding problem is solved with the integration of fitting sensors’ footprints sweeps (SFS) and sparse waypoint graphs (SWG) in the AOI. To find a path that covers all accessible points of an AOI, we fit fewer, longest, and smooth SFSs in such a way that most parts of an AOI can be covered with fewer sweeps. Furthermore, the low-cost traversal order of each SFS is computed, and SWG is constructed by connecting the SFSs while respecting the global and local constraints. It finds a global solution (i.e., inter + intra-regional path) without sacrificing the guarantees on computing time, number of turning maneuvers, perfect coverage, path overlapping, and path length. The results obtained from various representative scenarios show that proposed algorithm is able to compute low-cost coverage paths for UAV navigation in urban environments. © 2021 by the authors. Licensee MDPI, Basel, Switzerland. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | MDPI | - |
dc.relation.isPartOf | Aerospace | - |
dc.title | A Multi-Objective Coverage Path Planning Algorithm for UAVs to Cover Spatially Distributed Regions in Urban Environments | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000724365400001 | - |
dc.identifier.doi | 10.3390/aerospace8110343 | - |
dc.identifier.bibliographicCitation | Aerospace, v.8, no.11 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.scopusid | 2-s2.0-85119662282 | - |
dc.citation.title | Aerospace | - |
dc.citation.volume | 8 | - |
dc.citation.number | 11 | - |
dc.contributor.affiliatedAuthor | Majeed, Abdul | - |
dc.contributor.affiliatedAuthor | Hwang, Seong Oun | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Area of interest | - |
dc.subject.keywordAuthor | Coverage path planning | - |
dc.subject.keywordAuthor | Obstacles | - |
dc.subject.keywordAuthor | Sparse waypoint graphs | - |
dc.subject.keywordAuthor | Spatially distributed regions | - |
dc.subject.keywordAuthor | Traveling salesman problem | - |
dc.subject.keywordAuthor | Unmanned aerial vehicle | - |
dc.subject.keywordAuthor | Urban environments | - |
dc.subject.keywordPlus | UNMANNED AERIAL VEHICLES | - |
dc.subject.keywordPlus | SYSTEM OPTIMIZATION | - |
dc.subject.keywordPlus | SURVEILLANCE | - |
dc.subject.keywordPlus | ARCHITECTURE | - |
dc.subject.keywordPlus | OPERATIONS | - |
dc.subject.keywordPlus | COLONY | - |
dc.subject.keywordPlus | MODEL | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Engineering, Aerospace | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
1342, Seongnam-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, Republic of Korea(13120)031-750-5114
COPYRIGHT 2020 Gachon University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.