具有通信质量、电池能量和时间窗口约束的低空货运无人机拾取系统

IF 8.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
IEEE Transactions on Mobile Computing Pub Date : 2026-06-01 Epub Date: 2025-12-23 DOI:10.1109/TMC.2025.3647000
Mingjian Chen;Liang Yang;Jiangling Cao;Guangxu Zhu;Weijie Yuan;Hongbo Jiang;Dusit Niyato
{"title":"具有通信质量、电池能量和时间窗口约束的低空货运无人机拾取系统","authors":"Mingjian Chen;Liang Yang;Jiangling Cao;Guangxu Zhu;Weijie Yuan;Hongbo Jiang;Dusit Niyato","doi":"10.1109/TMC.2025.3647000","DOIUrl":null,"url":null,"abstract":"The rapid development of the low-altitude economy (LAE) has accelerated the deployment of cargo unmanned aerial vehicles (UAVs) for intelligent logistics and delivery services. However, large-scale UAV operations still face multiple practical challenges, including unstable communication connectivity, limited onboard battery energy, and strict customer time-window constraints. To address these issues, this paper investigates the trajectory and task scheduling optimization problem for multi-UAV cooperative cargo pick-up under joint communication, energy, and time-window constraints. We develop a collision-aware cooperative multi-UAV optimization algorithm (CACMO) that integrates a Dueling Deep Q-Network (D3QN) for communication-aware trajectory learning with a simulated annealing (SA) based global task-sequence planner and an explicit inter-UAV conflict-resolution mechanism. The D3QN module enables adaptive trajectory generation in unknown and time-varying radio environments without requiring an a priori radio map, maintaining stable connectivity while reducing flight cost, whereas the SA module determines efficient task orders and enforces safe coordination among multiple UAVs through collision-aware refinement. Simulation results demonstrate that the proposed CACMO algorithm framework achieves an optimal balance between task completion time (1,719 seconds) and user satisfaction (score of 0.9969) under typical operating conditions, delivering a 70–75% reduction in total weighted cost compared to representative baseline methods. Crucially, this substantial improvement is achieved while explicitly enforcing multi-UAV collision avoidance—a critical constraint absent in most baseline methods. The framework maintains zero communication outage and guarantees safe inter-UAV separation throughout the mission while satisfying all energy and time window constraints in realistic urban environments, confirming its robustness and scalability for cooperative multi-UAV logistics operations within the LAE.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"25 6","pages":"8111-8128"},"PeriodicalIF":8.8000,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cargo UAVs Pick-Up Systems for Low-Altitude Economy With Communication Quality, Battery Energy, and Time Window Constraints\",\"authors\":\"Mingjian Chen;Liang Yang;Jiangling Cao;Guangxu Zhu;Weijie Yuan;Hongbo Jiang;Dusit Niyato\",\"doi\":\"10.1109/TMC.2025.3647000\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rapid development of the low-altitude economy (LAE) has accelerated the deployment of cargo unmanned aerial vehicles (UAVs) for intelligent logistics and delivery services. However, large-scale UAV operations still face multiple practical challenges, including unstable communication connectivity, limited onboard battery energy, and strict customer time-window constraints. To address these issues, this paper investigates the trajectory and task scheduling optimization problem for multi-UAV cooperative cargo pick-up under joint communication, energy, and time-window constraints. We develop a collision-aware cooperative multi-UAV optimization algorithm (CACMO) that integrates a Dueling Deep Q-Network (D3QN) for communication-aware trajectory learning with a simulated annealing (SA) based global task-sequence planner and an explicit inter-UAV conflict-resolution mechanism. The D3QN module enables adaptive trajectory generation in unknown and time-varying radio environments without requiring an a priori radio map, maintaining stable connectivity while reducing flight cost, whereas the SA module determines efficient task orders and enforces safe coordination among multiple UAVs through collision-aware refinement. Simulation results demonstrate that the proposed CACMO algorithm framework achieves an optimal balance between task completion time (1,719 seconds) and user satisfaction (score of 0.9969) under typical operating conditions, delivering a 70–75% reduction in total weighted cost compared to representative baseline methods. Crucially, this substantial improvement is achieved while explicitly enforcing multi-UAV collision avoidance—a critical constraint absent in most baseline methods. The framework maintains zero communication outage and guarantees safe inter-UAV separation throughout the mission while satisfying all energy and time window constraints in realistic urban environments, confirming its robustness and scalability for cooperative multi-UAV logistics operations within the LAE.\",\"PeriodicalId\":50389,\"journal\":{\"name\":\"IEEE Transactions on Mobile Computing\",\"volume\":\"25 6\",\"pages\":\"8111-8128\"},\"PeriodicalIF\":8.8000,\"publicationDate\":\"2026-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Mobile Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11313542/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/12/23 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11313542/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/12/23 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

低空经济(LAE)的快速发展加速了货运无人机(uav)在智能物流和配送服务中的部署。然而,大规模无人机操作仍然面临多种实际挑战,包括不稳定的通信连接、有限的机载电池能量和严格的客户时间窗口约束。针对这些问题,研究了联合通信、能量和时间窗约束下多无人机协同提货的轨迹和任务调度优化问题。我们开发了一种碰撞感知协同多无人机优化算法(CACMO),该算法集成了用于通信感知轨迹学习的Dueling Deep Q-Network (D3QN)、基于模拟退火(SA)的全局任务序列规划器和明确的无人机间冲突解决机制。D3QN模块能够在未知和时变的无线电环境中自适应轨迹生成,而不需要先验的无线电地图,在降低飞行成本的同时保持稳定的连接,而SA模块确定有效的任务订单,并通过碰撞感知改进加强多架无人机之间的安全协调。仿真结果表明,在典型运行条件下,所提出的CACMO算法框架在任务完成时间(1719秒)和用户满意度(0.9969分)之间实现了最优平衡,与代表性基线方法相比,总加权成本降低了70-75%。至关重要的是,这种实质性的改进是在明确强制多无人机避免碰撞的情况下实现的——这是大多数基线方法中缺乏的关键约束。该框架在整个任务过程中保持零通信中断,并保证无人机间的安全分离,同时满足现实城市环境中的所有能量和时间窗口约束,确认了其在LAE内协作多无人机物流操作的鲁棒性和可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cargo UAVs Pick-Up Systems for Low-Altitude Economy With Communication Quality, Battery Energy, and Time Window Constraints
The rapid development of the low-altitude economy (LAE) has accelerated the deployment of cargo unmanned aerial vehicles (UAVs) for intelligent logistics and delivery services. However, large-scale UAV operations still face multiple practical challenges, including unstable communication connectivity, limited onboard battery energy, and strict customer time-window constraints. To address these issues, this paper investigates the trajectory and task scheduling optimization problem for multi-UAV cooperative cargo pick-up under joint communication, energy, and time-window constraints. We develop a collision-aware cooperative multi-UAV optimization algorithm (CACMO) that integrates a Dueling Deep Q-Network (D3QN) for communication-aware trajectory learning with a simulated annealing (SA) based global task-sequence planner and an explicit inter-UAV conflict-resolution mechanism. The D3QN module enables adaptive trajectory generation in unknown and time-varying radio environments without requiring an a priori radio map, maintaining stable connectivity while reducing flight cost, whereas the SA module determines efficient task orders and enforces safe coordination among multiple UAVs through collision-aware refinement. Simulation results demonstrate that the proposed CACMO algorithm framework achieves an optimal balance between task completion time (1,719 seconds) and user satisfaction (score of 0.9969) under typical operating conditions, delivering a 70–75% reduction in total weighted cost compared to representative baseline methods. Crucially, this substantial improvement is achieved while explicitly enforcing multi-UAV collision avoidance—a critical constraint absent in most baseline methods. The framework maintains zero communication outage and guarantees safe inter-UAV separation throughout the mission while satisfying all energy and time window constraints in realistic urban environments, confirming its robustness and scalability for cooperative multi-UAV logistics operations within the LAE.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书