Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments

Authors:
Eduardo Mesa Barrameda;Shantanu Das;Nicola Santoro
Affiliations:
Universidad de La Habana, Cuba;ETH Zurich, Switzerland;Carleton University, Canada
Venue:
Algorithmic Aspects of Wireless Sensor Networks
Year:
2008

Citing 11
Cited 0

Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

SIAM Journal on Computing
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks

Autonomous Robots
Formation of a geometric pattern with a mobile wireless sensor network

Journal of Robotic Systems
Gathering of asynchronous robots with limited visibility

Theoretical Computer Science
Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots

SIAM Journal on Computing
Energy optimal data propagation in wireless sensor networks

Journal of Parallel and Distributed Computing
Self-deployment of mobile sensors on a ring

Theoretical Computer Science
Local algorithms for autonomous robot systems

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Models and algorithms for wireless sensor networks (smart dust)

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Lattice formation in mobile autonomous sensor arrays

SAB'04 Proceedings of the 2004 international conference on Swarm Robotics
Energy-efficient deployment of Intelligent Mobile sensor networks

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of uniformly dispersing mobile robotic sensors in a simply connected orthogonal space of unknown shape. The mobile sensors are injected into the space from one or more entry points and rely only on sensed local information within a restricted radius. Unlike the existing solution, we allow the sensors to be asynchronous and show how, even in this case, the sensors can uniformly fill the unknown space, avoiding any collisions and without using any explicit communication, endowed with only O (1) bits of persistent memory and O (1) visibility radius. Our protocols are memory- and radius- optimal; in fact, we show that filling is impossible without persistent memory (even if visibility is unlimited); and that it is impossible with less visibility than that used by our algorithms (even if memory is unbounded).