Browse wiki

From MurrayWiki
Jump to: navigation, search
The Dynamic Sensor Coverage Problem
Abstract We introduce a theoretical framework for t …
We introduce a theoretical framework for the dynamic sensor coverage problem for a simple case with multiple discrete time linear dynamical systems located in different spacial locations. The objective is to keep an appreciable estimate of the states of the systems at all times by deploying a few mobile sensors. The sensors are assumed to have a limited range and they implement a Kalman filter to estimate the states of all the systems. The motion of the sensor is modeled as a discrete time discrete state Markov chain. Based on some recent results on the Kalman filtering problem with intermittent observations by Sinopoli et. al., we derive conditions under which a single sensor fails to solve the coverage problem. We also give conditions under which we can guarantee that a single sensor is enough to solve the dynamic coverage problem.
ugh to solve the dynamic coverage problem.  +
Authors Abhishek Tiwari, Myungsoo Jun, David E. Jeffcoat, Richard M. Murray  +
ID 2004w  +
Source 2005 IFAC World Congress  +
Tag tjjm05-ifac  +
Title The Dynamic Sensor Coverage Problem +
Type Conference Paper  +
Categories Papers
Modification date
This property is a special property in this wiki.
15 May 2016 06:18:09  +
URL
This property is a special property in this wiki.
http://www.cds.caltech.edu/~murray/preprints/tjjm04-ifac.pdf  +
hide properties that link here 
The Dynamic Sensor Coverage Problem + Title
 

 

Enter the name of the page to start browsing from.