Safe, Remote-Access Swarm Robotics Research on the Robotarium

This paper describes the development of the Robotarium -- a remotely accessible, multi-robot research facility. The impetus behind the Robotarium is that multi-robot testbeds constitute an integral and essential part of the multi-agent research cycle, yet they are expensive, complex, and time-consuming to develop, operate, and maintain. These resource constraints, in turn, limit access for large groups of researchers and students, which is what the Robotarium is remedying by providing users with remote access to a state-of-the-art multi-robot test facility. This paper details the design and operation of the Robotarium as well as connects these to the particular considerations one must take when making complex hardware remotely accessible. In particular, safety must be built in already at the design phase without overly constraining which coordinated control programs the users can upload and execute, which calls for minimally invasive safety routines with provable performance guarantees.Comment: 13 pages, 7 figures, 3 code samples, 72 reference

Distributed, adaptive deployment for nonholonomic mobile sensor networks : theory and experiments

In this work we show the Lyapunov stability and convergence of an adaptive and decentralized coverage control for a team of mobile sensors. This new approach assumes nonholonomic sensors rather than the usual holonomic sensors found in the literature. The kinematics of the unicycle model and a nonlinear control law in polar coordinates are used in order to prove the stability of the controller applied over a team of mobile sensors. This controller is adaptive, which means that the mobile sensors are able to estimate and map a density function in the sampling space without a previous knowledge of the environment. The controller is decentralized, which means that each mobile sensor has its own estimate and computes its own control input based on local information. In order to guarantee the estimate convergence, the mobile sensors implement a consensus protocol in continuous time assuming a fixed network topology and zero communication delays. The convergence and feasibility of the coverage control algorithm are verified through simulations in Matlab and Stage. The Matlab simulations consider only the kinematics of the mobile sensors and the Stage simulations consider the dynamics and the kinematics of the sensors. The Matlab simulations show successful results since the sensor network carries out the coverage task and distributes itself over the estimated density function. The adaptive law which is defined by a differential equation must be approximated by a difference equation to be implementable in Stage. The Stage simulations show positive results, however, the system is not able to achieve an accurate estimation of the density function. In spite of that, the sensors carry out the coverage task distributing themselves over the sampling space. Furthermore, some experiments are carried out using a team of four Pioneer 3-AT robots sensing a piecewise constant light distribution function. The experimental results are satisfactory since the robots carry out the coverage task. However, the accuracy of the estimation is affected by the approximation of the adaptation law by difference equations, the number of robots and sensor sensitivity. Based on the results of this research, the decentralized adaptive coverage control for nonholonomic vehicles has been analyzed from a theoretical approach and validated through simulation and experimentation with positive results. As a future work we will investigate: (i) new techniques to improve the implementation of the adaptive law in real time,(ii) the consideration of the dynamics of the mobile sensors, and (iii) the stability and convergence of the adaptive law for continuous-time variant density function

Analysis of multi-agent systems under varying degrees of trust, cooperation, and competition

Multi-agent systems rely heavily on coordination and cooperation to achieve a variety of tasks. It is often assumed that these agents will be fully cooperative, or have reliable and equal performance among group members. Instead, we consider cooperation as a spectrum of possible interactions, ranging from performance variations within the group to adversarial agents. This thesis examines several scenarios where cooperation and performance are not guaranteed. Potential applications include sensor coverage, emergency response, wildlife management, tracking, and surveillance. We use geometric methods, such as Voronoi tessellations, for design insight and Lyapunov-based stability theory to analyze our proposed controllers. Performance is verified through simulations and experiments on a variety of ground and aerial robotic platforms. First, we consider the problem of Voronoi-based coverage control, where a group of robots must spread out over an environment to provide coverage. Our approach adapts online to sensing and actuation performance variations with the group. The robots have no prior knowledge of their relative performance, and in a distributed fashion, compensate by assigning weaker robots a smaller portion of the environment. Next, we consider the problem of multi-agent herding, akin to shepherding. Here, a group of dog-like robots must drive a herd of non-cooperative sheep-like agents around the environment. Our key insight in designing the control laws for the herders is to enforce geometrical relationships that allow for the combined system dynamics to reduce to a single nonholonomic vehicle. We also investigate the cooperative pursuit of an evader by a group of quadrotors in an environment with no-fly zones. While the pursuers cannot enter the no-fly zones, the evader moves freely through the zones to avoid capture. Using tools for Voronoi-based coverage control, we provide an algorithm to distribute the pursuers around the zone's boundary and minimize capture time once the evader emerges. Finally, we present an algorithm for the guaranteed capture of multiple evaders by one or more pursuers in a bounded, convex environment. The pursuers utilize properties of the evader's Voronoi cell to choose a control strategy that minimizes the safe-reachable area of the evader, which in turn leads to the evader's capture

Stability of singularly perturbed hybrid systems with restricted systems evolving on boundary layer manifolds

We present a singular perturbation theory applicable to systems with hybrid boundary layer systems and hybrid reduced systems {with} jumps from the boundary layer manifold. First, we prove practical attractivity of an adequate attractor set for small enough tuning parameters and sufficiently long time between almost all jumps. Second, under mild conditions on the jump mapping, we prove semi-global practical asymptotic stability of a restricted attractor set. Finally, for certain classes of dynamics, we prove semi-global practical asymptotic stability of the restricted attractor set for small enough tuning parameters and sufficiently long period between almost all jumps of the slow states only

Implementation of distributed partitioning algorithms using mobile Wheelphones

This thesis presents the implementation process of partitioning algorithms from the theorical ideas to sperimental result