An integrated framework for UAV-based precision plant protection in complex terrain: the ACHAGA solution for multi-tea fields

UAV-based plant protection represents an efficient, energy-saving agricultural technology with significant potential to enhance tea production. However, the complex terrain of hilly and mountainous tea fields, coupled with the limited endurance of UAVs, presents substantial challenges for efficient route planning. This study introduces a novel methodological framework for UAV-based precision plant protection across multiple tea fields, addressing the difficulties in planning the shortest routes and optimal flights for UAVs constrained by their endurance. The framework employs a hyperbolic genetic annealing algorithm (ACHAGA) to optimize UAV plant protection routes with the objectives of minimizing flight distance, reducing the number of turns, and enhancing route stability. The method involves two primary steps: cluster partitioning and sortie allocation for multiple tea fields based on UAV range capabilities, followed by refining the UAV's flight path using a combination of hyperbolic genetic and simulated annealing algorithms with an adaptive temperature control mechanism. Simulation experiments and UAV route validation tests confirm the effectiveness of ACHAGA. The algorithm consistently identified optimal solutions within an average of 40 iterations, demonstrating robust global search capabilities and stability. It achieved an average reduction of 45.75 iterations and 1811.93 meters in the optimal route, with lower variation coefficients and extreme deviations across repeated simulations. ACHAGA significantly outperforms these algorithms, GA, GA-ACO, AFSA and BSO, which are also heuristic search strategies, in the multi-tea field route scheduling problem, reducing the optimal routes by 4904.82 m, 926.07 m, 3803.96 m and 800.11 m, respectively. Field tests revealed that ACHAGA reduced actual flight routes by 791.9 meters and 359.6 meters compared to manual and brainstorming-based planning methods, respectively. Additionally, the algorithm reduced flight scheduling distance and the number of turns by 11 compared to manual planning. This study provides a theoretical and technical foundation for managing large-scale tea plantations in challenging landscapes and serves as a reference for UAV precision operation planning in complex environments.

Authors

Institutions

Publication Details

Journal
Frontiers in Plant Science
Published
2024-09-26
DOI
https://doi.org/10.3389/fpls.2024.1440234
Citations
2
Primary Topic
UAV Applications and Optimization
Type
article
Field-Weighted Citation Impact
2.60
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An integrated framework for UAV-based precision plant protection in complex terrain: the ACHAGA solution for multi-tea fields

Pengyang Zhang, Yangyang Liu, Hongbin Du
2 citations
Frontiers in Plant Science
UAV Applications and Optimization
2.60
article

An integrated framework for UAV-based precision plant protection in complex terrain: the ACHAGA solution for multi-tea fields

Pengyang Zhang, Yangyang Liu, Hongbin Du
article en
2 citations

Abstract

UAV-based plant protection represents an efficient, energy-saving agricultural technology with significant potential to enhance tea production. However, the complex terrain of hilly and mountainous tea fields, coupled with the limited endurance of UAVs, presents substantial challenges for efficient route planning. This study introduces a novel methodological framework for UAV-based precision plant protection across multiple tea fields, addressing the difficulties in planning the shortest routes and optimal flights for UAVs constrained by their endurance. The framework employs a hyperbolic genetic annealing algorithm (ACHAGA) to optimize UAV plant protection routes with the objectives of minimizing flight distance, reducing the number of turns, and enhancing route stability. The method involves two primary steps: cluster partitioning and sortie allocation for multiple tea fields based on UAV range capabilities, followed by refining the UAV's flight path using a combination of hyperbolic genetic and simulated annealing algorithms with an adaptive temperature control mechanism. Simulation experiments and UAV route validation tests confirm the effectiveness of ACHAGA. The algorithm consistently identified optimal solutions within an average of 40 iterations, demonstrating robust global search capabilities and stability. It achieved an average reduction of 45.75 iterations and 1811.93 meters in the optimal route, with lower variation coefficients and extreme deviations across repeated simulations. ACHAGA significantly outperforms these algorithms, GA, GA-ACO, AFSA and BSO, which are also heuristic search strategies, in the multi-tea field route scheduling problem, reducing the optimal routes by 4904.82 m, 926.07 m, 3803.96 m and 800.11 m, respectively. Field tests revealed that ACHAGA reduced actual flight routes by 791.9 meters and 359.6 meters compared to manual and brainstorming-based planning methods, respectively. Additionally, the algorithm reduced flight scheduling distance and the number of turns by 11 compared to manual planning. This study provides a theoretical and technical foundation for managing large-scale tea plantations in challenging landscapes and serves as a reference for UAV precision operation planning in complex environments.

Frontiers in Plant ScienceVol. 15
Anhui Agricultural University (CN), Xinjiang Production and Construction Corps (CN), Tarim University (CN)
Openalex Percentile: Top 8%
UAV Applications and Optimization
2.60
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.