Using scouts to predict swarm success rate

Antons Rebguns, R. Anderson-Sprecher, D. Spears, W. Spears, A. Kletsov
{"title":"Using scouts to predict swarm success rate","authors":"Antons Rebguns, R. Anderson-Sprecher, D. Spears, W. Spears, A. Kletsov","doi":"10.1109/SIS.2008.4668284","DOIUrl":null,"url":null,"abstract":"The scenario addressed here is that of a swarm of agents (simulated robots) that needs to travel from an initial location to a goal location, while avoiding obstacles. Before deploying the entire swarm, it would be advantageous to have a certain level of confidence that a desired percentage of the swarm will be likely to succeed in getting to the goal. The approach taken in this paper is to use a small group of expendable robot ldquoscoutsrdquo to predict the success probability for the swarm. Two approaches to solving this problem are presented and compared - the standard Bernoulli trials formula, and a new Bayesian formula. Extensive experimental results are summarized that measure and compare the mean-squared error of the predictions with respect to ground truth, under a wide variety of circumstances. Experimental conclusions include the utility of a uniform prior for the Bayesian formula in knowledge-lean situations, and the accuracy and robustness of the Bayesian approach. The paper also reports an intriguing result, namely, that both formulas usually predict better in the presence of inter-agent forces than when their independence assumptions hold.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Swarm Intelligence Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIS.2008.4668284","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The scenario addressed here is that of a swarm of agents (simulated robots) that needs to travel from an initial location to a goal location, while avoiding obstacles. Before deploying the entire swarm, it would be advantageous to have a certain level of confidence that a desired percentage of the swarm will be likely to succeed in getting to the goal. The approach taken in this paper is to use a small group of expendable robot ldquoscoutsrdquo to predict the success probability for the swarm. Two approaches to solving this problem are presented and compared - the standard Bernoulli trials formula, and a new Bayesian formula. Extensive experimental results are summarized that measure and compare the mean-squared error of the predictions with respect to ground truth, under a wide variety of circumstances. Experimental conclusions include the utility of a uniform prior for the Bayesian formula in knowledge-lean situations, and the accuracy and robustness of the Bayesian approach. The paper also reports an intriguing result, namely, that both formulas usually predict better in the presence of inter-agent forces than when their independence assumptions hold.
利用侦察兵来预测蜂群的成功率
这里讨论的场景是一群代理(模拟机器人)需要从初始位置移动到目标位置,同时避开障碍物。在部署整个群体之前,最好有一定程度的信心,即群体中有一定比例的人有可能成功实现目标。本文采用的方法是使用一小组可消耗的机器人来预测群体的成功概率。提出并比较了解决这一问题的两种方法——标准伯努利试验公式和一种新的贝叶斯公式。总结了大量的实验结果,测量和比较预测的均方误差相对于基础真理,在各种情况下。实验结论包括贝叶斯公式在知识精益情况下的统一先验的效用,以及贝叶斯方法的准确性和鲁棒性。这篇论文还报告了一个有趣的结果,即,这两个公式通常在主体间力量存在时比它们的独立性假设成立时预测得更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信