Optimal one-dimensional coverage by unreliable sensors

Paolo Frasca, Federica Garin, Balazs Gerencser, Julien M. Hendrickx

    Research output: Contribution to journalArticleAcademicpeer-review

    13 Citations (Scopus)
    72 Downloads (Pure)


    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 languageEnglish
    Pages (from-to)3120-3140
    Number of pages21
    JournalSIAM journal on control and optimization
    Issue number5
    Publication statusPublished - 2015


    • Unreliable sensors
    • Coverage optimization
    • Robotic networks
    • Sensor deployment
    • Sensor networks


    Dive into the research topics of 'Optimal one-dimensional coverage by unreliable sensors'. Together they form a unique fingerprint.

    Cite this