- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Volume 2013 (2013), Article ID 608164, 10 pages
An Introduction to Swarm Robotics
ETSI Industriales, Universidad Politécnica de Madrid, c/José Gutiérrez Abascal, 2, 28006 Madrid, Spain
Received 18 April 2012; Accepted 19 June 2012
Academic Editors: C. A. G. Soerensen and A. Zavala-Rio
Copyright © 2013 Iñaki Navarro and Fernando Matía. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Swarm robotics is a field of multi-robotics in which large number of robots are coordinated in a distributed and decentralised way. It is based on the use of local rules, and simple robots compared to the complexity of the task to achieve, and inspired by social insects. Large number of simple robots can perform complex tasks in a more efficient way than a single robot, giving robustness and flexibility to the group. In this article, an overview of swarm robotics is given, describing its main properties and characteristics and comparing it to general multi-robotic systems. A review of different research works and experimental results, together with a discussion of the future swarm robotics in real world applications completes this work.
Swarm robotics is the study of how to coordinate large groups of relatively simple robots through the use of local rules. It takes its inspiration from societies of insects that can perform tasks that are beyond the capabilities of the individuals. Beni  describes this kind of robots’ coordination as follows:
The group of robots is not just a group. It has some special characteristics, which are found in swarms of insects, that is, decentralised control, lack of synchronisation, simple and (quasi) identical members.
This paper summarises the research performed during the last years in this field of multi-robotic systems. The aim is to give a glimpse of swarm robotics and its applications. In Section 2, the motivation and inspiration of swarm robotics taken from social insects is explained. Section 3 continues addressing the main characteristics of swarm robotics. The relationship of swarm robotics with multi-robotic systems in general is stated in Section 4. Different robotic platforms and simulators suitable for swarm-robotic experimentation are described in Section 5. Section 6 surveys the different results in solving tasks and performing basic behaviours using a swarm-robotic approach. Present and future real applications are depicted in Section 7. Lastly, in Section 8 the main ideas of this survey are summarised.
2. Social Insect Motivation and Inspiration
The collective behaviours of social insects, such as the honey-bee’s dance, the wasp’s nest-building, the construction of the termite mound, or the trail following of ants, were considered for a long time strange and mysterious aspects of biology. Researchers have demonstrated in recent decades that individuals do not need any representation or sophisticated knowledge to produce such complex behaviours . In social insects, the individuals are not informed about the global status of the colony. There exists no leader that guides all the other individuals in order to accomplish their goals. The knowledge of the swarm is distributed throughout all the agents, where an individual is not able to accomplish its task without the rest of the swarm.
Social insects are able to exchange information, and for instance, communicate the location of a food source, a favourable foraging zone or the presence of danger to their mates. This interaction between the individuals is based on the concept of locality, where there is no knowledge about the overall situation. The implicit communication through changes made in the environment is called stigmergy [3, 4]. Insects modify their behaviours because of the previous changes made by their mates in the environment. This can be seen in the nest construction of termites, where the changes in the behaviours of the workers are determined by the structure of the nest .
Organisation emerges from the interactions between the individuals and between individuals and the environment. These interactions are propagated throughout the colony and therefore the colony can solve tasks that could not be solved by a sole individual. These collective behaviours are defined as self-organising behaviours. Self-organisation theories, borrowed from physics and chemistry domains, can be used to explain how social insects exhibit complex collective behaviour that emerges from interactions of individuals behaving simply . Self-organisation relies on the combination of the following four basic rules: positive feedback, negative feedback, randomness, and multiple interactions .
Şahin  lists some properties seen in social insects as desirable in multi-robotic systems: robustness, the robot swarm must be able to work even if some of the individuals fail, or there are disturbances in the environment; flexibility, the swarm must be able to create different solutions for different tasks, and be able to change each robot role depending on the needs of the moment; scalability, the robot swarm should be able to work in different group sizes, from few individuals to thousands of them.
3. Main Characteristics
In order to understand what swarm robotics is, a definition taken from ahin  is given:
Swarm robotics is the study of how large number of relatively simple physically embodied agents can be designed such that a desired collective behaviour emerges from the local interactions among agents and between the agents and the environment.
This definition is complemented with a set of criteria in order to have a better understanding and be able to differentiate it from other multi-robot types of systems .(i)The robots of the swarm must be autonomous robots, able to sense and actuate in a real environment.(ii)The number of robots in the swarm must be large or at least the control rules allow it.(iii)Robots must be homogeneous. There can exist different types of robots in the swarm, but these groups must not be too many.(iv)The robots must be incapable or inefficient respect to the main task they have to solve, this is, they need to collaborate in order to succeed or to improve the performance.(v)Robots have only local communication and sensing capabilities. It ensures the coordination is distributed, so scalability becomes one of the properties of the system.
4. Swarm Robotics and Multi-Robotic Systems
In this section, we classify and characterise swarm robotics using the most known taxonomies and classifications in the multi-robotic systems’ literature. Dudek et al. define a taxonomy  in which different axes are used to characterise multi-robotic architectures using their properties. The taxonomy axes are summarised in Table 1, directly extracted from the author. Using this classification, properties are assigned to each one of the axes, for a generic swarm-robotic architecture, although these properties would depend on the concrete architecture. Collective Size is SIZE-INF, that is, number of robots , in opposition to SIZE-LIM, where the number of robots is small compared to the size of the task or environment. This expresses the scalability aimed in swarm-robotic systems. Communication Range is COM-NEAR, robots can only communicate with robots which are close enough. Communication Topology for a swarm system would be generally TOP-GRAPH, robots are linked in a general graph. Communication Bandwidth is BAND-MOTION, communication costs are of the same magnitude as the cost of moving the robot between locations. Collective Reconfigurability is generally ARR-COMM, this is, coordinated rearrangement with members that communicate; but it could also be ARR-DYN, dynamic arrangement, positions can change arbitrarily. Process Ability is PROC-TME, where computational model is a turing machine equivalent. Lastly, Collective Composition is CMP-HOM, meaning that robots are homogeneous.
Iocchi et al. present a taxonomy  structured in different levels. The first level is Cooperation, which includes a situation in which several robots perform a common task. Second level is Knowledge, which distinguishes whether robots know of the existence of other robots (Aware) or not (Unaware). Third level is Coordination, to differentiate the degree in which robots take into account the actions executed by other robots. According to the authors of the taxonomy this can be: Strongly Coordinated, Weakly Coordinated, or Not Coordinated. The last level is Organisation, which distinguishes between Centralised systems, where there exists a robot that is in charge of organising other robots’ work, and Distributed systems, where robots are autonomous in their decisions, that is, there are no leaders. According to this taxonomy, swarm-robotic systems are: Cooperative, Aware, Strongly Coordinated (they could also be Weakly Coordinated), and Distributed. A schematic of the taxonomy is shown in Figure 1, where for each level the corresponding type of system is marked in dark grey for a swarm-robotic system.
Cao et al. define a not so complete taxonomy . It differentiates among centralised and decentralised architectures. Decentralised can be distributed, if all robots are equal with respect to control; or hierarchical if there exists a local centralisation. It also identifies between homogeneous and heterogeneous individuals. Using this taxonomy swarm systems are: decentralised, distributed, and homogeneous.
Some of the characteristics of multi-robotic systems can be extrapolated to swarm-robotic systems. We borrow here from Ronald Arkin  a list of advantages and disadvantages of multi-robotic systems compared to single-robot systems. Advantages of multi-robotic approaches are the following.(i)Improved performance: if tasks can be decomposable then by using parallelism, groups can make tasks to be performed more efficiently.(ii)Task enablement: groups of robots can do certain tasks that are impossible for a single robot.(iii)Distributed sensing: the range of sensing of a group of robots is wider than the range of a single robot.(iv)Distributed action: a group a robots can actuate in different places at the same time.(v)Fault tolerance: under certain conditions, the failure of a single robot within a group does not imply that the given task cannot be accomplished, thanks to the redundancy of the system.
Drawbacks are the following.(i)Interference: robots in a group can interfere between them, due to collisions, occlusions, and so forth.(ii)Uncertainty concerning other robots’ intentions: coordination requires to know what other robots are doing. If this is not clear robots can compete instead of cooperate.(iii)Overall system cost: the fact of using more than one robot can make the economical cost bigger. This is ideally not the case of swarm-robotic systems, which intend to use many cheap and simple robots which total cost is under the cost of a more complex single robot carrying out the same task.
5. Experimental Platforms in Swarm Robotics
In this section, the different experimental platforms used in the most relevant swarm-robotic experiments found in literature are described, including robotic platforms and simulators.
5.1. Robotic Platforms
Several robotic platforms used in swarm-robotic experiments in different laboratories are summarised in Table 2. These platforms are the following.(i)Khepera robot , for research and educational purposes, developed by École Polytechnique Fédérale de Lausanne (EPFL, Switzerland), widely used in the past, nowadays has fallen in disuse;(ii)Khepera III robot (http://www.k-team.com/) , designed by K-Team together with EPFL;(iii)e-puck robot (http://www.e-puck.org/) , designed at EPFL for educational purposes; (iv)The miniature Alice robot  also developed at EPFL; (v)Jasmine robot (http://www.swarmrobot.org/) , developed under the I-swarm project; (vi)I-Swarm robot (http://www.i-swarm.org/) , very small, also developed by the I-swarm project; (vii)S-Bot (http://www.swarm-bots.org/) , very versatile, with many actuators, developed in the Swarm-bots project; (viii)Kobot (http://www.kovan.ceng.metu.edu.tr/) , designed by Middle East Technical University (Turkey);(ix)SwarmBot (http://www.irobot.com/) , designed by i-Robot company for research.
In Table 2, the column Relative Positioning System indicates if the robots possess the ability to determine the relative positions of their nearby robots. This sensor is quite useful and necessary in many swarm-robotic tasks. Some of them are based on the emission of an infrared signal by a robot and the estimate of the distance by its neighbours depending on the strength of the received signal [12, 20]. Others work by emitting an ultrasound pulse at the same time than a radio signal, and estimating the distance taking into account the time difference in the reception of both signals [21, 22]. There are also robots that use a camera to detect and estimate the position of nearby robots that are equipped with markers [23–25].
There exist many mobile robotic simulators available which can be used for multi-robotic experiments, and more concretely for swarm-robotic experiments. They differ not only in their technical aspects but also in the license and cost. We summarise them, along with comments on their use on swarm-robotic applications in the following paragraphs.
Player/Stage/Gazebo (http://playerstage.sourceforge.net/)  is an open source simulator with multi-robotic capabilities and a wide set of available robots and sensors ready to use. The use for swarm-robotic experiments is analysed for 2D simulations  with very good results. Runtime scales approximately linearly with population sizes up to at least 100,000 simple robots. It works on real time for 1000 robots running a simple program. It is a good solution for swarm robotic experiments.
Webots (http://www.cyberbotics.com/)  is a realistic, commercial mobile simulator that allows multi-robot simulation, with already built models of real robots. It is 3D, simulating physics and collisions. According to our experience, its performance when working with more than 100 robots decreases very fast, making the simulations with a large number of robots difficult.
Microsoft Robotics Studio  is a simulator developed by Microsoft Corporation. It allows multi-robotic simulation. It requires a Windows platform to run.
SwarmBot3D  is a simulator for multi-robotics but designed specifically for the S-Bot robot of the SwarmBot project.
6. Experimental Basic Behaviours and Tasks in Swarm Robotics
A collection of the most representative experimental works in Swarm Robotics is depicted in this section. The different experimental results are organised grouping them depending on the tasks or behaviours carried out by the swarms. Some of the behaviours, such as aggregation and collective movement, are quite basic and constitute a previous level for more complex tasks. They are presented in increasing order of complexity.
In order to perform other tasks, such as collective movement, self-assembly and pattern formation, or to exchange information, robots must initially gather. This aggregation problem has been studied from a swarm-robotic approach by several researchers.
Trianni et al.  perform experiments using an evolutionary algorithm on simulated S-Bot robots. The sensory inputs are the proximity sensors and the microphones. The actuators are the motors and the speakers. One of the evolved solutions is scalable. Bahçeci and Şahin  also use evolutionary algorithms and simulated S-bot robots, leading to scalable results, although their work is rather focused on evolutionary algorithms than on aggregation.
Soysal and ahin  use an algorithm based on a probabilistic finite state machine for aggregation. They develop a macroscopic model of it and compares it with simulation results. Dimarogonas and Kyriakopoulos  propose a distributed aggregation algorithm based on potential functions consisting on: a repulsive force for obstacle avoidance and a attractive force for aggregation. They analyse mathematically its convergence and carry out simulated experiments with nine robots. Lastly, Garnier et al.  implement a biological model based on cockroach aggregation on Alice robots.
The aim of dispersion is to distribute the robots in space to cover it as much area as possible, usually without losing the connectivity between them. The swarm can work, when dispersed, as a distributed sensor, but also as a means for exploration.
Dispersion has been studied by different researchers both using real robots and in simulation. Howard et al.  present a potential field algorithm for the deployment of robots, in which robots are repelled by obstacles and other robots. The approach is distributed and does not require centralised localisation, leading to a scalable solution. The work is conducted only in simulation.
In , the authors propose and test in simulation a distributed algorithm for dispersion based on the read wireless intensity signals and a potential field approach. According to them, and although robots do not have information about the bearing to neighbouring robots, the algorithm successfully disperses the robots. Ludwig and Gini  and Damer et al.  also only use the wireless intensity for dispersion of a swarm of robots. They use a more elaborated algorithm that takes into account a graph of the neighbouring robots and the received signal intensities. They reach successful results in more complicated environments than the proposed in . The fact that just wireless signal intensities are needed in these algorithms makes them quite attractive since they can be used with very simple robots not provided with relative positioning systems.
McLurkin and Smith  show the performance of a set of distributed algorithms for the dispersion of a large group of robots, where only inter-robot communications and sensing of other robots’ positions is used. The network connection of the swarm is maintained, creating a route to the initial positions where chargers were placed. The dispersion allows robots to explore large indoor environments. Experiments were run with up to 108 real SwamBots, showing the algorithm’s scalability.
In , a distributed algorithm for dispersing a set of robots in the environment at the same time that robots aggregate in areas of interest is presented and tested. Experiments done with 16 real SwarmBot robots show the success of the algorithm.
The coverage problem is related to dispersion. Robots need to disperse and detect the borders of the environment. Correll et al.  present a set of distributed and scalable algorithms for covering the boundaries of elements placed in a regular pattern. They show based on experimental results and using up to 30 Alice robots that coverage performance is improved with increasing number of robots.
6.3. Pattern Formation
Pattern formation is the problem of creating a global shape by changing the positions of the individual robots. Since we are here interested in a swarm-robotic approach, the explained examples will have just local information.
In , a swarm of particles form a lattice with both an internal and external defined shape. All the rules that make the particles/robots to aggregate in the desired formation are local, but a global external shape emerges, without having any global information. The algorithm uses virtual springs between neighbouring particles, taking into account how many neighbours they have.
Martinson and Payton  describe an algorithm that using a common reference orientation for the robots and local control laws acting in orthogonal axes creates square lattices.
Chaimowicz et al.  show an algorithm for placing robots in different shapes and patterns defined by implicit functions. Robots use a distributed approach based on local information to place themselves in the desired contour. Algorithms are tested both in simulation and with real robots.
In , a framework to assemble a swarm of robots given a morphology is shown. Using the robots’ capability of attaching they demonstrate how S-bot robots self-assemble forming global morphologies. The algorithm is completely distributed, and just local information is used.
6.4. Collective Movement
Collective movement is the problem of how to coordinate a group of robots and move them together as a group in a cohesive way . It can also serve as a basic behaviour for more complicate tasks. It can be classified into two types: formations and flocking. In the former, robots must maintain predetermined positions and orientations among them. On the other hand, in flocking, robots’ relative positions are not strictly enforced.
There exist many architectures for collective movement but only those allowing scalability with increasing number of robots are of interest here. In [47–49], the Physicomimetics Framework (PF), which allows to create a self-organised formation by using control laws inspired by physics, is presented and analysed. The controller is fully decentralised; each robot perceives the relative positions of its neighbours and reacts to attractive or repulsive forces, forming triangular lattices. The algorithm is scalable, working for dozens of robots.
Lee and Nak  propose a distributed algorithm for collective movement based on lattices. Its convergence is proved using Lyapunov’s theorem. In , a decentralised algorithm for the collective movement based on lattice formations is proposed. The stability of the algorithm in a particular case of study is proved. Obstacle avoidance is implemented by partitioning the plane into Voronoi regions.
Turgut et al.  propose and study a scalable and distributed algorithm for robot flocking. It is based on the heading alignment of the robots and the inter-robot distance control. The algorithm is tested in simulation with up to 1000 robots and with a small group of real robots.
6.5. Task Allocation
The problem of labour division is not a task as the previous ones, but a problem that can arise in multi-robotic systems and particularly in swarm robotics.
Jones and Matarić  present a distributed and scalable algorithm for labour division in swarms of robots. Each robot maintains a history of the activities performed by other robots based on observation, and independently performs a division of labour using this history. It then can modify its own behaviour to accommodate to this division.
In , authors propose two different methods for task allocation in a robotic swarm. Tasks are previously announced by certain robots and a number of them must attend to them simultaneously. The first algorithm is based on a gossip communication scheme, and it has better performance than the other, but due to limited robustness to packet loss it might be less scalable. The second is simple and reactive, based on interaction through light signals.
McLurkin and Yamins  describe four different algorithms for task allocation and test them using 25 SwarmBot real robots. The four of them result successful and scalable, although needing of different communication requirements.
In , a group of robots must solve a complex foraging task that is divided in a collection of subtasks. The authors propose and test with real robots a distributed algorithm based on a state machine that solves the main problem by self-assigning each robot a desired task.
6.6. Source Search
Swarm robotics can be very useful in search tasks, especially those in which the spatial pattern of the source can be complex as in the case of sound or odour. The odour localisation problem is studied in , where robots look for the odour source using a distributed algorithm. Experiments are conducted both in simulation and with real robots.
In , authors describe and test a distributed algorithm for localising stationary, time-invariant sources. They use feedback controls motivated by function minimisation theory. They explore two situations: one with global communications, in which robots are able to find the global maximum source; and a second one restricted to local communication, where local maxima are found. Experiments are run in simulation.
6.7. Collective Transport of Objects
Swarm robotics is very promising in solving the problem object transportation. The use of many robots can represent an advantage because of cooperation handling one object. In addition, the possible parallelism dealing with different objects by several robots at the same time might improve the performance.
Kube and Bonabeau  take as inspiration the ant collective transport of preys, where individuals wait for other mates if the transported object is too heavy. In their experiments, performed with real robots, a group of 6 robots is able to collectively push an object towards a destination in a purely distributed way.
Groß and Dorigo  solve the problem of transporting different objects by groups of S-Bot robots that self-assemble to cooperate. The algorithms were synthesised using an evolutionary algorithm. The experimental results in simulation show that the algorithm scales with heavier objects by using larger groups of robots (up to 16). But the performance does not scale with the group size, since the mass transported per robot decreases with the number of robots.
In , authors discuss and propose the collective transport of objects by collecting them and storing them for later transport. The robots of the swarm would have two different tasks: collecting the objects and placing them in a cart; and collectively move the cart carrying objects.
6.8. Collective Mapping
The problem of collective mapping has not yet been widely studied by the swarm-robotic community. In , a set of algorithms for the exploration and mapping of big indoor areas using large amounts of robots is described. In their experiments, they use up to 80 robots spread in a area. Nevertheless, the mapping is carried out by two groups of two robots that eventually exchange and merge their maps, so it cannot be considered swarm mapping.
Rothermich et al.  propose and test (in simulation and with real robots) a method for distributed mapping using a swarm of robots. Each robot can assume two roles: moving or landmark that are exchanged for the movement of the swarm. In addition, robots have a certain confidence in their localisation estimated position. Using this information, localisation estimates of other robots and sensor measurements they build a collective map.
7. Towards Real World Applications
In the first sections of this paper many interesting and promising properties of swarm robotics have been enlightened. Nevertheless, currently there exist no real commercial applications. The reasons for it are varied. ahin and Winfield  enumerate three of them as follows.
Algorithm Design. Swarm robotics must design both the physical robots and the behaviours of the individual robots, so the global collective behaviour emerges from their interactions. At the moment, no general method exists to go from the individuals to the group behaviour.
Implementation and Test. The use of many real robots needs of good laboratory infrastructure to be able to perform experiments.
Analysis and Modeling. Swarm-robotic systems are usually stochastic, nonlinear, so building mathematical models for validation and optimisation is hard. These models might be necessary for creating safety real world applications.
Winfield et al.  discuss the concept of swarm engineering, studying the dependability of swarm-robotic systems through a case of study. According to them, some of the future work needed from a dependability point of view is the following.(i)Mathematical modelling of swarm-robotic systems.(ii)Work on safety analysis at robot and swarm level.(iii)Develop an approach to the design of emergence.(iv)Develop methodologies and practises for the testing of swarm systems.
Higgins et al.  address the main security challenges that swarm-robotic systems should face in a future. They state that due to the simplicity of swarm-robotic architectures they have to deal with the following problems.(i)Physical capture of the robots.(ii)Identity and authentication, robot must know if it is interacting with a robot from its swarm or from an intruder robot.(iii)Communication attacks, communications can be intercepted or disturbed by an attacker.
The possible real applications of swarm robotics will take special importance when robots get to be mass produced and the costs of building swarms of robots decrease. This is the objective of I-swarm project  which aimed at building a swarm of micro robots. The development of technologies such as MEMS (Micro-Electro-Mechanical Systems) will allow to create small and cheap robots.
Swarm robots can perform tasks in which the main goal is to cover a wide region. The robots can disperse and perform monitoring tasks, for example, in forests, lakes, and so forth. It can be really useful for detecting hazardous events, like a leakage of a chemical substance. The main advantage over a sensor network is that the swarm can move and focus on the problem and even act to prevent the consequences of that problem.
In this way swarms of robots can be really useful for dangerous tasks. For example, for mining detection and cleaning. It can be more useful than a unique specialised robot, mainly because of the robustness of the swarm: if one robot fails and the mine explodes, the rest of the swarm continues working. In the case of a single robot this is not possible.
The number of possible applications is really promising, but still the technology must firstly be developed both in the algorithmic and modelling part, and also in the miniaturisation technologies.
An overview of swarm robotics has been given for a better understanding of this field of multi-robot research. The first sections have made an introduction to the topic, showing its main properties and characteristics and placing the field in relation to more general multi-robotic systems. The main tasks and experimental results in swarm robotics and the platforms used have been then summarised. Lastly, the future promising applications together with the problems to overcome in order to reach them have been explained and analysed.
- G. Beni, “From swarm intelligence to swarm robotics,” in Swarm Robotics Workshop: State-of-the-Art Survey, E. Şahin and W. Spears, Eds., no. 3342, pp. 1–9, Springer, Berlin, Germany, 2005.
- S. Garnier, J. Gautrais, and G. Theraulaz, “The biological principles of swarm intelligence,” Swarm Intelligence, vol. 1, no. 1, pp. 3–31, 2007.
- O. Holland and C. Melhuish, “Stigmergy, self-organization, and sorting in collective robotics,” Artificial Life, vol. 5, no. 2, pp. 173–202, 1999.
- S. Franklin, “Coordination without communication,” 2010, http://www.msci.memphis.edu/~franklin/coord.html.
- E. Bonabeau, M. Dorigo, and G. Theraulaz, Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, New York, NY, USA, 1999.
- L. Iocchi, D. Nardi, and M. Salerno, “Reactivity and deliberation: a survey on multi-robot systems,” in Balancing Reactivity and Social Deliberation in Multi-Agent Systems. From RoboCup to Real-World Applications, pp. 9–32, Springer, Berlin, Germany, 2001.
- E. Şahin, “Swarm robotics: from sources of inspiration to domains of application,” in Swarm Robotics Workshop: State-of-the-Art Survey, E Şahin and W. Spears, Eds., Lecture Notes in Computer Science, no. 3342, pp. 10–20, Berlin, Germany, 2005.
- G. Dudek, M. R. M. Jenkin, E. Milios, and D. Wilkes, “A taxonomy for multi-agent robotics,” Autonomous Robots, vol. 3, no. 4, pp. 375–397, 1996.
- Y. U. Cao, A. S. Fukunaga, and A. B. Kahng, “Cooperative mobile robotics: antecedents and directions,” Autonomous Robots, vol. 4, no. 1, pp. 226–234, 1997.
- C. Ronald Arkin, Behavior-Based Robotics, MIT Press, Cambridge, Mass, USA, 1998.
- F. Mondada, E. Franzi, and A. Guignard, “The development of Khepera,” in Proceedings of the 1st International Khepera Workshop, vol. 64 of HNI-Verlagsschriftenreihe, Heinz Nixdorf Institut, pp. 7–14, 1999.
- J. Pugh, X. Raemy, C. Favre, R. Falconi, and A. Martinoli, “A fast onboard relative positioning module for multirobot systems,” IEEE/ASME Transactions on Mechatronics, vol. 14, no. 2, pp. 151–162, 2009.
- F. Mondada, M. Bonani, and X. Raemy, “The e-puck, a robot designed for education in engineering,” in Proceedings of the 9th Conference on Autonomous Robot Systems and Competitions, vol. 1, pp. 59–65, 2009.
- G. Caprari and R. Siegwart, “Mobile micro-robots ready to use: alice,” in Proceedings of the IEEE IRS/RSJ International Conference on Intelligent Robots and Systems (IROS '05), pp. 3845–3850, Edmonton, Canada, August 2005.
- S. Kornienko, O. Kornienko, and P. Levi, “Minimalistic approach towards communication and perception in microrobotic swarms,” in Proceedings of the IEEE IRS/RSJ International Conference on Intelligent Robots and Systems (IROS '05), pp. 2228–2234, August 2005.
- P. Valdastri, P. Corradi, A. Menciassi et al., “Micromanipulation, communication and swarm intelligence issues in a swarm microrobotic platform,” Robotics and Autonomous Systems, vol. 54, no. 10, pp. 789–804, 2006.
- F. Mondada, L. M. Gambardella, D. Floreano, S. Nolfi, J.-L. Deneubourg, and M. Dorigo, “The cooperation of swarm-bots: physical interactions in collective robotics,” IEEE Robotics and Automation Magazine, vol. 12, no. 2, pp. 21–28, 2005.
- A. E. Turgut, F. Gökçe, H. C. Çelikkanat, L. Bayindir, and E. Şahin, “Kobot: a mobile robot designed speci cally for swarm robotics research,” Tech. Rep., KOVAN Research Lab, Department of Computer Engineering, Middle East Technical University, 2007.
- J. McLurkin, Stupid robot tricks: a behavior-based distributed algorithm library for programming swarms of robots [M.S. thesis], Massachusetts Institute of Technology, 2004.
- Á. Gutiérrez, A. Campo, M. Dorigo, D. Amor, L. Magdalena, and F. Monasterio-Huelin, “An open localization and local communication embodied sensor,” Sensors, vol. 8, no. 11, pp. 7545–7568, 2008.
- W. M. Spears, J. C. Hamann, P. M. Maxim et al., “Where are you?” Lecture Notes in Computer Science, vol. 4433, pp. 129–143, 2007.
- L. E. Navarro-Serment, C. J. J. Paredis, and P. K. Khosla, “A beacon system for the localization of distributed robotic teams,” in Proceedings of the International Conference on Field and Service Robots, pp. 232–237, Pittsburgh, Pa, USA, September 1999.
- S. Nouyan, A. Campo, and M. Dorigo, “Path formation in a robot swarm: self-organized strategies to find your way home,” Swarm Intelligence, vol. 2, no. 1, pp. 1–23, 2008.
- L. E. Parker, B. Kannan, X. Fu, and Y. Tang, “Heterogeneous mobile sensor net deployment using robot herding and line-of-sight formations,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2488–2493, October 2003.
- A. K. Das, R. Fierro, V. Kumar, J. P. Ostrowski, J. Spletzer, and C. J. Taylor, “A vision-based formation control framework,” IEEE Transactions on Robotics and Automation, vol. 18, no. 5, pp. 813–825, 2002.
- B. P. Gerkey, R. T. Vaughan, and A. Howard, “The player/stage project: Tools for multirobot and distributed sensor systems,” in Proceedings of the International Conference on Advanced Robotics, pp. 317–323, Coimbra, Portugal, July 2003.
- R. Vaughan, “Massively multi-robot simulation in stage,” Swarm Intelligence, vol. 2, no. 2-4, pp. 189–208, 2008.
- O. Michel, “Webots: professional mobile robot simulation,” Journal of Advanced Robotics Systems, vol. 1, no. 1, pp. 39–42, 2004.
- J. Jackson, “Microsoft robotics studio: a technical introduction,” IEEE Robotics and Automation Magazine, vol. 14, no. 4, pp. 82–87, 2007.
- V. Trianni, R. Groß, T. H. Labella, E. Şahin, and M. Dorigo, “Evolving aggregation behaviors in a swarm of robots,” in Proceedings of the 7th European Conference on Artificial Life (ECAL '03), W. Banzhaf, T. Christaller, P. Dittrich, J. T. Kim, and J. Ziegler, Eds., vol. 2801 of Lecture Notes in Artificial Intelligence, pp. 865–874, Springer, Heidelberg, Germany, 2003.
- E. Bahçeci and E. Şahin, “Evolving aggregation behaviors for swarm robotic systems: a systematic case study,” in Proceedings of the IEEE Swarm Intelligence Symposium, pp. 333–340, June 2005.
- O. Soysal and E. Şahin, “A macroscopic model for self-organized aggregation in swarm robotic systems,” Lecture Notes in Computer Science, vol. 4433, pp. 27–42, 2007.
- D. V. Dimarogonas and K. J. Kyriakopoulos, “Connectedness preserving distributed swarm aggregation for multiple kinematic robots,” IEEE Transactions on Robotics, vol. 24, no. 5, pp. 1213–1223, 2008.
- S. Garnier, C. Jost, R. Jeanson et al., “Aggregation behaviour as a source of collective decision in a group of cockroach-like-robots,” Lecture Notes in Computer Science, vol. 3630, pp. 169–178, 2005.
- A. Howard, J. Maja Mataric, and S. Gaurav Sukhatme, “Mobile sensor network deployment using potential elds: a distributed, scalable solution to the area coverage problem,” in Proceedings of the 6th International Symposium on Distributed Autonomous Robotics Systems (DARS02), Fukuoka, Japan, June 2002.
- E. Ugur, A. E. Turgut, and E. Şahin, “Dispersion of a swarm of robots based on realistic wireless intensity signals,” in Proceedings of the 22nd International Symposium on Computer and Information Sciences, pp. 1–6, November 2007.
- L. Ludwig and M. Gini, “Robotic swarm dispersion using wireless intensity signals,” in Distributed Autonomous Robotic Systems, vol. 7, pp. 135–144, Springer, Tokyo, Japan, 2007.
- S. Damer, L. Ludwig, M. A. Lapoint, M. Gini, N. Papanikolopoulos, and J. Budenske, “Dispersion and exploration algorithms for robots in unknown environments,” in Proceedings of the Unmanned Systems Technology VIII, vol. 6230, no. 1, April 2006.
- J. McLurkin and J. Smith, “Distributed algorithms for dispersion in indoor environments using a swarm of autonomous mobile robots,” in Distributed Autonomous Robotic System, vol. 6, pp. 399–408, Springer, Tokyo, Japan, 2007.
- M. Schwager, J. McLurkin, J. J. E. Slotine, and D. Rus, “From theory to practice: distributed coverage control experiments with groups of robots,” in Proceedings of International Symposium on Experimental Robotics, Athens, Greece, July 2008.
- N. Correll, S. Rutishauser, and A. Martinoli, “Comparing coordination schemes for miniature robotic swarms: a case study in boundary coverage of regular structures,” in Proceedings of the 10th International Symposium on Experimental Robotics (ISER '08), Springer, 2006.
- K. Fujibayashi, S. Murata, K. Sugawara, and M. Yamamura, “Self-organizing formation algorithm for active elements,” in Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS '02), pp. 416–421, IEEE Computer Society, Washington, DC, USA, October 2002.
- E. Martinson and D. Payton, “Lattice formation in mobile autonomous sensor arrays,” in Proceedings of the Swarm Robotics Workshop: State-of-the-art Survey, E. Şahin and W. Spears, Eds., no. 3342, pp. 98–111, Berlin, Germany, 2005.
- L. Chaimowicz, N. Michael, and V. Kumar, “Controlling swarms of robots using interpolated implicit functions,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA '05), pp. 2487–2492, April 2005.
- A. L. Christensen, R. O'Grady, and M. Dorigo, “Morphology control in a multirobot system,” IEEE Robotics and Automation Magazine, vol. 14, no. 4, pp. 18–25, 2007.
- I. Navarro and F. Matía, “A survey of collective movement of mobile robots,” Tech. Rep., Universidad Polit ecnica de Madrid, 2010.
- W. M. Spears, D. F. Spears, and R. Heil, “A formal analysis of potential energy in a multi-agent system,” in Proceedings of the 3rd International Workshop on Formal Approaches to Agent-Based Systems (FAABS '04), pp. 131–145, April 2004.
- W. M. Spears, D. F. Spears, J. C. Hamann, and R. Heil, “Distributed, physics-based control of swarms of vehicles,” Autonomous Robots, vol. 17, no. 2-3, pp. 137–162, 2004.
- W. M. Spears, D. F. Spears, R. Heil, W. Kerr, and S. Hettiarachchi, “An overview of physicomimetics,” in Swarm Robotics Workshop: State-of-the-Art Survey, E. Şahin and W. Spears, Eds., vol. 3342, no. 3342, pp. 84–97, Springer, Berlin, Germany, 2005.
- G. Lee and Y. C. Nak, “Self-configurable mobile robot swarms with hole repair capability,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '08), pp. 1403–1408, September 2008.
- M. Lindhé and K. H. Johansson, “A formation control algorithm using voronoi regions,” in CTS-HYCON Workshop on Nonlinear and Hybrid Control, 2005.
- A. E. Turgut, H. Çelikkanat, F. Gökçe, and E. Şahin, “Self-organized flocking in mobile robot swarms,” Swarm Intelligence, vol. 2, no. 2–4, pp. 97–120, 2008.
- C. Jones and M. J. Matarić, “Adaptive division of labor in large-scale minimalist multi-robot systems,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1969–1974, Las Vegas, Nev, USA, October 2003.
- F. Ducatelle, A. Foerster, G. A. Di Caro, and L. M. Gambardella, “New task allocation methods for robotic swarms,” in Proceedings of the 9th IEEE/RAS Conference on Autonomous Robot Systems and Competitions, Castelo Branco, Portugal, May 2009.
- J. McLurkin and D. Yamins, “Dynamic task assignment in robot swarms,” in Proceedings of Robotics: Science and Systems, Cambridge, Mass, USA, June 2005.
- R. Groß, S. Nouyan, M. Bonani, F. Mondada, and M. Dorigo, “Division of labour in selforganised groups,” in Proceedings of the 10th International Conference on Simulation of Adaptive Behavior (SAB '08), vol. 5040 of Lecture Notes in Computer Science, pp. 426–436, Berlin, Germany, 2008.
- A. T. Hayes, A. Martinoli, and R. M. Goodman, “Swarm robotic odor localization: off-line optimization and validation with real robots,” Robotica, vol. 21, no. 4, pp. 427–441, 2003.
- J. E. Hurtado, R. D. Robinett, C. R. Dohrmann, and S. Y. Goldsmith, “Decentralized control for a swarm of vehicles performing source localization,” Journal of Intelligent and Robotic Systems, vol. 41, no. 1, pp. 1–18, 2004.
- C. R. Kube and E. Bonabeau, “Cooperative transport by ants and robots,” Robotics and Autonomous Systems, vol. 30, no. 1, pp. 85–101, 2000.
- R. Groß and M. Dorigo, “Towards group transport by swarms of robots,” International Journal of Bio-Inspired Computation, vol. 1, no. 1-2, pp. 1–13, 2009.
- A. Decugnière, B. Poulain, A. Campo et al., “Enhancing the cooperative transport of multiple objects,” in Proceedings of the Sixth International Conference on Ant Colony Optimization and Swarm Intelligence (ANTS '08), vol. 5217 of Lecture Notes in Computer Science, pp. 307–314, Springer, September 2008.
- A. Howard, L. E. Parker, and G. S. Sukhatme, “The SDR experience: experiments with a large-scale heterogeneous mobile robot team,” in Proceedings of the th International Symposium on Experimental Robotics, pp. 121–130, Singapore, June 2004.
- J. A. Rothermich, M. I. Ecemiş, and P. Gaudiano, “Distributed localization and mapping with a robotic swarm,” E. Şahin and W. Spears, Eds., vol. 3342 of Lecture Notes in Computer Science, pp. 58–69, Springer, Berlin, Germany.
- E. Şahin and A. Winfield, “Special issue on swarm robotics,” Swarm Intelligence, vol. 2, no. 2–4, pp. 69–72, 2008.
- A. Winfield, C. Harper, and J. Nembrini, “Towards dependable swarms and a new discipline of swarm engineering,” in Swarm Robotics Workshop: State-of-the-Art Survey, E. Şahin and W. Spears, Eds., vol. 3342, pp. 126–142, Berlin, Germany, 2005.
- F. Higgins, A. Tomlinson, and K. M. Martin, “Survey on security challenges for swarm robotics,” in Proceedings of the 5th International Conference on Autonomic and Autonomous Systems (ICAS '09), pp. 307–312, IEEE Computer Society, Los Alamitos, CA, USA, April 2009.
- J. Seyfried, M. Szymanski, N. Bender, R. Estana, M. Thiel, and H. Worn, “The i-swarm project: intelligent small world autonomous robots for micro-manipulation,” in Swarm Robotics Workshop: State-of-the-Art Survey, E. Şahin and W. Spears, Eds., vol. 3342, pp. 70–83, Springer, Berlin, Germany, 2005.