Spelling suggestions: "subject:"swarm"" "subject:"awarm""
11 |
Division of Labour in Groups of RobotsLabella, Thomas Halva 09 February 2007 (has links)
In this thesis, we examine algorithms for the division of labour in a group of robot. The algorithms make no use of direct communication. Instead, they are based only on the interactions among the robots and between the group and the environment.
Division of labour is the mechanism that decides how many robots shall be used to perform a task. The efficiency of the group of robots depends in fact on the number of robots involved in a task. If too few robots are used to achieve a task, they might not be successful or might perform poorly. If too many robots are used, it might be a waste of resources. The number of robots to use might be decided a priori by the system designer. More interestingly, the group of robots might autonomously select how many and which robots to use. In this thesis, we study algorithms of the latter type.
The robotic literature offers already some solutions, but most of them use a form of direct communication between agents. Direct, or explicit, communication between the robots is usually considered a necessary condition for co-ordination. Recent studies have questioned this assumption. The claim is based on observations of animal colonies, e.g., ants and termites. They can effectively co-operate without directly communicating, but using indirect forms of communication like stigmergy. Because they do not rely on communication, such colonies show robust behaviours at group level, a condition that one wishes also for groups of robots. Algorithms for robot co-ordination without direct communication have been proposed in the last few years. They are interesting not only because they are a stimulating intellectual challenge, but also because they address a situation that might likely occur when using robots for real-world out-door applications. Unfortunately, they are still poorly studied.
This thesis helps the understanding and the development of such algorithms. We start from a specific case to learn its characteristics. Then we improve our understandings through comparisons with other solutions, and finally we port everything into another domain.
We first study an algorithm for division of labour that was inspired by ants' foraging. We test the algorithm in an application similar to ants' foraging: prey retrieval. We prove that the model used for ants' foraging can be effective also in real conditions. Our analysis allows us to understand the underlying mechanisms of the division of labour and to define some way of measuring it.
Using this knowledge, we continue by comparing the ant-inspired algorithm with similar solutions that can be found in the literature and by assessing their differences. In performing these comparisons, we take care of using a formal methodology that allows us to spare resources. Namely, we use concepts of experiment design to reduce the number of experiments with real robots, without losing significance in the results.
Finally, we apply and port what we previously learnt into another application: Sensor/Actor Networks (SANETs). We develop an architecture for division of labour that is based on the same mechanisms as the ants' foraging model. Although the individuals in the SANET can communicate, the communication channel might be overloaded. Therefore, the agents of a SANET shall be able to co-ordinate without accessing the communication channel.
|
12 |
Decentralized Approach to SLAM using Computationally Limited RobotsSudheer Menon, Vishnu 25 May 2017 (has links)
Simultaneous localization and mapping (SLAM) is a challenging and vital problem in robotics. It is important in tasks such as disaster response, deep-sea and cave exploration, in which robots must construct a map of an unknown terrain, and at the same time localize themselves within the map. The issue with single- robot SLAM is the relatively high rate of failure in a realistic application, as well as the time and energy cost. In this work, we propose a new approach to decentralized multi-robot SLAM which uses a robot swarm to map the environment. This system is capable of mapping an environment without human assistance and without the need for any additional infrastructure. We assume that 1) no robot possesses sufficient memory to store the entire map of the environment, 2) the communication range of the robots is limited, and 3)there is no infrastructure present in the environment to assist the robot in communicating with others. To cope with these limitations, the swarm system is designed to work as an independent entity. The swarm can deploy new robots towards the region that is yet to be explored, coordinate the communication between the robots by using itself as the communication network and replace any malfunctioning robots. The proposed method proves to be a reliable and robust exploration algorithm. It is shown to be a self-growing mapping network that is able to coordinate among numerous robots and replace any broken robots hence reducing the chance of system failure.
|
13 |
Decentralized Approach to SLAM using Computationally Limited RobotsSudheer Menon, Vishnu 25 May 2017 (has links)
Simultaneous localization and mapping (SLAM) is a challenging and vital problem in robotics. It is important in tasks such as disaster response, deep-sea and cave exploration, in which robots must construct a map of an unknown terrain, and at the same time localize themselves within the map. The issue with single- robot SLAM is the relatively high rate of failure in a realistic application, as well as the time and energy cost. In this work, we propose a new approach to decentralized multi-robot SLAM which uses a robot swarm to map the environment. This system is capable of mapping an environment without human assistance and without the need for any additional infrastructure. We assume that 1) no robot possesses sufficient memory to store the entire map of the environment, 2) the communication range of the robots is limited, and 3)there is no infrastructure present in the environment to assist the robot in communicating with others. To cope with these limitations, the swarm system is designed to work as an independent entity. The swarm can deploy new robots towards the region that is yet to be explored, coordinate the communication between the robots by using itself as the communication network and replace any malfunctioning robots. The proposed method proves to be a reliable and robust exploration algorithm. It is shown to be a self-growing mapping network that is able to coordinate among numerous robots and replace any broken robots hence reducing the chance of system failure.
|
14 |
Morphologically Responsive Self-Assembling RobotsO'Grady, Rehan 07 October 2010 (has links)
We investigate the use of self-assembly in a robotic system as a means of responding
to dierent environmental contingencies. Self-assembly is the mechanism through which
agents in a multi-robot system autonomously form connections with one another to create
larger composite robotic entities. Initially, we consider a simple response mechanism
that uses stochastic self-assembly without any explicit control over the resulting morphology
| the robots self-assemble into a larger, randomly shaped composite entity if the
task they encounter is beyond the physical capabilities of a single robot. We present distributed
behavioural control that enables a group of robots to make this collective decision
about when and if to self-assemble in the context of a hill crossing task. In a series of
real-world experiments, we analyse the eect of dierent distributed timing and decision
strategies on system performance. Outside of a task execution context, we present fully
decentralised behavioural control capable of creating periodically repeating global morphologies.
We then show how arbitrary morphologies can be generated by abstracting our
behavioural control into a morphology control language and adding symbolic communication
between connected agents. Finally, we integrate our earlier distributed response
mechanism into the morphology control language. We run simulated and real-world experiments
to demonstrate a self-assembling robotic system that can respond to varying
environmental contingencies by forming dierent appropriate morphologies.
|
15 |
On the Design of Self-Organized Decision Making in Robot SwarmsCampo, Alexandre 24 May 2011 (has links)
In swarm robotics, the control of a group of robots is often fully distributed and does not rely on any leader. In this thesis, we are interested in understanding how to design collective decision making processes in such groups. Our approach consists in taking inspiration from nature, and especially from self organization in social insects, in order to produce effective collective behaviors in robot swarms. We have devised four robotics experiments that allow us to study multiple facets of collective decision making. The problems on which we focus include cooperative transport of objects, robot localization, resource selection, and resource discrimination.
We study how information is transferred inside the groups, how collective decisions arise, and through which particular interactions. Important properties of the groups such as scalability, robustness, and adaptivity are also investigated. We show that collective decisions in robot swarms can effectively arise thanks to simple mechanisms of imitation and amplification. We experimentally demonstrate their implementation with direct or indirect information transfer, and with robots that can distinguish the available options partially or not at all.
|
16 |
Using swarm intelligence for distributed job scheduling on the gridMoallem, Azin 16 April 2009
With the rapid growth of data and computational needs, distributed systems and computational Grids are gaining more and more attention. Grids are playing an important and growing role in today networks. The huge amount of computations a Grid can fulfill in a specificc time cannot be done by the best super computers. However, Grid performance can still be improved by making sure all the resources available in the Grid are utilized by a good load balancing algorithm. The purpose of such algorithms is to make sure all nodes are equally involved in Grid computations. This research proposes two new distributed swarm intelligence inspired load balancing algorithms. One is based on ant colony optimization and is called AntZ, the other one is based on particle swarm optimization and is called ParticleZ. Distributed load balancing does not incorporate a single point of failure in the system. In the AntZ algorithm, an ant is invoked in response to submitting a job to the Grid and this ant surfs the network to find the best resource to deliver the job to. In the ParticleZ algorithm, each node plays a role as a particle and moves toward
other particles by sharing its workload among them. We will be simulating our proposed approaches using a Grid simulation toolkit (GridSim) dedicated to Grid simulations. The
performance of the algorithms will be evaluated using several performance criteria (e.g.
makespan and load balancing level). A comparison of our proposed approaches with a classical approach called State Broadcast Algorithm and two random approaches will also be provided. Experimental results show the proposed algorithms (AntZ and ParticleZ) can perform very well in a Grid environment. In particular, the use of particle swarm optimization, which has not been addressed in the literature, can yield better performance results in many scenarios than the ant colony approach.
|
17 |
Using swarm intelligence for distributed job scheduling on the gridMoallem, Azin 16 April 2009 (has links)
With the rapid growth of data and computational needs, distributed systems and computational Grids are gaining more and more attention. Grids are playing an important and growing role in today networks. The huge amount of computations a Grid can fulfill in a specificc time cannot be done by the best super computers. However, Grid performance can still be improved by making sure all the resources available in the Grid are utilized by a good load balancing algorithm. The purpose of such algorithms is to make sure all nodes are equally involved in Grid computations. This research proposes two new distributed swarm intelligence inspired load balancing algorithms. One is based on ant colony optimization and is called AntZ, the other one is based on particle swarm optimization and is called ParticleZ. Distributed load balancing does not incorporate a single point of failure in the system. In the AntZ algorithm, an ant is invoked in response to submitting a job to the Grid and this ant surfs the network to find the best resource to deliver the job to. In the ParticleZ algorithm, each node plays a role as a particle and moves toward
other particles by sharing its workload among them. We will be simulating our proposed approaches using a Grid simulation toolkit (GridSim) dedicated to Grid simulations. The
performance of the algorithms will be evaluated using several performance criteria (e.g.
makespan and load balancing level). A comparison of our proposed approaches with a classical approach called State Broadcast Algorithm and two random approaches will also be provided. Experimental results show the proposed algorithms (AntZ and ParticleZ) can perform very well in a Grid environment. In particular, the use of particle swarm optimization, which has not been addressed in the literature, can yield better performance results in many scenarios than the ant colony approach.
|
18 |
Leader-Follower Approach with an On-board Localization Scheme for Underwater Swarm ApplicationsToonsi, Sarah 08 1900 (has links)
A striking feature of swarm robotics is its ability to solve complex tasks through simple local interactions between robots. Those interactions require a good infrastructure in communication and localization. However, in underwater environments, the severe attenuation of radio waves complicates communication and localization of different vehicles. Existing literature on underwater swarms use centralized network topology which require physical vicinity to the central node to ensure reliability. We are interested in building a decentralized underwater swarm with a decentralized network topology that only requires neighbour communication and self-localization. We develop a simple leader-follower interaction rule where the follower estimates the leader's position and acts upon that estimation. The leader shines a 450 nm diffracted blue laser that the follower uses to continuously align its light sensors to the light source. Furthermore, the leader's laser can be modulated for explicit communication purposes. The proposed leader-follower approach produces satisfactory results in surge and sway axes, however, it is not robust against illumination changes in the environment. We then proceed to solve the self-localization problem, by fusing Inertial Measurement Unit (IMU) values with the thrust to estimate a robot’s position. In an Ardusub Simulation in the loop (SITL), the particle filter showed a slightly better performance than the Extended Kalman Filter (EKF) in the surge axis. However, both filters are prone to drifting after a while. We have observed that IMU values need to be filtered properly or another reliable sensor must be used alternatively.
|
19 |
Self-organized Construction of Spatial Structures by Swarms of Autonomous Mobile AgentsLeung Sem Tsuen, Henri Gerard 02 September 2003 (has links)
No description available.
|
20 |
A Stochastic, Swarm-Based Control Law for Emergent System-Level Area Coverage byRobotsSchroeder, Adam January 2016 (has links)
No description available.
|
Page generated in 0.0391 seconds