基于混合遗传算法的军用无人机和运输ugv交付研究

Jeonghun Lee, Suhwan Kim
{"title":"基于混合遗传算法的军用无人机和运输ugv交付研究","authors":"Jeonghun Lee, Suhwan Kim","doi":"10.9766/kimst.2022.25.4.425","DOIUrl":null,"url":null,"abstract":"This paper studies the method of delivering munitions using both drones and UGVs that are developing along with the 4th Industrial Revolution. While drones are more mobile than UGVs, their loading capacity is small, and UGVs have relatively less mobility than drones, but their loading capacity is better. Therefore, by simultaneously operating these two delivery means, each other's shortcomings may be compensated. In addition, on actual battlefields, time constraints are an important factor in delivering munitions. Therefore, assuming an actual battlefield environment with a time limit, we establish delivery routes that minimize delivery time by operating both drones and UGVs with different capacities and speeds. If the delivery is not completed within the time limit, penalties are imposed. We devised the hybrid genetic algorithm to find solutions to the proposed model, and as results of the experiment, we showed the algorithm we presented solved the actual size problems in a short time.","PeriodicalId":17292,"journal":{"name":"Journal of the Korea Institute of Military Science and Technology","volume":"62 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Study on Delivery of Military Drones and Transport UGVs with Time Constraints Using Hybrid Genetic Algorithms\",\"authors\":\"Jeonghun Lee, Suhwan Kim\",\"doi\":\"10.9766/kimst.2022.25.4.425\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies the method of delivering munitions using both drones and UGVs that are developing along with the 4th Industrial Revolution. While drones are more mobile than UGVs, their loading capacity is small, and UGVs have relatively less mobility than drones, but their loading capacity is better. Therefore, by simultaneously operating these two delivery means, each other's shortcomings may be compensated. In addition, on actual battlefields, time constraints are an important factor in delivering munitions. Therefore, assuming an actual battlefield environment with a time limit, we establish delivery routes that minimize delivery time by operating both drones and UGVs with different capacities and speeds. If the delivery is not completed within the time limit, penalties are imposed. We devised the hybrid genetic algorithm to find solutions to the proposed model, and as results of the experiment, we showed the algorithm we presented solved the actual size problems in a short time.\",\"PeriodicalId\":17292,\"journal\":{\"name\":\"Journal of the Korea Institute of Military Science and Technology\",\"volume\":\"62 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Korea Institute of Military Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9766/kimst.2022.25.4.425\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Korea Institute of Military Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9766/kimst.2022.25.4.425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了伴随第四次工业革命发展的无人机和ugv的弹药投送方法。无人机的机动性比ugv强,但其装载能力较小,ugv的机动性相对不如无人机,但装载能力更好。因此,通过同时操作这两种交付方式,可以弥补彼此的不足。此外,在实际战场上,时间限制是运送弹药的一个重要因素。因此,假设一个有时间限制的实际战场环境,我们通过使用不同容量和速度的无人机和ugv来建立最小化交付时间的交付路线。如果未在规定期限内完成交付,将受到处罚。我们设计了混合遗传算法来求解所提出的模型,实验结果表明,我们提出的算法在短时间内解决了实际的尺寸问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Study on Delivery of Military Drones and Transport UGVs with Time Constraints Using Hybrid Genetic Algorithms
This paper studies the method of delivering munitions using both drones and UGVs that are developing along with the 4th Industrial Revolution. While drones are more mobile than UGVs, their loading capacity is small, and UGVs have relatively less mobility than drones, but their loading capacity is better. Therefore, by simultaneously operating these two delivery means, each other's shortcomings may be compensated. In addition, on actual battlefields, time constraints are an important factor in delivering munitions. Therefore, assuming an actual battlefield environment with a time limit, we establish delivery routes that minimize delivery time by operating both drones and UGVs with different capacities and speeds. If the delivery is not completed within the time limit, penalties are imposed. We devised the hybrid genetic algorithm to find solutions to the proposed model, and as results of the experiment, we showed the algorithm we presented solved the actual size problems in a short time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Point Ahead Angle(PAA) Estimation and a Control Algorithm for Satellite-Pointing of the Ground Terminal in Satellite-to-Ground Optical Communication Semi-Supervised SAR Image Classification via Adaptive Threshold Selection A Simulator Development of Surface Warship Torpedo Defense System considering Bubble-Generating Wake Decoy Progressive Test and Evaluation Strategy for Verification of KF-X AESA Radar Development Characteristic Property of Combustion and Internal Ballistics of Triple-Based Propellant according to Particle Size of RDX
×
引用
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