FIND ME ON

GitHub

LinkedIn

Dynamic Coverage Control

🌱

StochasticDiffs

Problem formulation

Consider the system x˙=f(x,u)\dot{x}=f(x,u)where the state is xXRnx \in \mathbb{X}\subset \mathbb{R}^{n}, control input uURmu \in \mathbb{U}\subset \mathbb{R}^{m}. The objective in coverage control is to design a policy γ:XU\gamma:\mathbb{X}\to \mathbb{U} for the system s.t. closed-loop trajectories gather information over a domain DX\mathcal{D}\subset \mathbb{X}. Let c=c(t,p)c=c(t,p)denote the ‘coverage level’ about a point pDp \in \mathcal{D} at time tt. Coverage increases through a sensing function S:X×DR0S:\mathbb{X}\times \mathcal{D}\to \mathbb{R}_{\ge 0} (positive when pp can be sensed from xx and 0 else), and coverage decreases at a rate α:DR0\alpha:\mathcal{D}\to \mathbb{R}_{\ge 0}. Giving us the model: c˙=S(x,p)(1c)α(p)c.\dot{c}=S(x,p)(1-c)-\alpha(p)c.A point pp is said to be covered if c(t,p)c(t,p) reaches a threshold cc^{*}.

So, in summary: - S(x,p)S(x,p) is the sensing function. This describes our quality of coverage of pp from our position xx. - α(p)\alpha(p) describes how the “coverage” of pp decays. - c(t,p)c(t,p) describes the “coverage level” of pp at time tt. - cc^{*} acts as an upper bound on the coverage level that can be obtained.

Toy Problem

Linked from