Urban Swarms: A new approach for autonomous waste management

Modern cities are growing ecosystems that face new challenges due to the increasing population demands. One of the many problems they face nowadays is waste management, which has become a pressing issue requiring new solutions. Swarm robotics systems have been attracting an increasing amount of attention in the past years and they are expected to become one of the main driving factors for innovation in the field of robotics. The research presented in this paper explores the feasibility of a swarm robotics system in an urban environment. By using bio-inspired foraging methods such as multi-place foraging and stigmergy-based navigation, a swarm of robots is able to improve the efficiency and autonomy of the urban waste management system in a realistic scenario. To achieve this, a diverse set of simulation experiments was conducted using real-world GIS data and implementing different garbage collection scenarios driven by robot swarms. Results presented in this research show that the proposed system outperforms current approaches. Moreover, results not only show the efficiency of our solution, but also give insights about how to design and customize these systems.Comment: Manuscript accepted for publication in IEEE ICRA 201

Optimized Stochastic Policies for Task Allocation in Swarms of Robots

We present a scalable approach to dynamically allocating a swarm of homogeneous robots to multiple tasks, which are to be performed in parallel, following a desired distribution. We employ a decentralized strategy that requires no communication among robots. It is based on the development of a continuous abstraction of the swarm obtained by modeling population fractions and defining the task allocation problem as the selection of rates of robot ingress and egress to and from each task. These rates are used to determine probabilities that define stochastic control policies for individual robots, which, in turn, produce the desired collective behavior. We address the problem of computing rates to achieve fast redistribution of the swarm subject to constraint(s) on switching between tasks at equilibrium. We present several formulations of this optimization problem that vary in the precedence constraints between tasks and in their dependence on the initial robot distribution. We use each formulation to optimize the rates for a scenario with four tasks and compare the resulting control policies using a simulation in which 250 robots redistribute themselves among four buildings to survey the perimeters

Distributed allocation of mobile sensing swarms in gyre flows

We address the synthesis of distributed control policies to enable a swarm of homogeneous mobile sensors to maintain a desired spatial distribution in a geophysical flow environment, or workspace. In this article, we assume the mobile sensors (or robots) have a "map" of the environment denoting the locations of the Lagrangian coherent structures or LCS boundaries. Based on this information, we design agent-level hybrid control policies that leverage the surrounding fluid dynamics and inherent environmental noise to enable the team to maintain a desired distribution in the workspace. We establish the stability properties of the ensemble dynamics of the distributed control policies. Since realistic quasi-geostrophic ocean models predict double-gyre flow solutions, we use a wind-driven multi-gyre flow model to verify the feasibility of the proposed distributed control strategy and compare the proposed control strategy with a baseline deterministic allocation strategy. Lastly, we validate the control strategy using actual flow data obtained by our coherent structure experimental testbed.Comment: 10 pages, 14 Figures, added reference

Urban Swarms: A new approach for autonomous waste management

Modern cities are growing ecosystems that face new challenges due to the increasing population demands. One of the many problems they face nowadays is waste management, which has become a pressing issue requiring new solutions. Swarm robotics systems have been attracting an increasing amount of attention in the past years and they are expected to become one of the main driving factors for innovation in the field of robotics. The research presented in this paper explores the feasibility of a swarm robotics system in an urban environment. By using bio-inspired foraging methods such as multi-place foraging and stigmergy-based navigation, a swarm of robots is able to improve the efficiency and autonomy of the urban waste management system in a realistic scenario. To achieve this, a diverse set of simulation experiments was conducted using real-world GIS data and implementing different garbage collection scenarios driven by robot swarms. Results presented in this research show that the proposed system outperforms current approaches. Moreover, results not only show the efficiency of our solution, but also give insights about how to design and customize these systems

Simulador de comportamiento de enjambre con Quorum Sensing bacteriano

One of the most useful tools in the design of path-planning solutions is simulators. Thanks to them, it is possible to predict the performance of certain control strategies. In this paper, a simulator is presented that implements a swarm of automatons, which perform a wild motion in a user-selected environment. The robots will have the quality to avoid collisions with different obstacles that affect their mobility since they are equipped with proximity sensors. The interface of this simulator was designed entirely with the Qt Designer software. Successful configurations that replicate the performance of the real prototype are presented.  Una de las herramientas más útiles en el diseño de soluciones de planificación de trayectorias son los simuladores. Gracias a ellos, es posible predecir el rendimiento de determinadas estrategias de control. En este trabajo se presenta un simulador que implementa un enjambre de autómatas que realizan un movimiento salvaje en un entorno seleccionado por el usuario. Los robots tendrán la cualidad de evitar colisiones con diferentes obstáculos que afecten a su movilidad ya que están equipados con sensores de proximidad. La interfaz de este simulador se ha diseñado íntegramente con el software Qt Designer. Se presentan configuraciones exitosas que replican el desempeño del prototipo real. &nbsp

An Efficient Multiple-Place Foraging Algorithm for Scalable Robot Swarms

