{"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}
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.