基于迭代遗传算法的临时网络无人机最优定位

N. Ceccarelli, Paulo Alexandre Regis, S. Sengupta, David Feil-Seifer
{"title":"基于迭代遗传算法的临时网络无人机最优定位","authors":"N. Ceccarelli, Paulo Alexandre Regis, S. Sengupta, David Feil-Seifer","doi":"10.1109/WOCC48579.2020.9114922","DOIUrl":null,"url":null,"abstract":"Efficient arrangement of UAVs in a swarm formation is essential to the functioning of the swarm as a temporary communication network. Such a network could assist in search and rescue efforts by providing first responders with a means of communication. We propose a user-friendly and effective system for calculating and visualizing an optimal layout of UAVs. An initial calculation to gather parameter information is followed by the proposed algorithm that generates an optimal solution. A visualization is displayed in an easy-to-comprehend manner after the proposed iterative genetic algorithm finds an optimal solution. The proposed system runs iteratively, adding UAV at each intermediate conclusion, until a solution is found. Information is passed between runs of the iterative genetic algorithm to reduce runtime and complexity. The results from testing show that the proposed algorithm yields optimal solutions more frequently than the k-means clustering algorithm. This system finds an optimal solution 80% of the time while k-means clustering is unable to find a solution when presented with a complex problem.","PeriodicalId":187607,"journal":{"name":"2020 29th Wireless and Optical Communications Conference (WOCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Optimal UAV Positioning for a Temporary Network Using an Iterative Genetic Algorithm\",\"authors\":\"N. Ceccarelli, Paulo Alexandre Regis, S. Sengupta, David Feil-Seifer\",\"doi\":\"10.1109/WOCC48579.2020.9114922\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficient arrangement of UAVs in a swarm formation is essential to the functioning of the swarm as a temporary communication network. Such a network could assist in search and rescue efforts by providing first responders with a means of communication. We propose a user-friendly and effective system for calculating and visualizing an optimal layout of UAVs. An initial calculation to gather parameter information is followed by the proposed algorithm that generates an optimal solution. A visualization is displayed in an easy-to-comprehend manner after the proposed iterative genetic algorithm finds an optimal solution. The proposed system runs iteratively, adding UAV at each intermediate conclusion, until a solution is found. Information is passed between runs of the iterative genetic algorithm to reduce runtime and complexity. The results from testing show that the proposed algorithm yields optimal solutions more frequently than the k-means clustering algorithm. This system finds an optimal solution 80% of the time while k-means clustering is unable to find a solution when presented with a complex problem.\",\"PeriodicalId\":187607,\"journal\":{\"name\":\"2020 29th Wireless and Optical Communications Conference (WOCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 29th Wireless and Optical Communications Conference (WOCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOCC48579.2020.9114922\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 29th Wireless and Optical Communications Conference (WOCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCC48579.2020.9114922","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

有效地安排无人机编队是集群作为临时通信网络发挥作用的关键。这种网络可以通过向第一反应者提供通信手段来协助搜索和救援工作。我们提出了一个用户友好且有效的系统来计算和可视化无人机的最佳布局。首先进行初始计算以收集参数信息,然后采用生成最优解的算法。提出的迭代遗传算法找到最优解后,以易于理解的方式显示可视化。该系统迭代运行,在每个中间结论处添加无人机,直到找到解决方案。信息在迭代遗传算法的运行之间传递,以减少运行时间和复杂性。测试结果表明,该算法比k均值聚类算法更频繁地产生最优解。该系统在80%的时间内找到最优解,而k-means聚类在遇到复杂问题时无法找到解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal UAV Positioning for a Temporary Network Using an Iterative Genetic Algorithm
Efficient arrangement of UAVs in a swarm formation is essential to the functioning of the swarm as a temporary communication network. Such a network could assist in search and rescue efforts by providing first responders with a means of communication. We propose a user-friendly and effective system for calculating and visualizing an optimal layout of UAVs. An initial calculation to gather parameter information is followed by the proposed algorithm that generates an optimal solution. A visualization is displayed in an easy-to-comprehend manner after the proposed iterative genetic algorithm finds an optimal solution. The proposed system runs iteratively, adding UAV at each intermediate conclusion, until a solution is found. Information is passed between runs of the iterative genetic algorithm to reduce runtime and complexity. The results from testing show that the proposed algorithm yields optimal solutions more frequently than the k-means clustering algorithm. This system finds an optimal solution 80% of the time while k-means clustering is unable to find a solution when presented with a complex problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信