A Probabilistic geometric model of self-organized aggregation in swarm robotic systems

Bayındır, Levent
Self-organized aggregation is the global level gathering of randomly placed robots using local sensing. Developing high performance and scalable aggregation behaviors for a swarm of mobile robots is non-trivial and still in need, when robots control themselves, perceive only a small part of the arena, and do not have access to information such as their position, the size of the arena or the number of robots. In this thesis, we developed a non-spatial probabilistic geometric model for self-organized aggregation as a tool to analyze aggregation. The model consists of four formulas for predicting the probabilities of aggregation events: creation, growing, shrinking and dissipation of an aggregate. The creation probability is derived mathematically using kinetic theory of gases. In order to derive formulas for growing, shrinking and dissipation probabilities, first, it is assumed that aggregates formed by robots are circular. Then, these formulas are derived geometrically using circle packing theory. We proposed an aggregation behavior and implemented this behavior in the Stage multi-robot simulator. The behavior consists of four sub-behaviors: search, wait, leave and change direction. The wait sub-behavior is specially designed to force aggregates to be circular so that our assumption for the model holds in simulation experiments. We verified each formula using simulation experiments conducted in the Stage multi-robot simulator. Through systematic experiments, we showed that model predictions and simulation results match well and the formulas proposed for growing and shrinking probabilities predict these probabilities better for larger aggregates compared to predictions of previous self-organized aggregation models. We also conducted experiments, in which certain aggregation events are disabled systematically, in order to verify the model further and show that our model can be used to predict the steady-state performance of generic simulation experiments. We use two different methods to predict the steady state performance with our model: microscopic model execution and steady state analysis. It is shown that the largest aggregate size, the number of aggregates, the number of searching robots and the aggregate distributions at the steady state-obtained from microscopic model execution, steady state analysis and simulation experiments are close to each other and our model can be used to predict steady-state performance of aggregation experiments.


A Conditional coverage path planning method for an autonomous lawn mower
Karol, Ardıç; Konukseven, Erhan İlhan; Koku, Ahmet Buğra; Department of Mechanical Engineering (2016)
Randomized and deterministic coverage path planning methods are widely used in autonomous lawn mowers. Random planning cannot guarantee a complete coverage, whereas, many deterministic techniques are not solely eligible for unstructured outdoor environments, since they highly suffer from wheel slippage or numerical drift. Besides, complete coverage techniques either demands high computational power or expensive sensor hardware. A genuine, Conditional Coverage Path Planning (CCPP) method, which satisfies com...
A behavior based robot control system using neuro-fuzzy approach
Öğüt, Demet; Alpaslan, Ferda Nur; Department of Computer Engineering (2003)
In autonomous navigation of mobile robots the dynamic environment is a source of problems. Because it is not possible to model all the possible conditions, the key point in the robot control is to design a system that is adaptable to different conditions and robust in dynamic environments. This study presents a reactive control system for a Khepera robot with the ability to navigate in a dynamic environment for reaching goal objects. The main motivation of this research is to design a robot control, which i...
Implementation of a closed-loop action generation system on a humanoid robot through learning by demonstration
Tunaoğlu, Doruk; Şahin, Erol; Department of Computer Engineering (2010)
In this thesis the action learning and generation problem on a humanoid robot is studied. Our aim is to realize action learning, generation and recognition in one system and our inspiration source is the mirror neuron hypothesis which suggests that action learning, generation and recognition share the same neural circuitry. Dynamic Movement Primitives, an efficient action learning and generation approach, are modified in order to fulfill this aim. The system we developed (1) can learn from multiple demonstr...
Decentralized coordination and control in robotic swarms
Şamiloğlu, Andaç Töre; Koku, Ahmet Buğra; Department of Mechanical Engineering (2012)
In this thesis study the coordination and control strategies for leaderless, decentralized robotic swarms are developed. The mathematical models of the collective motion of agents are derived by mimicry of swarm of organisms like schools of fish, herds of quadrupeds, flocks of flying birds. There are three main parts of this study (i) mathematical modelling, (ii) analytical analysis (iii) experimental and simulation based validations of the results. These works are performed on the (i) Fundamental agreement...
Design of a low-costs warm robotic system for flocking
Demir, Çağrı Ata; Turgut, Ali Emre; Department of Mechanical Engineering (2019)
Swarm robotics is an approach to the coordination of large numbers of robots. The main motivation of this thesis is to study a robotic system designed to do flocking both indoors and outdoors. A walking robot is designed parallel to this purpose. In the first part of thesis, a leg is designed to minimize the displacement of center of mass of robot in vertical axis to eliminate mechanical noise. Mechanism analysis and Matlab optimization tools are utilized in this process. Then, electronic components of robo...
Citation Formats
L. Bayındır, “A Probabilistic geometric model of self-organized aggregation in swarm robotic systems,” Ph.D. - Doctoral Program, Middle East Technical University, 2012.