Abstract
This paper regards the problem of optimally placing unreliable sensors in a one- dimensional environment. We assume that sensors can fail with a certain probability and we minimize the expected maximum distance between any point in the environment and the closest active sensor. We provide a computational method to find the optimal placement and we estimate the costs of the equispaced placement and of the uniform random placement. When the number of sensors goes to infinity, the equispaced placement is asymptotically equivalent to the optimal placement (that is, the ratio between their costs converges to one), whereas the cost of the random placement remains strictly larger.
Original language | English |
---|---|
Pages (from-to) | 3120-3140 |
Number of pages | 21 |
Journal | SIAM journal on control and optimization |
Volume | 53 |
Issue number | 5 |
DOIs | |
Publication status | Published - 2015 |
Keywords
- Unreliable sensors
- Coverage optimization
- Robotic networks
- Sensor deployment
- Sensor networks