171 research outputs found

    Coverage and Field Estimation on Bounded Domains by Diffusive Swarms

    Full text link
    In this paper, we consider stochastic coverage of bounded domains by a diffusing swarm of robots that take local measurements of an underlying scalar field. We introduce three control methodologies with diffusion, advection, and reaction as independent control inputs. We analyze the diffusion-based control strategy using standard operator semigroup-theoretic arguments. We show that the diffusion coefficient can be chosen to be dependent only on the robots' local measurements to ensure that the swarm density converges to a function proportional to the scalar field. The boundedness of the domain precludes the need to impose assumptions on decaying properties of the scalar field at infinity. Moreover, exponential convergence of the swarm density to the equilibrium follows from properties of the spectrum of the semigroup generator. In addition, we use the proposed coverage method to construct a time-inhomogenous diffusion process and apply the observability of the heat equation to reconstruct the scalar field over the entire domain from observations of the robots' random motion over a small subset of the domain. We verify our results through simulations of the coverage scenario on a 2D domain and the field estimation scenario on a 1D domain.Comment: To appear in the proceedings of the 55th IEEE Conference on Decision and Control (CDC 2016

    Quantifying Robotic Swarm Coverage

    Full text link
    In the field of swarm robotics, the design and implementation of spatial density control laws has received much attention, with less emphasis being placed on performance evaluation. This work fills that gap by introducing an error metric that provides a quantitative measure of coverage for use with any control scheme. The proposed error metric is continuously sensitive to changes in the swarm distribution, unlike commonly used discretization methods. We analyze the theoretical and computational properties of the error metric and propose two benchmarks to which error metric values can be compared. The first uses the realizable extrema of the error metric to compute the relative error of an observed swarm distribution. We also show that the error metric extrema can be used to help choose the swarm size and effective radius of each robot required to achieve a desired level of coverage. The second benchmark compares the observed distribution of error metric values to the probability density function of the error metric when robot positions are randomly sampled from the target distribution. We demonstrate the utility of this benchmark in assessing the performance of stochastic control algorithms. We prove that the error metric obeys a central limit theorem, develop a streamlined method for performing computations, and place the standard statistical tests used here on a firm theoretical footing. We provide rigorous theoretical development, computational methodologies, numerical examples, and MATLAB code for both benchmarks.Comment: To appear in Springer series Lecture Notes in Electrical Engineering (LNEE). This book contribution is an extension of our ICINCO 2018 conference paper arXiv:1806.02488. 27 pages, 8 figures, 2 table

    Enhanced foraging in robot swarms using collective LĂ©vy walks

    Get PDF
    A key aspect of foraging in robot swarms is optimizing the search efficiency when both the environment and target density are unknown. Hence, designing optimal exploration strategies is desirable. This paper proposes a novel approach that extends the individual Lévy walk to a collective one. To achieve this, we adjust the individual motion through applying an artificial potential field method originating from local communication. We demonstrate the effectiveness of the enhanced foraging by confirming that the collective trajectory follows a heavy-tailed distribution over a wide range of swarm sizes. Additionally, we study target search efficiency of the proposed algorithm in comparison with the individual Lévy walk for two different types of target distributions: homogeneous and heterogeneous. Our results highlight the advantages of the proposed approach for both target distributions, while increasing the scalability to large swarm sizes. Finally, we further extend the individual exploration algorithm by adapting the Lévy walk parameter α, altering the motion pattern based on a local estimation of the target density. This adaptive behavior is particularly useful when targets are distributed in patches

    Scalable Control Strategies and a Customizable Swarm Robotic Platform for Boundary Coverage and Collective Transport Tasks

    Get PDF
    abstract: Swarms of low-cost, autonomous robots can potentially be used to collectively perform tasks over large domains and long time scales. The design of decentralized, scalable swarm control strategies will enable the development of robotic systems that can execute such tasks with a high degree of parallelism and redundancy, enabling effective operation even in the presence of unknown environmental factors and individual robot failures. Social insect colonies provide a rich source of inspiration for these types of control approaches, since they can perform complex collective tasks under a range of conditions. To validate swarm robotic control strategies, experimental testbeds with large numbers of robots are required; however, existing low-cost robots are specialized and can lack the necessary sensing, navigation, control, and manipulation capabilities. To address these challenges, this thesis presents a formal approach to designing biologically-inspired swarm control strategies for spatially-confined coverage and payload transport tasks, as well as a novel low-cost, customizable robotic platform for testing swarm control approaches. Stochastic control strategies are developed that provably allocate a swarm of robots around the boundaries of multiple regions of interest or payloads to be transported. These strategies account for spatially-dependent effects on the robots' physical distribution and are largely robust to environmental variations. In addition, a control approach based on reinforcement learning is presented for collective payload towing that accommodates robots with heterogeneous maximum speeds. For both types of collective transport tasks, rigorous approaches are developed to identify and translate observed group retrieval behaviors in Novomessor cockerelli ants to swarm robotic control strategies. These strategies can replicate features of ant transport and inherit its properties of robustness to different environments and to varying team compositions. The approaches incorporate dynamical models of the swarm that are amenable to analysis and control techniques, and therefore provide theoretical guarantees on the system's performance. Implementation of these strategies on robotic swarms offers a way for biologists to test hypotheses about the individual-level mechanisms that drive collective behaviors. Finally, this thesis describes Pheeno, a new swarm robotic platform with a three degree-of-freedom manipulator arm, and describes its use in validating a variety of swarm control strategies.Dissertation/ThesisDoctoral Dissertation Mechanical Engineering 201

    Adaptive and learning-based formation control of swarm robots

    Get PDF
    Autonomous aerial and wheeled mobile robots play a major role in tasks such as search and rescue, transportation, monitoring, and inspection. However, these operations are faced with a few open challenges including robust autonomy, and adaptive coordination based on the environment and operating conditions, particularly in swarm robots with limited communication and perception capabilities. Furthermore, the computational complexity increases exponentially with the number of robots in the swarm. This thesis examines two different aspects of the formation control problem. On the one hand, we investigate how formation could be performed by swarm robots with limited communication and perception (e.g., Crazyflie nano quadrotor). On the other hand, we explore human-swarm interaction (HSI) and different shared-control mechanisms between human and swarm robots (e.g., BristleBot) for artistic creation. In particular, we combine bio-inspired (i.e., flocking, foraging) techniques with learning-based control strategies (using artificial neural networks) for adaptive control of multi- robots. We first review how learning-based control and networked dynamical systems can be used to assign distributed and decentralized policies to individual robots such that the desired formation emerges from their collective behavior. We proceed by presenting a novel flocking control for UAV swarm using deep reinforcement learning. We formulate the flocking formation problem as a partially observable Markov decision process (POMDP), and consider a leader-follower configuration, where consensus among all UAVs is used to train a shared control policy, and each UAV performs actions based on the local information it collects. In addition, to avoid collision among UAVs and guarantee flocking and navigation, a reward function is added with the global flocking maintenance, mutual reward, and a collision penalty. We adapt deep deterministic policy gradient (DDPG) with centralized training and decentralized execution to obtain the flocking control policy using actor-critic networks and a global state space matrix. In the context of swarm robotics in arts, we investigate how the formation paradigm can serve as an interaction modality for artists to aesthetically utilize swarms. In particular, we explore particle swarm optimization (PSO) and random walk to control the communication between a team of robots with swarming behavior for musical creation
    • …
    corecore