Abstract
We propose a novel distributed randomized algorithm for self-deployment of a network of mobile robotic sensors in the problem of blanket coverage. The aim is to deploy sensors in a bounded connected region so that any point of the region is sensed by at least one mobile robotic sensor. The proposed algorithm is based only on information about the closest neighbours of each sensor. The monitoring region is of an arbitrary shape and not known to the sensors a priori. We give mathematically rigorous proofs of asymptotic optimality and convergence with probability 1 of the proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
