A Reinforcement Learning Method for UAV Delivery Scheduling Under Dynamic Pricing

The on-demand delivery service of Unmanned Aerial Vehicles (UAVs) has attracted attention and research worldwide. Under the on-demand delivery model, the UAV transports parcels between ports (e.g., a designated location for UAV to drop off/pick up parcels), to satisfy the rapid response to urgent demand. Due to the complexity of large-scale routing problems and response time limitation, the general heuristic algorithms may obtain locally optimal scheduling solutions, thus reducing the delivery utility. Therefore, we propose a UAV route scheduling scheme based on a two-step hybrid heuristic algorithm. In particular, the biogeography-based optimization algorithm is applied to obtain the optimal set of UAV tasks at the first step. At the second step, the approximate dynamic programming is proposed to schedule task routes, to obtain the global optimal solution. Besides, the price function based on delivery status and demand characteristics is trained through the advantage actor critic algorithm to determine the optimal delivery price, so that the flexibility of UAV scheduling is increased. Based on simulation experiments, our scheme outperforms other solutions on increasing delivery utility, and can provide the optimal delivery price based on customer characteristics.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Cognitive Communications and Networking
Published
2025-11-06
DOI
https://doi.org/10.1109/tccn.2025.3630060
Primary Topic
UAV Applications and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Reinforcement Learning Method for UAV Delivery Scheduling Under Dynamic Pricing

Yue Cao, Kai Jiang, Lixia Xiao, Minho Jo et al.
IEEE Transactions on Cognitive Communications and Networking
UAV Applications and Optimization
article

A Reinforcement Learning Method for UAV Delivery Scheduling Under Dynamic Pricing

Yue Cao, Kai Jiang, Lixia Xiao, Minho Jo, Xingyu Zhao, Ziyi Hu
article en

Abstract

The on-demand delivery service of Unmanned Aerial Vehicles (UAVs) has attracted attention and research worldwide. Under the on-demand delivery model, the UAV transports parcels between ports (e.g., a designated location for UAV to drop off/pick up parcels), to satisfy the rapid response to urgent demand. Due to the complexity of large-scale routing problems and response time limitation, the general heuristic algorithms may obtain locally optimal scheduling solutions, thus reducing the delivery utility. Therefore, we propose a UAV route scheduling scheme based on a two-step hybrid heuristic algorithm. In particular, the biogeography-based optimization algorithm is applied to obtain the optimal set of UAV tasks at the first step. At the second step, the approximate dynamic programming is proposed to schedule task routes, to obtain the global optimal solution. Besides, the price function based on delivery status and demand characteristics is trained through the advantage actor critic algorithm to determine the optimal delivery price, so that the flexibility of UAV scheduling is increased. Based on simulation experiments, our scheme outperforms other solutions on increasing delivery utility, and can provide the optimal delivery price based on customer characteristics.

IEEE Transactions on Cognitive Communications and NetworkingVol. 12
Korea University (KR), Wuhan University (CN), University of Warwick (GB), Huazhong University of Science and Technology (CN)
Openalex Percentile: Top 56%
UAV Applications and Optimization
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.