Next Article in Journal
A Systematic Survey on Fog and IoT Driven Healthcare: Open Challenges and Research Issues
Previous Article in Journal
An Integrated Buck and Half-Bridge High Step-Down Converter
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Electronics
Volume 11
Issue 17
10.3390/electronics11172667
electronics-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The UAV Path Coverage Algorithm Based on the Greedy Strategy and Ant Colony Optimization

by
Yuheng Jia
,
Shengbang Zhou
,
Qian Zeng
*,
Chuanqi Li
*,
Dong Chen
,
Kezhi Zhang
,
Liyuan Liu
and
Ziyao Chen
School of Physics and Electronics, Nanning Normal University, Nanning 530100, China
*
Authors to whom correspondence should be addressed.
Electronics 2022, 11(17), 2667; https://doi.org/10.3390/electronics11172667
Submission received: 5 August 2022 / Revised: 19 August 2022 / Accepted: 23 August 2022 / Published: 25 August 2022
Browse Figures
Versions Notes

Abstract

Today, the development of unmanned aerial vehicles (UAVs) has attracted significant attention in both civil and military fields due to their flight flexibility in complex and dangerous environments. However, due to energy constraints, UAVs can only finish a few tasks in a limited time. The problem of finding the best flight path while balancing the task completion time and the coverage rate needs to be resolved urgently. Therefore, this paper proposes a UAV path coverage algorithm base on the greedy strategy and ant colony optimization. Firstly, this paper introduces a secondary advantage judgment and optimizes it using an ant colony optimization algorithm to reach the goal of minimum time and maximum coverage. Simulations are performed for different numbers of mission points and UAVs, respectively. The results illustrate that the proposed algorithm achieves a 2.8% reduction in task completion time while achieving a 4.4% improvement in coverage rate compared to several previous works.
Keywords: UAVs; path planning; path coverage; secondary advantage; minimum time and maximum coverage (MTMC) UAVs; path planning; path coverage; secondary advantage; minimum time and maximum coverage (MTMC)

Share and Cite

MDPI and ACS Style

Jia, Y.; Zhou, S.; Zeng, Q.; Li, C.; Chen, D.; Zhang, K.; Liu, L.; Chen, Z. The UAV Path Coverage Algorithm Based on the Greedy Strategy and Ant Colony Optimization. Electronics 2022, 11, 2667. https://doi.org/10.3390/electronics11172667

AMA Style

Jia Y, Zhou S, Zeng Q, Li C, Chen D, Zhang K, Liu L, Chen Z. The UAV Path Coverage Algorithm Based on the Greedy Strategy and Ant Colony Optimization. Electronics. 2022; 11(17):2667. https://doi.org/10.3390/electronics11172667

Chicago/Turabian Style

Jia, Yuheng, Shengbang Zhou, Qian Zeng, Chuanqi Li, Dong Chen, Kezhi Zhang, Liyuan Liu, and Ziyao Chen. 2022. "The UAV Path Coverage Algorithm Based on the Greedy Strategy and Ant Colony Optimization" Electronics 11, no. 17: 2667. https://doi.org/10.3390/electronics11172667

APA Style

Jia, Y., Zhou, S., Zeng, Q., Li, C., Chen, D., Zhang, K., Liu, L., & Chen, Z. (2022). The UAV Path Coverage Algorithm Based on the Greedy Strategy and Ant Colony Optimization. Electronics, 11(17), 2667. https://doi.org/10.3390/electronics11172667

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop