skip to main content

Title: Distributed and Collision-Free Coverage Control of a Team of Mobile Sensors Using the Convex Uncertain Voronoi Diagram
In this paper, we propose a distributed coverage control algorithm for mobile sensing networks that can account for bounded uncertainty in the location of each sensor. Our algorithm is capable of safely driving mobile sensors towards areas of high information distribution while having them maintain coverage of the whole area of interest. To do this, we propose two novel variants of the Voronoi diagram. The first, the convex uncertain Voronoi (CUV) diagram, guarantees full coverage of the search area. The second, collision avoidance regions (CARs), guarantee collision-free motions while avoiding deadlock, enabling sensors to safely and successfully reach their goals. We demonstrate the efficacy of these algorithms via a series of simulations with different numbers of sensors and uncertainties in the sensors’ locations. The results show that sensor networks of different scales are able to safely perform optimized distribution corresponding to the information distribution density under different localization uncertainties  more » « less
Award ID(s):
Author(s) / Creator(s):
Date Published:
Journal Name:
American Control Conference
Page Range / eLocation ID:
5307 to 5313
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Accurately detecting, localizing, and tracking an unknown and time-varying number of dynamic targets using a team of mobile robots is a challenging problem that requires robots to reason about the uncertainties in their collected measurements. The problem is made more challenging when robots are uncertain about their own states, as this makes it difficult to both collectively localize targets and avoid collisions with one another. In this paper, we introduce the convex uncertain Voronoi (CUV) diagram, a generalization of the standard Voronoi diagram that accounts for the uncertain pose of each individual robot. We then use the CUV diagram to develop distributed multi-target tracking and coverage control algorithms that enable teams of mobile robots to account for bounded uncertainty in the location of each robot. Our algorithms are capable of safely driving mobile robots towards areas of high information distribution while maintaining coverage of the whole area of interest. We demonstrate the efficacy of these algorithms via a series of simulated and hardware tests, and compare the results to our previous work which assumes perfect localization. 
    more » « less
  2. This article presents an online parameter identification scheme for advection-diffusion processes using data collected by a mobile sensor network. The advection-diffusion equation is incorporated into the information dynamics associated with the trajectories of the mobile sensors. A constrained cooperative Kalman filter is developed to provide estimates of the field values and gradients along the trajectories of the mobile sensors so that the temporal variations in the field values can be estimated. This leads to a co-design scheme for state estimation and parameter identification for advection-diffusion processes that is different from comparable schemes using sensors installed at fixed spatial locations. Using state estimates from the constrained cooperative Kalman filter, a recursive least-square (RLS) algorithm is designed to estimate unknown model parameters of the advection-diffusion processes. Theoretical justifications are provided for the convergence of the proposed cooperative Kalman filter by deriving a set of sufficient conditions regarding the formation shape and the motion of the mobile sensor network. Simulation and experimental results show satisfactory performance and demonstrate the robustness of the algorithm under realistic uncertainties and disturbances. 
    more » « less
  3. . (Ed.)
    This work is concerned with the use of mobile sensors to approximate and replace the full state feedback controller by static output feedback controllers for a class of PDEs. Assuming the feedback operator associated with the full-state feedback controller admits a kernel representation, the proposed optimization aims to approximate the inner product of the kernel and the full state by a finite sum of weighted scalar outputs provided by the mobile sensors. When the full state feedback operator is time-dependent thus rendering its associated kernel time-varying, the approximation results in moving sensors with time-varying static gains. To calculate the velocity of the mobile sensors within the spatial domain the time-varying kernel is set equal to the sensor density and thus the solution to an associated advection PDE reveals the velocity field of the sensor network. To obtain the speed of the finite number of sensors, a domain decomposition based on a modification of the Centroidal Voronoi Tessellations (µ-CVT) is used to decompose the kernel into a finite number of cells, each of which contains a single sensor. A subsequent application of the µ-CVT on the velocity field provides the individual sensor speeds. The nature of this µ-CVT ensures collision avoidance by the very structure of the kernel decomposition into non-intersecting cells. Numerical simulations are provided to highlight the proposed sensor guidance. 
    more » « less
  4. This paper proposes cooperative Kalman filters for distributed mobile sensor networks where the mobile sensors are organized into cells that resemble a mesh grid to cover a spatial area. The mobile sensor networks are deployed to map an underlying spatial-temporal field modeled by the Poisson equation. After discretizing the Poisson equation with finite volume method, we found that the cooperative Kalman filters for the cells are subjected to a set of distributed constraints. The field value and gradient information at each cell center can be estimated by the constrained cooperative Kalman filter using measurements within each cell and information from neighboring cells. We also provide convergence analysis for the distributed constrained cooperative Kalman filter. Simulation results with a five cell network validates the proposed distributed filtering method. 
    more » « less
  5. In this work, we address a visbility-based target tracking problem in a polygonal environment in which a group of mobile observers try to maintain a line-of-sight with a mobile intruder. We build a bridge between data mining and visibility-based tracking using a novel tiling scheme for the polygon. First, we propose a tracking strategy for a team of guards located on the tiles to dynamically track an intruder when complete coverage of the polygon cannot be ensured. Next, we propose a novel variant of the Voronoi Diagram to construct navigation strategies for a team of co-located guards to track an intruder from any initial position in the environment. We present empirical analysis to illustrate the efficacy of the proposed tiling scheme. Simulations and testbed demonstrations are present in a video attachment. 
    more » « less