Using scouts to predict swarm success rate
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 s...
Saved in:
Published in | 2008 IEEE Swarm Intelligence Symposium pp. 1 - 8 |
---|---|
Main Authors | , , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.09.2008
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISBN: | 9781424427048 1424427045 |
DOI: | 10.1109/SIS.2008.4668284 |