Probabilistic aggregation strategies in swarm robotic systems


Soysal O., Sahin E.

IEEE Swarm Intelligence Symposium, California, United States Of America, 8 - 10 June 2005, pp.325-332 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • City: California
  • Country: United States Of America
  • Page Numbers: pp.325-332

Abstract

In this study, a systematic analysis of probabilistic aggregation strategies in swarm robotic systems is presented. A generic aggregation behavior is proposed as a combination of four basic behaviors: obstacle avoidance, approach, repel, and wait. The latter three basic behaviors are combined using a three-state finite state machine with two probabilistic transitions among them. Two different metrics were used to compare performance of strategies. Through systematic experiments, how the aggregation performance, as measured by these two metrics, change 1) with transition probabilities, 2) with number of simulation steps, and 3) with arena size, is studied.