Aggregation in swarm robotic systems: Evolution and probabilistic control

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.
Turkish Journal of Electrical Engineering and Computer Sciences


Evolving aggregation behaviors for swarm robotics systems: a systematic case study
Bahçeci, Erkin; Şahin, Erol; Department of Computer Engineering (2005)
Evolutionary methods are shown to be useful in developing behaviors in robotics. Interest in the use of evolution in swarm robotics is also on the rise. However, when one attempts to use artificial evolution to develop behaviors for a swarm robotic system, he is faced with decisions to be made regarding some parameters of fitness evaluations and of the genetic algorithm. In this thesis, aggregation behavior is chosen as a case, where performance and scalability of aggregation behaviors of perceptron control...
Dynamic stability analysis of modular, self-reconfigurable robotic systems
Böke, Tevfik Ali; Soylu, Reşit; Department of Mechanical Engineering (2005)
In this study, an efficient algorithm has been developed for the dynamic stability analysis of self-reconfigurable, modular robots. Such an algorithm is essential for the motion planning of self-reconfigurable robotic systems. The building block of the algorithm is the determination of the stability of a rigid body in contact with the ground when there exists Coulomb friction between the two bodies. This problem is linearized by approximating the friction cone with a pyramid and then solved, efficiently, us...
Perpetual Robot Swarm: Long-Term Autonomy of Mobile Robots Using On-the-fly Inductive Charging
Arvin, Farshad; Watson, Simon; Turgut, Ali Emre; Espinosa, Jose; Krajnik, Tomas; Lennox, Barry (2018-12-01)
Swarm robotics studies the intelligent collective behaviour emerging from long-term interactions of large number of simple robots. However, maintaining a large number of robots operational for long time periods requires significant battery capacity, which is an issue for small robots. Therefore, re-charging systems such as automated battery-swapping stations have been implemented. These systems require that the robots interrupt, albeit shortly, their activity, which influences the swarm behaviour. In this p...
Evolving Aggregation Behavior for Robot Swarms: A Cost Analysis for Distinct Fitness Functions
Yalcin, Cagri (2008-10-29)
Evolving behaviors for swarm robotic systems offers interesting emerged strategies which may be complex and unpredictable by an explicit behavioral controller design. However, even in the evolutionary case, there are critical choices regarding the design of the evolutionary algorithm that a roboticist should take into account to achieve desired goal with a reasonable efficiency. Among these design choices, adopting an appropriate fitness function is a crucial task, since it directly affects the resulting ev...
Learning by optimization in random neural networks
Atalay, Mehmet Volkan (1998-10-28)
The random neural network model proposed by Gelenbe has a number of interesting features in addition to a well established theory. Gelenbe has also developed a learning algorithm for the recurrent random network model using gradient descent of a quadratic error function. We present a quadratic optimization approach for learning in the random neural network, particularly for image texture reconstruction.
Citation Formats
O. Soysal, E. Bahçeci, and E. Şahin, “Aggregation in swarm robotic systems: Evolution and probabilistic control,” Turkish Journal of Electrical Engineering and Computer Sciences, pp. 199–225, 2007, Accessed: 00, 2021. [Online]. Available: