Skip to Main content Skip to Navigation
New interface
Journal articles

Optimal one-dimensional coverage by unreliable sensors

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Federica Garin Connect in order to contact the contributor
Submitted on : Thursday, November 26, 2015 - 5:07:12 PM
Last modification on : Thursday, January 20, 2022 - 5:29:16 PM
Long-term archiving on: : Saturday, February 27, 2016 - 1:23:18 PM


Files produced by the author(s)




Paolo Frasca, Federica Garin, Balázs Gerencsér, Julien M. Hendrickx. Optimal one-dimensional coverage by unreliable sensors. SIAM Journal on Control and Optimization, 2015, 53 (5), pp.3120-3140. ⟨10.1137/140968094⟩. ⟨hal-01234344⟩



Record views


Files downloads