Graph-Based Distributed Control for Adaptive Multi-Robot Patrolling through Local Formation Transformation

Multi-robot cooperative navigation in real-world environments is essential in many applications, including surveillance and search-and-rescue missions. State-of-the-art methods for cooperative navigation are often tested in ideal laboratory conditions and not ready to be deployed in real- world environments, which are often cluttered with static and dynamic obstacles. In this work, we explore a graph-based framework to achieve control of real robot formations moving in a world cluttered with a variety of obstacles by introducing a new distributed algorithm for reconfiguring the formation shape. We systematically validate the reconfiguration algorithm using three real robots in scenarios of increasing complexity.

Evolutionary Robotics. The Biology, Intelligence, and Technology of Self-organizing Machines

Dario Floreano

Evolutionary robotics is a new technique for the automatic creation of autonomous robots. Inspired by the Darwinian principle of selective reproduction of the fittest, it views robots as autonomous artificial organisms that develop their own skills in close interaction with the environment and without human intervention. Drawing heavily on biology and ethology, it uses the tools of neural networks, genetic algorithms, dynamic systems, and biomorphic engineering. The resulting robots share with simple biological systems the characteristics of robustness, simplicity, small size, flexibility, and modularity. In evolutionary robotics, an initial population of artificial chromosomes, each encoding the control system of a robot, is randomly created and put into the environment. Each robot is then free to act (move, look around, manipulate) according to its genetically specified controller while its performance on various tasks is automatically evaluated. The fittest robots then "reproduce" by swapping parts of their genetic material with small random mutations. The process is repeated until the "birth" of a robot that satisfies the performance criteria. This book describes the basic concepts and methodologies of evolutionary robotics and the results achieved so far. An important feature is the clear presentation of a set of empirical experiments of increasing complexity. Software with a graphic interface, freely available on a Web page, will allow the reader to replicate and vary (in simulation and on real robots) most of the experiments.

MIT Press2001

Synthesis, modeling, and experimental validation of distributed robotic search

James Pugh

The work of this thesis centers around the research subject of distributed robotic search. Within the field of distributed robotic systems, a task of particular interest is attempting to locate one or more targets in a possibly unknown environment. While numerous studies have proposed and analyzed methods to accomplish this, there is currently a lack of a strong foundation of tools and techniques that can be used to facilitate the development and evaluation of different approaches to distributed robotic search. In this work, we aim to provide such a foundation through tools, methods, models, and analysis of experimentation. An often overlooked aspect of the distributed robotic research process is the development and analysis of tools and modules to be used with robotic systems. These may include plug-ins for realistic robotic simulators, software/hardware systems to track multiple mobile robots in real-time, extension boards for robotic platforms, and the robots themselves. Along with other tools developed and used for this work, we focus particularly on the development, characterization, and validation of a fast, accurate on-board system for relative positioning and communication between robots, a capability which is critical for effective distributed robotic search. Designing individual robot controllers to generate a specific group behavior is a difficult and often counter-intuitive process. A possible alternative to hand-crafting distributed search controllers is automatic synthesis using machine-learning techniques. We explore the effectiveness of using a noise-resistant version of the Particle Swarm Optimization algorithm to optimize the weights of an embedded Artificial Neural Network, allowing the robot to learn obstacle avoidance behavior (a common benchmark for robotic learning techniques); we find that this technique appears to offer superior performance as compared to the canonical approach of using Genetic Algorithms for this type of learning. A method for faster learning using distributed evaluation in a robot team is tested and is found to offer comparable performance using only a fraction of the original learning time. This technique can be used for fast, effective learning and adaptation in a distributed robotic system performing search. The process of designing and analyzing algorithms for distributed robotic systems can be greatly facilitated if models are available to describe the dynamics of the algorithm at an abstract level. Inspired by previous examples in the distributed robotic field, we work to design a model of robotic search that captures the system at different levels of abstraction, ranging from accurately recreating the details of individual robots to describing the entire system as an indivisible whole. To capture the entire search process, we model both the exploration phase, where robots cover an environment in an effort to detect traces of targets, and the localization phase, where robots use target emission sensing to navigate towards the target. The utility of our models is demonstrated by using them to develop an effective technique for the declaration phase of search, where robots decide that a target has been accurately localized and announce its position. In distributed robotics research, it is important that techniques developed with abstracted simulations and models are ultimately validated using real robotic platforms in order to verify their correctness. In that spirit, we run systematic sound search experiments using teams of up to ten real robots. These experiments utilize the tools developed throughout the research process, demonstrate the utility of our learning technique for fast search adaptation, and serve to validate our models of distributed robotic localization. In addition, they allow us to analyze and better understand the subtle dynamics of the search process, providing information which should be useful for any future work on distributed robotic search.

EPFL2008

Bio-inspired and probabilistic algorithms for distributed odor source localization using mobile robots

Thomas Lochmatter

We compare six different algorithms for localizing odor sources with mobile robots. Three algorithms are bio-inspired and mimic the behavior of insects when exposed to airborne pheromones. Two algorithms are based on probability and information theory, and infer the source location by probabilistically merging concentration measurements at different positions in the environment. The last algorithm is a multi-robot algorithm based on a crosswind line formation. The algorithms are mainly compared with respect to their distance overhead – a metric directly related to the speed of an algorithm – and their success rate. The thesis also reports on the influence of various environmental and algorithmic parameters, and compares the algorithms' requirements regarding sensors, self-localization, maps, and other information. Systematic experiments under laminar flow conditions were carried out with real robots in an 18m long wind tunnel. The robots were thereby equipped with an ethanol sensor and a wind direction sensor, and could – if the algorithm required it – access their current position. Overall, more than 500 experimental runs with teams of up to 5 robots were carried out in this wind tunnel. Similar experiments were also carried out in simulation. Over 5000 runs were carried out in a realistically calibrated multi-robot simulator. Odor was thereby simulated as set of filaments that are transported by advection, an approach that generates the intermittence and stochasticity of real plumes. Additional, more than 10000 runs were carried out using body-less simulators under various plume models. Simulation runs were mostly used to quantify the influence of various parameters on the performance of the algorithms. Finally, the thesis also provides theoretical insights into the bio-inspired algorithms, and a general theoretical model for probabilistic odor source localization. For the latter, a number of potential real-world scenarios are discussed on the example of a simplified train station environment. None of the algorithms is strictly superior to all other algorithms. While the probabilistic algorithms offer more flexibility and a slightly better performance, the bio-inspired algorithms are much less CPU and memory intensive, and could therefore be deployed on extremely small and limited robotic platforms. Using multiple robots (with or without collaboration) for odor source localization was found to improve the performance under certain conditions only. The crosswind formation algorithm with 3 robots yielded excellent results, but the multi-robot experiments with the bio-inspired algorithms were hardly better than their single-robot counterparts. The thesis provides reasons for this, and discusses alternatives.