优化无人机调度和轨迹规划:一个在线拍卖框架

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Kaiwei Mo , Xianglong Li , Zongpeng Li , Hong Xu
{"title":"优化无人机调度和轨迹规划:一个在线拍卖框架","authors":"Kaiwei Mo ,&nbsp;Xianglong Li ,&nbsp;Zongpeng Li ,&nbsp;Hong Xu","doi":"10.1016/j.comnet.2025.111528","DOIUrl":null,"url":null,"abstract":"<div><div>Unmanned Aerial Vehicles (UAVs) are envisioned to be a critical form of network service provisioning, when the ground infrastructure is vulnerable to disruptions from conflicts and natural disasters. Existing methodologies often fall short in fully optimizing UAV scheduling and resource allocation, leading to suboptimal service performance. This work aims to enhance social welfare through refining UAV scheduling and trajectory planning processes. To address this complex challenge, we first formulate social welfare maximization into a non-traditional integer linear program, and subsequently transform it into its exponential and dual forms. We propose a bifurcated framework called Online Scheduling and Trajectory (OST) which comprises two algorithms: The <span><math><msub><mrow><mi>A</mi></mrow><mrow><mi>O</mi><mi>S</mi><mi>T</mi></mrow></msub></math></span> algorithm is responsible for managing task bids and allocating UAV resources by taking into account bid values, available resources, and task requirements, prioritizing tasks based on their intrinsic value. The <span><math><msub><mrow><mi>A</mi></mrow><mrow><mi>d</mi><mi>u</mi><mi>a</mi><mi>l</mi></mrow></msub></math></span> algorithm optimizes task selection and UAV trajectory planning by balancing the costs and benefits associated with each task. Theoretical analysis demonstrates that the proposed approach achieves an equilibrium that significantly enhances social welfare by ensuring optimal decisions regarding task allocation and resource distribution. Empirical evaluations corroborate these findings, illustrating notable improvements in network service efficiency and validating the practical applicability of our method in maximizing social welfare.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111528"},"PeriodicalIF":4.4000,"publicationDate":"2025-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimizing UAV scheduling and trajectory planning: An online auction framework\",\"authors\":\"Kaiwei Mo ,&nbsp;Xianglong Li ,&nbsp;Zongpeng Li ,&nbsp;Hong Xu\",\"doi\":\"10.1016/j.comnet.2025.111528\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Unmanned Aerial Vehicles (UAVs) are envisioned to be a critical form of network service provisioning, when the ground infrastructure is vulnerable to disruptions from conflicts and natural disasters. Existing methodologies often fall short in fully optimizing UAV scheduling and resource allocation, leading to suboptimal service performance. This work aims to enhance social welfare through refining UAV scheduling and trajectory planning processes. To address this complex challenge, we first formulate social welfare maximization into a non-traditional integer linear program, and subsequently transform it into its exponential and dual forms. We propose a bifurcated framework called Online Scheduling and Trajectory (OST) which comprises two algorithms: The <span><math><msub><mrow><mi>A</mi></mrow><mrow><mi>O</mi><mi>S</mi><mi>T</mi></mrow></msub></math></span> algorithm is responsible for managing task bids and allocating UAV resources by taking into account bid values, available resources, and task requirements, prioritizing tasks based on their intrinsic value. The <span><math><msub><mrow><mi>A</mi></mrow><mrow><mi>d</mi><mi>u</mi><mi>a</mi><mi>l</mi></mrow></msub></math></span> algorithm optimizes task selection and UAV trajectory planning by balancing the costs and benefits associated with each task. Theoretical analysis demonstrates that the proposed approach achieves an equilibrium that significantly enhances social welfare by ensuring optimal decisions regarding task allocation and resource distribution. Empirical evaluations corroborate these findings, illustrating notable improvements in network service efficiency and validating the practical applicability of our method in maximizing social welfare.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"270 \",\"pages\":\"Article 111528\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2025-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128625004955\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625004955","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

当地面基础设施容易受到冲突和自然灾害的破坏时,无人驾驶飞行器(uav)被设想为网络服务供应的关键形式。现有的方法往往不能充分优化无人机调度和资源分配,导致服务性能次优。本工作旨在通过改进无人机调度和轨迹规划流程来提高社会福利。为了应对这一复杂的挑战,我们首先将社会福利最大化制定为非传统的整数线性规划,随后将其转化为指数和对偶形式。我们提出了一个名为在线调度和轨迹(OST)的分岔框架,该框架由两种算法组成:OST算法负责通过考虑投标值、可用资源和任务需求来管理任务投标和分配无人机资源,并根据其内在价值对任务进行优先级排序。该算法通过平衡与每个任务相关的成本和收益来优化任务选择和无人机轨迹规划。理论分析表明,该方法通过确保任务分配和资源分配的最优决策,实现了显著提高社会福利的均衡。实证分析证实了这些发现,说明了网络服务效率的显著提高,并验证了我们的方法在社会福利最大化方面的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimizing UAV scheduling and trajectory planning: An online auction framework
Unmanned Aerial Vehicles (UAVs) are envisioned to be a critical form of network service provisioning, when the ground infrastructure is vulnerable to disruptions from conflicts and natural disasters. Existing methodologies often fall short in fully optimizing UAV scheduling and resource allocation, leading to suboptimal service performance. This work aims to enhance social welfare through refining UAV scheduling and trajectory planning processes. To address this complex challenge, we first formulate social welfare maximization into a non-traditional integer linear program, and subsequently transform it into its exponential and dual forms. We propose a bifurcated framework called Online Scheduling and Trajectory (OST) which comprises two algorithms: The AOST algorithm is responsible for managing task bids and allocating UAV resources by taking into account bid values, available resources, and task requirements, prioritizing tasks based on their intrinsic value. The Adual algorithm optimizes task selection and UAV trajectory planning by balancing the costs and benefits associated with each task. Theoretical analysis demonstrates that the proposed approach achieves an equilibrium that significantly enhances social welfare by ensuring optimal decisions regarding task allocation and resource distribution. Empirical evaluations corroborate these findings, illustrating notable improvements in network service efficiency and validating the practical applicability of our method in maximizing social welfare.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术官方微信