Asymmetric Dual-Resource Replenishment Scheduling for Plant Protection UAVs on Fixed Routes: An Event-Graph Dynamic Programming Approach

We formulate fixed-route replenishment scheduling for plant protection unmanned aerial vehicles (UAVs), jointly selecting replenishment timing, operation type, and station to minimize additional replenishment time. Resource resets invalidate the monotone-depletion premise of standard resource-constrained shortest-path methods; the two resources deplete asymmetrically (endurance throughout, pesticide only when spraying), and because joint or serial replenishments share a detour while the pesticide-type consistency constraint forces refills at type switches, the battery- and pesticide-side decisions cannot be separated. We develop event-graph dynamic programming (EGDP), which discretizes replenishment timings into event points and encodes the five replenishment types as arcs, reducing the joint decision to a shortest path solved by label-setting search with dominance and redundancy pruning. On 20 instances with four fields, EGDP’s total working times matched those of a same-grid mixed-integer linear programming (MILP) model within 10−6 min in 19 cases; in the remaining case, the MILP failed to prove optimality and was 0.07% worse, while EGDP was about 3069 times faster. Across 100 instances spanning five scales, EGDP reduced additional replenishment time by 10.9% relative to a greedy baseline; on 20 instances with six fields, the 0.5 min grid produced a mean deviation of 0.72% from the finest 0.05 min grid, with a runtime of 0.66 s, supporting pre-flight planning.

Authors

Institutions

Publication Details

Journal
Symmetry
Published
2026-11-12
DOI
https://doi.org/10.3390/sym18111896
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Asymmetric Dual-Resource Replenishment Scheduling for Plant Protection UAVs on Fixed Routes: An Event-Graph Dynamic Programming Approach

Yu Cheng Wu, Mengji Shi, Zhiqiang Li, Shuting Xu et al.
Symmetry
Vehicle Routing Optimization Methods
article

Asymmetric Dual-Resource Replenishment Scheduling for Plant Protection UAVs on Fixed Routes: An Event-Graph Dynamic Programming Approach

Yu Cheng Wu, Mengji Shi, Zhiqiang Li, Shuting Xu, Henghui Liu
article en

Abstract

We formulate fixed-route replenishment scheduling for plant protection unmanned aerial vehicles (UAVs), jointly selecting replenishment timing, operation type, and station to minimize additional replenishment time. Resource resets invalidate the monotone-depletion premise of standard resource-constrained shortest-path methods; the two resources deplete asymmetrically (endurance throughout, pesticide only when spraying), and because joint or serial replenishments share a detour while the pesticide-type consistency constraint forces refills at type switches, the battery- and pesticide-side decisions cannot be separated. We develop event-graph dynamic programming (EGDP), which discretizes replenishment timings into event points and encodes the five replenishment types as arcs, reducing the joint decision to a shortest path solved by label-setting search with dominance and redundancy pruning. On 20 instances with four fields, EGDP’s total working times matched those of a same-grid mixed-integer linear programming (MILP) model within 10−6 min in 19 cases; in the remaining case, the MILP failed to prove optimality and was 0.07% worse, while EGDP was about 3069 times faster. Across 100 instances spanning five scales, EGDP reduced additional replenishment time by 10.9% relative to a greedy baseline; on 20 instances with six fields, the 0.5 min grid produced a mean deviation of 0.72% from the finest 0.05 min grid, with a runtime of 0.66 s, supporting pre-flight planning.

SymmetryVol. 18(11)
University of Electronic Science and Technology of China (CN), Beijing Forestry University (CN)
National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities
Vehicle Routing Optimization Methods
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.

Laika access coming soon