https://murray.cds.caltech.edu/index.php?action=history&feed=atom&title=The_Dynamic_Sensor_Coverage_Problem 2026-04-26T09:26:52Z Revision history for this page on the wiki MediaWiki 1.41.5 https://murray.cds.caltech.edu/index.php?title=The_Dynamic_Sensor_Coverage_Problem&diff=19887&oldid=prev 2016-05-15T06:18:09Z

<p>htdb2wiki: creating page for 2004w_tjjm05-ifac.html</p> <p><b>New page</b></p><div>{{HTDB paper<br /> | authors = Abhishek Tiwari, Myungsoo Jun, David E. Jeffcoat, Richard M. Murray<br /> | title = The Dynamic Sensor Coverage Problem<br /> | source = 2005 IFAC World Congress<br /> | year = 2004<br /> | type = <br /> Conference Paper<br /> | funding = AFOSR/info2<br /> | url = http://www.cds.caltech.edu/~murray/preprints/tjjm04-ifac.pdf<br /> | abstract = <br /> We introduce a theoretical framework for the dynamic sensor coverage<br /> problem for a simple case with multiple discrete time linear dynamical systems<br /> located in different spacial locations. The objective is to keep an appreciable<br /> estimate of the states of the systems at all times by deploying a few mobile sensors.<br /> The sensors are assumed to have a limited range and they implement a Kalman<br /> filter to estimate the states of all the systems. The motion of the sensor is modeled<br /> as a discrete time discrete state Markov chain. Based on some recent results on<br /> the Kalman filtering problem with intermittent observations by Sinopoli et. al., we<br /> derive conditions under which a single sensor fails to solve the coverage problem.<br /> We also give conditions under which we can guarantee that a single sensor is<br /> enough to solve the dynamic coverage problem.<br /> | flags = <br /> | tag = tjjm05-ifac<br /> | id = 2004w<br /> }}</div>

Murray