面向任务的机器人群体局部群体生成

Geunho Lee, Yukinori Sato, N. Chong
{"title":"面向任务的机器人群体局部群体生成","authors":"Geunho Lee, Yukinori Sato, N. Chong","doi":"10.1109/URAI.2011.6145955","DOIUrl":null,"url":null,"abstract":"This paper addresses an adjustable group generation problem for heterogeneous robot groups performing cooperative tasks simultaneously. As its solution approach, we propose a decentralized task-oriented group generation scheme, which is composed of group consensus and self-adjustment algorithms. The group consensus algorithm enables robots to select leader robots and generate individual groups based on the leaders. Through the self-adjustment algorithm, to meet assigned task conditions, the leader attempts to recruit more members or any robots are dismissed against the group. By doing this, robots can reach consensus on self-organizing themselves according to the task conditions. Extensive simulations are performed to verify that the proposed scheme effects an adjustable self-organization.","PeriodicalId":385925,"journal":{"name":"2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Decentralized task-oriented local group generation for robot swarms\",\"authors\":\"Geunho Lee, Yukinori Sato, N. Chong\",\"doi\":\"10.1109/URAI.2011.6145955\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses an adjustable group generation problem for heterogeneous robot groups performing cooperative tasks simultaneously. As its solution approach, we propose a decentralized task-oriented group generation scheme, which is composed of group consensus and self-adjustment algorithms. The group consensus algorithm enables robots to select leader robots and generate individual groups based on the leaders. Through the self-adjustment algorithm, to meet assigned task conditions, the leader attempts to recruit more members or any robots are dismissed against the group. By doing this, robots can reach consensus on self-organizing themselves according to the task conditions. Extensive simulations are performed to verify that the proposed scheme effects an adjustable self-organization.\",\"PeriodicalId\":385925,\"journal\":{\"name\":\"2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/URAI.2011.6145955\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/URAI.2011.6145955","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

研究了同时执行协作任务的异构机器人群体的可调群体生成问题。作为其解决方法,我们提出了一种分散的面向任务的群体生成方案,该方案由群体共识和自调整算法组成。群体共识算法使机器人能够选择领导者机器人,并根据领导者生成个体群体。通过自我调整算法,为了满足分配的任务条件,领导者可以尝试招募更多的成员,或者将任何机器人从群体中解雇。通过这样做,机器人可以根据任务条件达成自组织的共识。通过大量的仿真验证了该方案对可调自组织的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Decentralized task-oriented local group generation for robot swarms
This paper addresses an adjustable group generation problem for heterogeneous robot groups performing cooperative tasks simultaneously. As its solution approach, we propose a decentralized task-oriented group generation scheme, which is composed of group consensus and self-adjustment algorithms. The group consensus algorithm enables robots to select leader robots and generate individual groups based on the leaders. Through the self-adjustment algorithm, to meet assigned task conditions, the leader attempts to recruit more members or any robots are dismissed against the group. By doing this, robots can reach consensus on self-organizing themselves according to the task conditions. Extensive simulations are performed to verify that the proposed scheme effects an adjustable self-organization.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信