Optimization of decentralized information dissemination in quadrotor swarm using genetic algorithm

Jose Martin Z. Maningo, G. E. Faelden, R. Nakano, A. Bandala, E. Dadios
{"title":"Optimization of decentralized information dissemination in quadrotor swarm using genetic algorithm","authors":"Jose Martin Z. Maningo, G. E. Faelden, R. Nakano, A. Bandala, E. Dadios","doi":"10.1109/HNICEM.2014.7016257","DOIUrl":null,"url":null,"abstract":"There is a glaring problem in communication systems when it comes to a decentralized robotic swarm. Since a decentralized swarm would limit the awareness of each agent to its immediate surroundings/neighbors, the exchange of information between agents may now prove to be challenging. An epidemic-based broadcasting technique is then presented to resolve the problem of end-to-end agent communication. This paper aims to optimize the information diffusion by means of implementing genetic algorithm to optimize the time it will take for each quadrotor individual to acquire the information coming from a single source (i.e. the quadrotor who first received the information from an external stimulus). The method by which this is done is epidemic in nature. Due to this, for each time there would be a signal broadcasting, the genetic algorithm would be run to determine the next ideal location of each individual. A genetic algorithm was looped several times to achieve the desired solution. The results showed that for each run of the GA, the number of quadrotors having received the information continually increased until the output converges to a fitness level. However this only worked under certain constraints that need to be weighed out properly. This includes the readjustment of the fitness and crossover functions. Also, the parameters of the GA must be well calibrated for proper output response.","PeriodicalId":309548,"journal":{"name":"2014 International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management (HNICEM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management (HNICEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HNICEM.2014.7016257","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

There is a glaring problem in communication systems when it comes to a decentralized robotic swarm. Since a decentralized swarm would limit the awareness of each agent to its immediate surroundings/neighbors, the exchange of information between agents may now prove to be challenging. An epidemic-based broadcasting technique is then presented to resolve the problem of end-to-end agent communication. This paper aims to optimize the information diffusion by means of implementing genetic algorithm to optimize the time it will take for each quadrotor individual to acquire the information coming from a single source (i.e. the quadrotor who first received the information from an external stimulus). The method by which this is done is epidemic in nature. Due to this, for each time there would be a signal broadcasting, the genetic algorithm would be run to determine the next ideal location of each individual. A genetic algorithm was looped several times to achieve the desired solution. The results showed that for each run of the GA, the number of quadrotors having received the information continually increased until the output converges to a fitness level. However this only worked under certain constraints that need to be weighed out properly. This includes the readjustment of the fitness and crossover functions. Also, the parameters of the GA must be well calibrated for proper output response.
基于遗传算法的四旋翼机群分散信息传播优化
当涉及到分散的机器人群时,通信系统中存在一个明显的问题。由于分散的群体将限制每个代理对其直接环境/邻居的意识,代理之间的信息交换现在可能被证明是具有挑战性的。在此基础上,提出了一种基于流行的广播技术来解决端到端的代理通信问题。本文旨在通过实现遗传算法优化信息扩散,以优化每个四旋翼个体获取来自单一来源(即首先接收到外部刺激信息的四旋翼)的信息所需的时间。这样做的方法在本质上是流行的。因此,每当有信号广播时,就会运行遗传算法来确定每个个体的下一个理想位置。一个遗传算法被循环几次以得到期望的解。结果表明,对于遗传算法的每一次运行,接收到信息的四旋翼机数量不断增加,直到输出收敛到一个适应度水平。然而,这只在需要适当权衡的某些限制条件下才有效。这包括适应度和交叉函数的重新调整。此外,必须对遗传算法的参数进行很好的校准,以获得适当的输出响应。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信