达尔文式的机器人群以最少的交流进行探索

M. Couceiro, R. Rocha, N. Ferreira, P. A. Vargas
{"title":"达尔文式的机器人群以最少的交流进行探索","authors":"M. Couceiro, R. Rocha, N. Ferreira, P. A. Vargas","doi":"10.1109/CEC.2013.6557562","DOIUrl":null,"url":null,"abstract":"The Robotic Darwinian Particle Swarm Optimization (RDPSO) recently introduced in the literature has the ability to dynamically partition the whole population of robots based on simple “punish-reward” rules. Although this evolutionary algorithm enables the reduction of the amount of required information exchange among robots, a further analysis on the communication complexity of the RDPSO needs to be carried out so as to evaluate its scalability. This paper analyses the architecture of the RDPSO communication system, thus describing the dynamics of the communication data packet structure shared between teammates. Moreover, a set of simple communication rules is also proposed in order to reduce the communication overhead within swarms of robots. Experimental results with teams of 15 real robots show that the proposed methodology reduces the communication overhead, thus improving the scalability and applicability of the RDPSO algorithm.","PeriodicalId":211988,"journal":{"name":"2013 IEEE Congress on Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Darwinian Robotic Swarms for exploration with minimal communication\",\"authors\":\"M. Couceiro, R. Rocha, N. Ferreira, P. A. Vargas\",\"doi\":\"10.1109/CEC.2013.6557562\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Robotic Darwinian Particle Swarm Optimization (RDPSO) recently introduced in the literature has the ability to dynamically partition the whole population of robots based on simple “punish-reward” rules. Although this evolutionary algorithm enables the reduction of the amount of required information exchange among robots, a further analysis on the communication complexity of the RDPSO needs to be carried out so as to evaluate its scalability. This paper analyses the architecture of the RDPSO communication system, thus describing the dynamics of the communication data packet structure shared between teammates. Moreover, a set of simple communication rules is also proposed in order to reduce the communication overhead within swarms of robots. Experimental results with teams of 15 real robots show that the proposed methodology reduces the communication overhead, thus improving the scalability and applicability of the RDPSO algorithm.\",\"PeriodicalId\":211988,\"journal\":{\"name\":\"2013 IEEE Congress on Evolutionary Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Congress on Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2013.6557562\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2013.6557562","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

最近在文献中介绍的机器人达尔文粒子群优化(RDPSO)具有基于简单的“奖惩”规则动态划分整个机器人种群的能力。虽然这种进化算法能够减少机器人之间所需的信息交换量,但为了评估其可扩展性,还需要对RDPSO的通信复杂性进行进一步分析。本文分析了RDPSO通信系统的体系结构,从而描述了队友之间共享的通信数据包结构的动态变化。此外,为了减少机器人群之间的通信开销,还提出了一套简单的通信规则。15个真实机器人团队的实验结果表明,该方法降低了通信开销,从而提高了RDPSO算法的可扩展性和适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Darwinian Robotic Swarms for exploration with minimal communication
The Robotic Darwinian Particle Swarm Optimization (RDPSO) recently introduced in the literature has the ability to dynamically partition the whole population of robots based on simple “punish-reward” rules. Although this evolutionary algorithm enables the reduction of the amount of required information exchange among robots, a further analysis on the communication complexity of the RDPSO needs to be carried out so as to evaluate its scalability. This paper analyses the architecture of the RDPSO communication system, thus describing the dynamics of the communication data packet structure shared between teammates. Moreover, a set of simple communication rules is also proposed in order to reduce the communication overhead within swarms of robots. Experimental results with teams of 15 real robots show that the proposed methodology reduces the communication overhead, thus improving the scalability and applicability of the RDPSO algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A study on two-step search based on PSO to improve convergence and diversity for Many-Objective Optimization Problems An evolutionary approach to the multi-objective pickup and delivery problem with time windows A new performance metric for user-preference based multi-objective evolutionary algorithms A new algorithm for reducing metaheuristic design effort Evaluation of gossip Vs. broadcast as communication strategies for multiple swarms solving MaOPs
×
引用
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