9 research outputs found
Swarm Robotic Systems with Minimal Information Processing
This thesis is concerned with the design and analysis of behaviors in swarm robotic systems using minimal information acquisition and processing. The motivation for this work is to contribute in paving the way for the implementation of swarm robotic systems at physically small scales, which will open up new application domains for their operation. At these scales, the space and energy available for the integration of sensors and computational hardware within the individual robots is at a premium. As a result, trade-offs in performance can be justified if a task can be achieved in a more parsimonious way.
A framework is developed whereby meaningful collective behaviors in swarms of robots can be shown to emerge without the robots, in principle, possessing any run-time memory or performing any arithmetic computations. This is achieved by the robots having only discrete-valued sensors, and purely reactive controllers. Black-box search methods are used to automatically synthesize these controllers for desired collective behaviors.
This framework is successfully applied to two canonical tasks in swarm robotics: self-organized aggregation of robots, and self-organized clustering of objects by robots. In the case of aggregation, the robots are equipped with one binary sensor, which informs them whether or not there is another robot in their line of sight. This makes the structure of the robots’ controller simple enough that its entire space can be systematically searched to locate the optimal controller (within a finite resolution). In the case of object clustering, the robots’ sensor is extended to have three states, distinguishing between robots, objects, and the background. This still requires no run-time memory or arithmetic computations on the part of the robots. It is statistically shown that the extension of the sensor to have three states leads to a better performance as compared to the cases where the sensor is binary, and cannot distinguish between robots and objects, or robots and the background
Turing learning: : A metric-free approach to inferring behavior and its application to swarms
We propose Turing Learning, a novel system identification method for
inferring the behavior of natural or artificial systems. Turing Learning
simultaneously optimizes two populations of computer programs, one representing
models of the behavior of the system under investigation, and the other
representing classifiers. By observing the behavior of the system as well as
the behaviors produced by the models, two sets of data samples are obtained.
The classifiers are rewarded for discriminating between these two sets, that
is, for correctly categorizing data samples as either genuine or counterfeit.
Conversely, the models are rewarded for 'tricking' the classifiers into
categorizing their data samples as genuine. Unlike other methods for system
identification, Turing Learning does not require predefined metrics to quantify
the difference between the system and its models. We present two case studies
with swarms of simulated robots and prove that the underlying behaviors cannot
be inferred by a metric-based system identification method. By contrast, Turing
Learning infers the behaviors with high accuracy. It also produces a useful
by-product - the classifiers - that can be used to detect abnormal behavior in
the swarm. Moreover, we show that Turing Learning also successfully infers the
behavior of physical robot swarms. The results show that collective behaviors
can be directly inferred from motion trajectories of individuals in the swarm,
which may have significant implications for the study of animal collectives.
Furthermore, Turing Learning could prove useful whenever a behavior is not
easily characterizable using metrics, making it suitable for a wide range of
applications.Comment: camera-ready versio
A Coevolutionary Approach to Learn Animal Behavior Through Controlled Interaction
This paper proposes a method that allows a machine to infer the behavior of an animal in a fully automatic way. In principle, the machine does not need any prior information about the behavior. It is able to modify the environmental conditions and observe the animal; therefore it can learn about the animal through controlled interaction. Using a competitive coevolutionary approach, the machine concurrently evolves animats, that is, models to approximate the animal, as well as classifiers to discriminate between animal and animat. We present a proof-of-concept study conducted in computer simulation that shows the feasibility of the approach. Moreover, we show that the machine learns significantly better through interaction with the animal than through passive observation. We discuss the merits and limitations of the approach and outline potential future directions
A Strategy for Transporting Tall Objects with a Swarm of Miniature Mobile Robots
Abstract — This paper proposes a strategy for transporting a tall, and potentially heavy, object to a goal using a large number of miniature mobile robots. The robots move the object by pushing it. The direction in which the object moves is controlled by the way in which the robots distribute themselves around its perimeter — if the robots dynamically reallocate themselves around the section of the object’s perimeter that occludes their view of the goal, the object will eventually be transported to the goal. This strategy is fully distributed, and makes no use of communication between the robots. A controller based on this strategy was implemented on a swarm of 12 physical e-puck robots, and a systematic experiment with 30 randomized trials was performed. The object was successfully transported to the goal in all the trials. On average, the path traced by the object was about 8.4 % longer than the shortest possible path. I