Aggregation in swarm robotic systems: Evolution and probabilistic control

2007-08-01
Soysal, Onur
Bahçeci, Erkin
Şahin, Erol
In this study we investigate two approachees for aggregation behavior in swarm robotics systems: Evolutionary methods and probabilistic control. In first part, aggregation behavior is chosen as a case, where performance and scalability of aggregation behaviors of perceptron controllers that are evolved for a simulated swarm robotic system are systematically studied with different parameter settings. Using a cluster of computers to run simulations in parallel, four experiments are conducted varying some of the parameters. Rules of thumb are derived, which can be of guidance to the use of evolutionary methods to generate other swarm robotic behaviors as well. In the second part 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. We then discuss these two approaches for the aggregation problem.
Citation Formats
O. Soysal, E. Bahçeci, and E. Şahin, “Aggregation in swarm robotic systems: Evolution and probabilistic control,” pp. 199–225, 2007, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=34547230643&origin=inward.