Cart (Loading....) | Create Account
Close category search window

A simple asymptotically optimal randomized algorithm for decentralized blanket coverage self-deployment of mobile robotic sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Savkin, A.V. ; Sch. of Electr. Eng. & Telecommun., Univ. of New South Wales, Sydney, NSW, Australia ; Javed, F. ; Matveev, A.S. ; Zhiyu Xi

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.

Published in:

Control Applications (CCA), 2012 IEEE International Conference on

Date of Conference:

3-5 Oct. 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.