Published December 2006
| Published
Book Section - Chapter
Open
On Sensor Coverage by Mobile Sensors
Chicago
Abstract
We study the problem of using a small number of mobile sensors to monitor various threats in a geographical area. Using some recent results on stochastic sensor scheduling, we propose a stochastic sensor movement strategy. We present simple conditions under which it is not possible to maintain a bounded estimate error covariance for all the threats. We also study a simple sub-optimal algorithm to generate stochastic trajectories. Simulations are presented to illustrate the results.
Additional Information
© 2006 IEEE. Research supported in part by the AFOSR grant F49620-01-1-0460 and in part by NSF grant CCR-0326554.Attached Files
Published - 04177412.pdf
Files
04177412.pdf
Files
(171.7 kB)
Name | Size | Download all |
---|---|---|
md5:497a2a5d9476ccadb4d861486198a52a
|
171.7 kB | Preview Download |
Additional details
- Eprint ID
- 77508
- Resolver ID
- CaltechAUTHORS:20170516-161356985
- Air Force Office of Scientific Research (AFOSR)
- F49620-01-1-0460
- NSF
- CCR-0326554
- Created
-
2017-05-16Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field