Adaptive Lévy Taxis for Odor Source Localization in Realistic Environmental Conditions

Odor source localization with mobile robots has recently been subject to many research works, but remains a challenging task mainly due to the large number of environmental parameters that make it hard to describe gas concentration fields. We designed a new algorithm called Adaptive Lévy Taxis (ALT) to achieve odor plume tracking through a correlated random walk. In order to compare its performances with well-established solutions, we have implemented three moth-inspired algorithms on the same robotic platform. To improve the performance of the latter algorithms, we developed a rigorous way to determine one of their key parameters, the odor concentration threshold at which the robot considers to be inside or outside the plume. The methods have been systematically evaluated in a large wind tunnel under various environmental conditions. Experiments revealed that the performance of ALT is consistently good in all environmental conditions (in particular when compared to the three reference algorithms) in terms of both distance traveled to find the source and success rate.

Comparing Coordination Schemes for Miniature Robotic Swarms: A Case Study in Boundary Coverage of Regular Structures

Nicolaus Correll, Alcherio Martinoli, Samuel Rutishauser

We consider boundary coverage of a regular structure by a swarm of miniature robots, and compare a suite of three fully distributed coordination algorithms experimentally. All algorithms rely on boundary coverage by reactive control, whereas coordination of the robots high-level behavior is fundamentally different: random, self-organized, and deliberative with reactive elements. The self-organized coordination algorithm was designed using macroscopic probabilistic models that lead to analytical expressions for the algorithm's mean performance. We contrast this approach with a provably complete, near optimal coverage algorithm, which is due to its assumption (noise-less sensors and actuators) infeasible on a real miniature robotic platform, but is considered to yield best-possible policies for an individual robot. Experimental results with swarms of up to 30 robots show that self-organization significantly improves coverage performance with increasing swarm size. We also observe that enforcing a provably complete policy on a miniature robot with limited hardware capabilities is highly sub-optimal as there is a trade-off between coverage throughput and time spent for localization and navigation.

2006

Conception de structures neuronales pour le contrôle de robots mobiles autonomes

Francesco Mondada

There is a large number of possible applications in the field of mobile robotics: Mail delivery robots, domestic or industrial vacuum cleaners, surveillance robots, demining robots and many others could be very interesting products. Despite this potential market and the actual technology, only few simple systems are commercially available. This proves that there are several important and problematic issues in this field, mainly at the intelligence level. As a reaction to the failure of the classical artificial intelligence applied to the field of mobile robotics, several new approaches have been proposed. Artificial neural networks are one of these, and genetic algorithms, supported by the Artificial Life trend, are also getting more and more consideration. These two techniques have already been applied to mobile robotics, but mainly in simulation, and without a final test on a real mobile robot. The use of physical robots for this research seems to be still problematic due to the lack of efficient tools. Several neural structures for the control of mobile robots have been analysed in this work. All experiences have been carried out on physical robots. To reach this goal, an important effort has been made in order to design new efficient robotic tools. Together with Edo Franzi, André Guignard and Yves Cheneval, we have developed and built hardware and software tools that make an efficient research work possible. Along with several analysis software tools, the mobile robot Khepera has been a result of this development. Using this equipment, six experiences have been carried out, covering a large spectrum of the possible ways neural networks can be used for the control of mobile robots. These experiments have nevertheless been restricted to simple behaviours and small neural networks. The first two experiments show, with a very simple and manually adjusted behaviour, the important role of the interaction of the robot with its environment. The first experiment is based on a collective behaviour, the second on a collaborative one. The adaptation of the robot to the environment is introduced in the third experiment, in which a learning technique is applied. The result is a robot able to learn how to use visual stimuli to avoid particular obstacles. Despite its interesting results, this approach has turned out to be very limited, due to the rigid structure needed. The last three experiments demonstrate the possibilities of the use of genetic algorithms, which proved to be a very flexible adaptation mechanism. The first of these three experiments tests the feasibility of this approach. The second one takes advantage of the characteristics of genetic algorithms to achieve more complex behaviours. Finally, genetic algorithms and learning techniques are associated in the last experiment, showing a high adaptive structure. An important effort has been made to show both advantages and disadvantages of each technique, in order to provide the necessary elements for the continuation of this research activity.

EPFL1997

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.