Searching and collecting multiple resources from large unmapped environments is an important challenge. It is particularly difficult given limited time, a large search area and incomplete data about the environment. This search task is an abstraction of many real-world applications such as search and rescue, hazardous material clean-up, and space exploration. The collective foraging behavior of robot swarms is an effective approach for this task. In our work, individual robots have limited sensing and communication range (like ants), but they are organized and work together to complete foraging tasks collectively. An efficient foraging algorithm coordinates robots to search and collect as many resources as possible in the least amount of time. In the foraging algorithms we study, robots act independently with little or no central control. As the swarm size and arena size increase (e.g., thousands of robots searching over the surface of Mars or ocean), the foraging performance per robot decreases. Generally, larger robot swarms produce more inter-robot collisions, and in swarm robot foraging, larger search arenas result in larger travel distances causing the phenomenon of diminishing returns. The foraging performance per robot (measured as a number of collected resources per unit time) is sublinear with the arena size and the swarm size. Our goal is to design a scale-invariant foraging robot swarm. In other words, the foraging performance per robot should be nearly constant as the arena size and the swarm size increase. We address these problems with the Multiple-Place Foraging Algorithm (MPFA), which uses multiple collection zones distributed throughout the search area. Robots start from randomly assigned home collection zones but always return to the closest collection zones with found resources. We simulate the foraging behavior of robot swarms in the robot simulator ARGoS and employ a Genetic Algorithm (GA) to discover different optimized foraging strategies as swarm sizes and the number of resources is scaled up. In our experiments, the MPFA always produces higher foraging rates, fewer collisions, and lower travel and search time than the Central-Place Foraging Algorithm (CPFA). To make the MPFA more adaptable, we introduce dynamic depots that move to the centroid of recently collected resources, minimizing transport times when resources are clustered in heterogeneous distributions. Finally, we extend the MPFA with a bio-inspired hierarchical branching transportation network. We demonstrate a scale-invariant swarm foraging algorithm that ensures that each robot finds and delivers resources to a central collection zone at the same rate, regardless of the size of the swarm or the search area. Dispersed mobile depots aggregate locally foraged resources and transport them to a central place via a hierarchical branching transportation network. This approach is inspired by ubiquitous fractal branching networks such as animal cardiovascular networks that deliver resources to cells and determine the scale and pace of life. The transportation of resources through the cardiovascular system from the heart to dispersed cells is the inverse problem of transportation of dispersed resources to a central collection zone through the hierarchical branching transportation network in robot swarms. We demonstrate that biological scaling laws predict how quickly robots forage in simulations of up to thousands of robots searching over thousands of square meters. We then use biological scaling predictions to determine the capacity of depot robots in order to overcome scaling constraints and produce scale-invariant robot swarms. We verify the predictions using ARGoS simulations. While simulations are useful for initial evaluations of the viability of algorithms, our ultimate goal is predicting how algorithms will perform when physical robots interact in the unpredictable conditions of environments they are placed in. The CPFA and the Distributed Deterministic Spiral Algorithm (DDSA) are compared in physical robots in a large outdoor arena. The physical experiments change our conclusion about which algorithm has the best performance, emphasizing the importance of systematically comparing the performance of swarm robotic algorithms in the real world. We illustrate the feasibility of implementing the MPFA with transportation networks in physical robot swarms. Full implementation of the MPFA in an outdoor environment is the next step to demonstrate truly scalable and robust foraging robot swarms

Abstractions, Analysis Techniques, and Synthesis of Scalable Control Strategies for Robot Swarms

Tasks that require parallelism, redundancy, and adaptation to dynamic, possibly hazardous environments can potentially be performed very efficiently and robustly by a swarm robotic system. Such a system would consist of hundreds or thousands of anonymous, resource-constrained robots that operate autonomously, with little to no direct human supervision. The massive parallelism of a swarm would allow it to perform effectively in the event of robot failures, and the simplicity of individual robots facilitates a low unit cost. Key challenges in the development of swarm robotic systems include the accurate prediction of swarm behavior and the design of robot controllers that can be proven to produce a desired macroscopic outcome. The controllers should be scalable, meaning that they ensure system operation regardless of the swarm size. This thesis presents a comprehensive approach to modeling a swarm robotic system, analyzing its performance, and synthesizing scalable control policies that cause the populations of different swarm elements to evolve in a specified way that obeys time and efficiency constraints. The control policies are decentralized, computed a priori, implementable on robots with limited sensing and communication capabilities, and have theoretical guarantees on performance. To facilitate this framework of abstraction and top-down controller synthesis, the swarm is designed to emulate a system of chemically reacting molecules. The majority of this work considers well-mixed systems when there are interaction-dependent task transitions, with some modeling and analysis extensions to spatially inhomogeneous systems. The methodology is applied to the design of a swarm task allocation approach that does not rely on inter-robot communication, a reconfigurable manufacturing system, and a cooperative transport strategy for groups of robots. The third application incorporates observations from a novel experimental study of the mechanics of cooperative retrieval in Aphaenogaster cockerelli ants. The correctness of the abstractions and the correspondence of the evolution of the controlled system to the target behavior are validated with computer simulations. The investigated applications form the building blocks for a versatile swarm system with integrated capabilities that have performance guarantees