Rule-Based Multiple Coverage Path Planning Algorithm for Scanning a Region of Interest
This paper considers the multiple path planning problem to cover a region of interest using vertical takeoff and landing (VTOL) drones. Drones are used not only to explore unknown areas but also to view areas from the air that are difficult for people to approach by cars, boats, etc. Hence, the cove...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-05-01
|
| Series: | Drones |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2504-446X/9/5/371 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850258007283204096 |
|---|---|
| author | Nameung Hwang Joonwon Kim Philjoon Jung |
| author_facet | Nameung Hwang Joonwon Kim Philjoon Jung |
| author_sort | Nameung Hwang |
| collection | DOAJ |
| description | This paper considers the multiple path planning problem to cover a region of interest using vertical takeoff and landing (VTOL) drones. Drones are used not only to explore unknown areas but also to view areas from the air that are difficult for people to approach by cars, boats, etc. Hence, the coverage path planning for drones should work regardless of whether the drone is inside or outside the region of interest. The proposed algorithm starts by adjusting the region of interest based on the capturing area. Once the region of interest is determined, multiple path plans are created based on the pre-derived rules for generating an optimal path under the general case and the drone’s performance, such as speed, maximum flight time, etc. The aim is to minimize the time to cover the whole region of interest. Hence, the following criteria are applied to determine the appropriateness of the generated paths: (1) whether the start and end points of the path are located as close as possible to the drone’s position, (2) whether the number of generated paths is appropriate, and (3) whether the makespan differences between the paths are small. The performance of the proposed algorithm is verified by numerous simulations. |
| format | Article |
| id | doaj-art-4ffd41b44f9445b29cbd6b4243c4c05c |
| institution | OA Journals |
| issn | 2504-446X |
| language | English |
| publishDate | 2025-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Drones |
| spelling | doaj-art-4ffd41b44f9445b29cbd6b4243c4c05c2025-08-20T01:56:16ZengMDPI AGDrones2504-446X2025-05-019537110.3390/drones9050371Rule-Based Multiple Coverage Path Planning Algorithm for Scanning a Region of InterestNameung Hwang0Joonwon Kim1Philjoon Jung2Land Combat R&D Center, Hanwha Systems Co., Seongnam-si 13524, Republic of KoreaLand Combat R&D Center, Hanwha Systems Co., Seongnam-si 13524, Republic of KoreaSW Team (Land), Hanwha Systems Co., Seongnam-si 13524, Republic of KoreaThis paper considers the multiple path planning problem to cover a region of interest using vertical takeoff and landing (VTOL) drones. Drones are used not only to explore unknown areas but also to view areas from the air that are difficult for people to approach by cars, boats, etc. Hence, the coverage path planning for drones should work regardless of whether the drone is inside or outside the region of interest. The proposed algorithm starts by adjusting the region of interest based on the capturing area. Once the region of interest is determined, multiple path plans are created based on the pre-derived rules for generating an optimal path under the general case and the drone’s performance, such as speed, maximum flight time, etc. The aim is to minimize the time to cover the whole region of interest. Hence, the following criteria are applied to determine the appropriateness of the generated paths: (1) whether the start and end points of the path are located as close as possible to the drone’s position, (2) whether the number of generated paths is appropriate, and (3) whether the makespan differences between the paths are small. The performance of the proposed algorithm is verified by numerous simulations.https://www.mdpi.com/2504-446X/9/5/371coverage path planningcomplete coveragemultiple pathmixed-integer programmingVTOL drones |
| spellingShingle | Nameung Hwang Joonwon Kim Philjoon Jung Rule-Based Multiple Coverage Path Planning Algorithm for Scanning a Region of Interest Drones coverage path planning complete coverage multiple path mixed-integer programming VTOL drones |
| title | Rule-Based Multiple Coverage Path Planning Algorithm for Scanning a Region of Interest |
| title_full | Rule-Based Multiple Coverage Path Planning Algorithm for Scanning a Region of Interest |
| title_fullStr | Rule-Based Multiple Coverage Path Planning Algorithm for Scanning a Region of Interest |
| title_full_unstemmed | Rule-Based Multiple Coverage Path Planning Algorithm for Scanning a Region of Interest |
| title_short | Rule-Based Multiple Coverage Path Planning Algorithm for Scanning a Region of Interest |
| title_sort | rule based multiple coverage path planning algorithm for scanning a region of interest |
| topic | coverage path planning complete coverage multiple path mixed-integer programming VTOL drones |
| url | https://www.mdpi.com/2504-446X/9/5/371 |
| work_keys_str_mv | AT nameunghwang rulebasedmultiplecoveragepathplanningalgorithmforscanningaregionofinterest AT joonwonkim rulebasedmultiplecoveragepathplanningalgorithmforscanningaregionofinterest AT philjoonjung rulebasedmultiplecoveragepathplanningalgorithmforscanningaregionofinterest |