时间敏感数据采集任务中最小化机队规模的无人机能量优化路径规划

IF 8.9 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yang Yu;Sanghwan Lee
{"title":"时间敏感数据采集任务中最小化机队规模的无人机能量优化路径规划","authors":"Yang Yu;Sanghwan Lee","doi":"10.1109/JIOT.2025.3578613","DOIUrl":null,"url":null,"abstract":"In this article, we investigate the problem of completing data collection tasks for Internet of Things devices (IoTDs) using uncrewed aerial vehicles (UAVs) under the constraints of UAV’s battery capacity and predefined data age. Our objective was to minimize UAV’s flight energy consumption by optimizing their trajectory allocation and achieve the research goal with the minimum number of UAVs. We transformed the multiobjective optimization problem (MOP) into a traveling salesman problem with neighborhoods (TSPN) by considering UAVs’ ability to collect data within the communication range of IoT devices. We studied two modes of data collection for UAVs: one in which they can only collect data during hovering and another in which they can collect data while hovering and moving simultaneously. We proposed two algorithms: 1) UAV hovering data collection algorithm with neighborhood (UHDCN) and 2) UAV moving data collection algorithm with neighborhood (UMDCN). We evaluate the performance of the proposed algorithms through extensive simulation experiments. The results demonstrate that UHDCN algorithm requires at least 4.8% fewer number of UAVs compared to existing algorithms, while UMDCN algorithm requires at least 22.2% fewer number of UAVs. Additionally, UHDCN algorithm consumes at least 4.9% less total energy compared to existing algorithms, while UMDCN algorithm consumes at least 22.8% less energy.","PeriodicalId":54347,"journal":{"name":"IEEE Internet of Things Journal","volume":"12 17","pages":"35294-35306"},"PeriodicalIF":8.9000,"publicationDate":"2025-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Energy-Optimized Path Planning for UAVs to Minimize Fleet Size in Time-Sensitive Data Collection Tasks\",\"authors\":\"Yang Yu;Sanghwan Lee\",\"doi\":\"10.1109/JIOT.2025.3578613\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, we investigate the problem of completing data collection tasks for Internet of Things devices (IoTDs) using uncrewed aerial vehicles (UAVs) under the constraints of UAV’s battery capacity and predefined data age. Our objective was to minimize UAV’s flight energy consumption by optimizing their trajectory allocation and achieve the research goal with the minimum number of UAVs. We transformed the multiobjective optimization problem (MOP) into a traveling salesman problem with neighborhoods (TSPN) by considering UAVs’ ability to collect data within the communication range of IoT devices. We studied two modes of data collection for UAVs: one in which they can only collect data during hovering and another in which they can collect data while hovering and moving simultaneously. We proposed two algorithms: 1) UAV hovering data collection algorithm with neighborhood (UHDCN) and 2) UAV moving data collection algorithm with neighborhood (UMDCN). We evaluate the performance of the proposed algorithms through extensive simulation experiments. The results demonstrate that UHDCN algorithm requires at least 4.8% fewer number of UAVs compared to existing algorithms, while UMDCN algorithm requires at least 22.2% fewer number of UAVs. Additionally, UHDCN algorithm consumes at least 4.9% less total energy compared to existing algorithms, while UMDCN algorithm consumes at least 22.8% less energy.\",\"PeriodicalId\":54347,\"journal\":{\"name\":\"IEEE Internet of Things Journal\",\"volume\":\"12 17\",\"pages\":\"35294-35306\"},\"PeriodicalIF\":8.9000,\"publicationDate\":\"2025-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Internet of Things Journal\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11039505/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Internet of Things Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11039505/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们研究了在无人机电池容量和预定义数据年龄的约束下,使用无人机完成物联网设备(iotd)数据收集任务的问题。我们的目标是通过优化无人机的轨迹分配,使无人机的飞行能量消耗最小化,以最少的无人机数量实现研究目标。通过考虑无人机在物联网设备通信范围内收集数据的能力,将多目标优化问题(MOP)转化为带邻域的旅行推销员问题(TSPN)。我们研究了无人机的两种数据采集模式:一种是无人机在悬停时只能采集数据,另一种是无人机在悬停和移动时同时采集数据。提出了两种算法:1)带邻域的无人机悬停数据采集算法(UHDCN)和2)带邻域的无人机移动数据采集算法(UMDCN)。我们通过大量的仿真实验来评估所提出算法的性能。结果表明,与现有算法相比,UHDCN算法所需无人机数量至少减少4.8%,而UMDCN算法所需无人机数量至少减少22.2%。此外,与现有算法相比,UHDCN算法的总能耗至少降低4.9%,而UMDCN算法的总能耗至少降低22.8%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Energy-Optimized Path Planning for UAVs to Minimize Fleet Size in Time-Sensitive Data Collection Tasks
In this article, we investigate the problem of completing data collection tasks for Internet of Things devices (IoTDs) using uncrewed aerial vehicles (UAVs) under the constraints of UAV’s battery capacity and predefined data age. Our objective was to minimize UAV’s flight energy consumption by optimizing their trajectory allocation and achieve the research goal with the minimum number of UAVs. We transformed the multiobjective optimization problem (MOP) into a traveling salesman problem with neighborhoods (TSPN) by considering UAVs’ ability to collect data within the communication range of IoT devices. We studied two modes of data collection for UAVs: one in which they can only collect data during hovering and another in which they can collect data while hovering and moving simultaneously. We proposed two algorithms: 1) UAV hovering data collection algorithm with neighborhood (UHDCN) and 2) UAV moving data collection algorithm with neighborhood (UMDCN). We evaluate the performance of the proposed algorithms through extensive simulation experiments. The results demonstrate that UHDCN algorithm requires at least 4.8% fewer number of UAVs compared to existing algorithms, while UMDCN algorithm requires at least 22.2% fewer number of UAVs. Additionally, UHDCN algorithm consumes at least 4.9% less total energy compared to existing algorithms, while UMDCN algorithm consumes at least 22.8% less energy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Internet of Things Journal
IEEE Internet of Things Journal Computer Science-Information Systems
CiteScore
17.60
自引率
13.20%
发文量
1982
期刊介绍: The EEE Internet of Things (IoT) Journal publishes articles and review articles covering various aspects of IoT, including IoT system architecture, IoT enabling technologies, IoT communication and networking protocols such as network coding, and IoT services and applications. Topics encompass IoT's impacts on sensor technologies, big data management, and future internet design for applications like smart cities and smart homes. Fields of interest include IoT architecture such as things-centric, data-centric, service-oriented IoT architecture; IoT enabling technologies and systematic integration such as sensor technologies, big sensor data management, and future Internet design for IoT; IoT services, applications, and test-beds such as IoT service middleware, IoT application programming interface (API), IoT application design, and IoT trials/experiments; IoT standardization activities and technology development in different standard development organizations (SDO) such as IEEE, IETF, ITU, 3GPP, ETSI, etc.
×
引用
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学术官方微信