{"title":"UAV Task Assignment Algorithm Based on Splitting and Reorganization","authors":"Jiehong Wu, Xin Su","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00035","DOIUrl":null,"url":null,"abstract":"With the development of e-commerce, one of the essential ways of logistics distribution in the future is the distribution by UAVs. The limitations of the UAVs' resources and the distribution of express delivery need to be considered when delivery multiple merchandises. If the UAV task assignment is only based on the location of the delivery point, more UAVs are needed to accomplish the task. Therefore, it is necessary to divide the merchandises at the same distribution point. The goal of this paper is to use the minimum number of UAVs while minimizing the total distance traveled. This paper considers the two constraints of the maximum payload and cruising range of the UAV and models it according to these two constraints. Then the group-split-reorganize method is proposed to separate the packets that meet the constraints and optimize the intragroup path. Finally, experiments confirmed the feasibility and effectiveness of the method.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the development of e-commerce, one of the essential ways of logistics distribution in the future is the distribution by UAVs. The limitations of the UAVs' resources and the distribution of express delivery need to be considered when delivery multiple merchandises. If the UAV task assignment is only based on the location of the delivery point, more UAVs are needed to accomplish the task. Therefore, it is necessary to divide the merchandises at the same distribution point. The goal of this paper is to use the minimum number of UAVs while minimizing the total distance traveled. This paper considers the two constraints of the maximum payload and cruising range of the UAV and models it according to these two constraints. Then the group-split-reorganize method is proposed to separate the packets that meet the constraints and optimize the intragroup path. Finally, experiments confirmed the feasibility and effectiveness of the method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于分割重组的无人机任务分配算法
随着电子商务的发展,无人机配送是未来物流配送的重要方式之一。在投递多种商品时,需要考虑无人机资源和快递配送的局限性。如果无人机的任务分配仅仅基于送货点的位置,则需要更多的无人机来完成任务。因此,有必要在同一分销点划分商品。本文的目标是使用最少数量的无人机,同时使总飞行距离最小化。本文考虑了无人机的最大载荷和巡航距离这两个约束条件,并根据这两个约束条件对无人机进行了建模。在此基础上,提出了组分裂-重组方法,分离满足约束条件的分组,优化组内路径。最后,通过实验验证了该方法的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the RTWC 2019 Workshop Chairs Message from the NGDN 2019 Workshop Chairs Ideation Support System with Personalized Knowledge Level Prediction Message from the DSCI 2019 General Chairs Connection Degree Cost and Reward Based Algorithm in Cognitive Radio Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1