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.