自主机器人群体中的目标感知团队关系

Lukas Esterle
{"title":"自主机器人群体中的目标感知团队关系","authors":"Lukas Esterle","doi":"10.1109/SASO.2018.00020","DOIUrl":null,"url":null,"abstract":"Collaboration in teams is essential in robot collectives. In order to achieve goals, individual robots would otherwise not be able to accomplish. In a such a distributed and highly dynamic system, a global coordination might not be possible. In this paper, we analyse static team affiliations, defined at deployment time, and compare its efficiency against dynamic team affiliations generated during runtime using random selection. Since operators might not be able to determine all dynamic aspects of the given environment at the time of deployment, we further propose a novel, goal-aware approach to affiliate each robot with a team. This approach brings together insights from biology, sociology, and psychology. In this novel approach, robots only operate on aggregated information from the network which is potentially changing during runtime. Finally, we also introduce an approach to select a team affiliation during runtime using machine learning techniques. Using 60,000 randomised scenarios, we analyse the efficiency and further discuss the different benefits and drawbacks of the proposed approaches.","PeriodicalId":405522,"journal":{"name":"2018 IEEE 12th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Goal-Aware Team Affiliation in Collectives of Autonomous Robots\",\"authors\":\"Lukas Esterle\",\"doi\":\"10.1109/SASO.2018.00020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Collaboration in teams is essential in robot collectives. In order to achieve goals, individual robots would otherwise not be able to accomplish. In a such a distributed and highly dynamic system, a global coordination might not be possible. In this paper, we analyse static team affiliations, defined at deployment time, and compare its efficiency against dynamic team affiliations generated during runtime using random selection. Since operators might not be able to determine all dynamic aspects of the given environment at the time of deployment, we further propose a novel, goal-aware approach to affiliate each robot with a team. This approach brings together insights from biology, sociology, and psychology. In this novel approach, robots only operate on aggregated information from the network which is potentially changing during runtime. Finally, we also introduce an approach to select a team affiliation during runtime using machine learning techniques. Using 60,000 randomised scenarios, we analyse the efficiency and further discuss the different benefits and drawbacks of the proposed approaches.\",\"PeriodicalId\":405522,\"journal\":{\"name\":\"2018 IEEE 12th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 12th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SASO.2018.00020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 12th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SASO.2018.00020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

在机器人集体中,团队协作是必不可少的。为了实现目标,单个机器人将无法完成。在这样一个分布式和高度动态的系统中,全球协调可能是不可能的。在本文中,我们分析了在部署时定义的静态团队关系,并将其与运行时使用随机选择生成的动态团队关系的效率进行了比较。由于操作员在部署时可能无法确定给定环境的所有动态方面,因此我们进一步提出了一种新颖的目标感知方法,将每个机器人与团队联系起来。这种方法汇集了生物学、社会学和心理学的见解。在这种新颖的方法中,机器人只对来自网络的聚合信息进行操作,这些信息在运行时可能会发生变化。最后,我们还介绍了一种使用机器学习技术在运行时选择团队隶属关系的方法。使用60,000个随机场景,我们分析了效率,并进一步讨论了所提出方法的不同优点和缺点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Goal-Aware Team Affiliation in Collectives of Autonomous Robots
Collaboration in teams is essential in robot collectives. In order to achieve goals, individual robots would otherwise not be able to accomplish. In a such a distributed and highly dynamic system, a global coordination might not be possible. In this paper, we analyse static team affiliations, defined at deployment time, and compare its efficiency against dynamic team affiliations generated during runtime using random selection. Since operators might not be able to determine all dynamic aspects of the given environment at the time of deployment, we further propose a novel, goal-aware approach to affiliate each robot with a team. This approach brings together insights from biology, sociology, and psychology. In this novel approach, robots only operate on aggregated information from the network which is potentially changing during runtime. Finally, we also introduce an approach to select a team affiliation during runtime using machine learning techniques. Using 60,000 randomised scenarios, we analyse the efficiency and further discuss the different benefits and drawbacks of the proposed approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信