时变天气网络下的无人机群分布路线优化

IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Wanchen Jie, Cheng Pei, Hong Yan, Weitong Lin
{"title":"时变天气网络下的无人机群分布路线优化","authors":"Wanchen Jie,&nbsp;Cheng Pei,&nbsp;Hong Yan,&nbsp;Weitong Lin","doi":"10.1155/int/8682162","DOIUrl":null,"url":null,"abstract":"<div>\n <p>The rapid advancement in unmanned aerial vehicle (UAV) technology has marked a transformative shift in various industries, with logistics distribution service being one of the prime sectors reaping the benefits. UAVs offer substantial benefits in speed, cost, and reach, promising to revolutionize logistics, especially in remote areas. On the one hand, they are poised to meet demands for quick and versatile delivery options. On the other hand, their deployment comes with challenges. Weather variabilities such as rainfall, wind speed, and the need for safe take-off intervals can compromise UAV safety and operation. Conventional route optimization often overlooks these dynamic factors, resulting in inefficient or unworkable delivery routes. The repeated time-consuming calculations are caused by repeated trials when making UAV group distribution plans. Recognizing these gaps, this study proposes a data representation to effectively transform the flight flyable area of UAVs into a time-varying network that maintains spatiotemporal connectivity and establishes a mathematical model that represents the complexities of UAV group distribution. Then, a multistage dynamic optimization algorithm specifically tailored for large-scale time-varying network distribution route search is designed to obtain the stable and optimal solution. Subsequent experimental validations on actual case datasets have confirmed the correctness, effectiveness, and adaptability of the algorithm. Benchmarking against traditional CPLEX methods demonstrated that the algorithm not only rivals the best solutions but does so with a 38.8 times increase in computational speed. When pitted against the shortest path Dijkstra and <i>A</i><sup>∗</sup> algorithms, the method consistently outperformed, delivering solutions up to 3.5 times faster in large-scale applications. Moreover, the parameter sensitivity analysis is performed on the algorithm by adjusting the safe flight thresholds of rainfall and wind speed parameters and revealed that the performance of the algorithm has a strong positive correlation with the size of the time-varying network.</p>\n </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":5.0000,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/8682162","citationCount":"0","resultStr":"{\"title\":\"UAV Group Distribution Route Optimization Under Time-Varying Weather Network\",\"authors\":\"Wanchen Jie,&nbsp;Cheng Pei,&nbsp;Hong Yan,&nbsp;Weitong Lin\",\"doi\":\"10.1155/int/8682162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n <p>The rapid advancement in unmanned aerial vehicle (UAV) technology has marked a transformative shift in various industries, with logistics distribution service being one of the prime sectors reaping the benefits. UAVs offer substantial benefits in speed, cost, and reach, promising to revolutionize logistics, especially in remote areas. On the one hand, they are poised to meet demands for quick and versatile delivery options. On the other hand, their deployment comes with challenges. Weather variabilities such as rainfall, wind speed, and the need for safe take-off intervals can compromise UAV safety and operation. Conventional route optimization often overlooks these dynamic factors, resulting in inefficient or unworkable delivery routes. The repeated time-consuming calculations are caused by repeated trials when making UAV group distribution plans. Recognizing these gaps, this study proposes a data representation to effectively transform the flight flyable area of UAVs into a time-varying network that maintains spatiotemporal connectivity and establishes a mathematical model that represents the complexities of UAV group distribution. Then, a multistage dynamic optimization algorithm specifically tailored for large-scale time-varying network distribution route search is designed to obtain the stable and optimal solution. Subsequent experimental validations on actual case datasets have confirmed the correctness, effectiveness, and adaptability of the algorithm. Benchmarking against traditional CPLEX methods demonstrated that the algorithm not only rivals the best solutions but does so with a 38.8 times increase in computational speed. When pitted against the shortest path Dijkstra and <i>A</i><sup>∗</sup> algorithms, the method consistently outperformed, delivering solutions up to 3.5 times faster in large-scale applications. Moreover, the parameter sensitivity analysis is performed on the algorithm by adjusting the safe flight thresholds of rainfall and wind speed parameters and revealed that the performance of the algorithm has a strong positive correlation with the size of the time-varying network.</p>\\n </div>\",\"PeriodicalId\":14089,\"journal\":{\"name\":\"International Journal of Intelligent Systems\",\"volume\":\"2025 1\",\"pages\":\"\"},\"PeriodicalIF\":5.0000,\"publicationDate\":\"2025-02-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/8682162\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Intelligent Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1155/int/8682162\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/int/8682162","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

本文章由计算机程序翻译,如有差异,请以英文原文为准。

UAV Group Distribution Route Optimization Under Time-Varying Weather Network

UAV Group Distribution Route Optimization Under Time-Varying Weather Network

The rapid advancement in unmanned aerial vehicle (UAV) technology has marked a transformative shift in various industries, with logistics distribution service being one of the prime sectors reaping the benefits. UAVs offer substantial benefits in speed, cost, and reach, promising to revolutionize logistics, especially in remote areas. On the one hand, they are poised to meet demands for quick and versatile delivery options. On the other hand, their deployment comes with challenges. Weather variabilities such as rainfall, wind speed, and the need for safe take-off intervals can compromise UAV safety and operation. Conventional route optimization often overlooks these dynamic factors, resulting in inefficient or unworkable delivery routes. The repeated time-consuming calculations are caused by repeated trials when making UAV group distribution plans. Recognizing these gaps, this study proposes a data representation to effectively transform the flight flyable area of UAVs into a time-varying network that maintains spatiotemporal connectivity and establishes a mathematical model that represents the complexities of UAV group distribution. Then, a multistage dynamic optimization algorithm specifically tailored for large-scale time-varying network distribution route search is designed to obtain the stable and optimal solution. Subsequent experimental validations on actual case datasets have confirmed the correctness, effectiveness, and adaptability of the algorithm. Benchmarking against traditional CPLEX methods demonstrated that the algorithm not only rivals the best solutions but does so with a 38.8 times increase in computational speed. When pitted against the shortest path Dijkstra and A algorithms, the method consistently outperformed, delivering solutions up to 3.5 times faster in large-scale applications. Moreover, the parameter sensitivity analysis is performed on the algorithm by adjusting the safe flight thresholds of rainfall and wind speed parameters and revealed that the performance of the algorithm has a strong positive correlation with the size of the time-varying network.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Intelligent Systems
International Journal of Intelligent Systems 工程技术-计算机:人工智能
CiteScore
11.30
自引率
14.30%
发文量
304
审稿时长
9 months
期刊介绍: The International Journal of Intelligent Systems serves as a forum for individuals interested in tapping into the vast theories based on intelligent systems construction. With its peer-reviewed format, the journal explores several fascinating editorials written by today''s experts in the field. Because new developments are being introduced each day, there''s much to be learned — examination, analysis creation, information retrieval, man–computer interactions, and more. The International Journal of Intelligent Systems uses charts and illustrations to demonstrate these ground-breaking issues, and encourages readers to share their thoughts and experiences.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信