5,693 research outputs found
Coverage and Field Estimation on Bounded Domains by Diffusive Swarms
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
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
Quantitative Assessment of Robotic Swarm Coverage
This paper studies a generally applicable, sensitive, and intuitive error
metric for the assessment of robotic swarm density controller performance.
Inspired by vortex blob numerical methods, it overcomes the shortcomings of a
common strategy based on discretization, and unifies other continuous notions
of coverage. We present two benchmarks against which to compare the error
metric value of a given swarm configuration: non-trivial bounds on the error
metric, and the probability density function of the error metric when robot
positions are sampled at random from the target swarm distribution. We give
rigorous results that this probability density function of the error metric
obeys a central limit theorem, allowing for more efficient numerical
approximation. For both of these benchmarks, we present supporting theory,
computation methodology, examples, and MATLAB implementation code.Comment: Proceedings of the 15th International Conference on Informatics in
Control, Automation and Robotics (ICINCO), Porto, Portugal, 29--31 July 2018.
11 pages, 4 figure
Trading Safety Versus Performance: Rapid Deployment of Robotic Swarms with Robust Performance Constraints
In this paper we consider a stochastic deployment problem, where a robotic
swarm is tasked with the objective of positioning at least one robot at each of
a set of pre-assigned targets while meeting a temporal deadline. Travel times
and failure rates are stochastic but related, inasmuch as failure rates
increase with speed. To maximize chances of success while meeting the deadline,
a control strategy has therefore to balance safety and performance. Our
approach is to cast the problem within the theory of constrained Markov
Decision Processes, whereby we seek to compute policies that maximize the
probability of successful deployment while ensuring that the expected duration
of the task is bounded by a given deadline. To account for uncertainties in the
problem parameters, we consider a robust formulation and we propose efficient
solution algorithms, which are of independent interest. Numerical experiments
confirming our theoretical results are presented and discussed
- …