Coverage, Exploration, and Deployment by a Mobile Robot and Communication Network

We consider the problem of coverage and exploration of an unknown dynamic environment using a mobile robot(s). The environment is assumed to be large enough such that constant motion by the robot(s) is needed to cover the environment. We present an efficient minimalist algorithm which assumes that global information is not available (neither a map, nor GPS). Our algorithm deploys a network of radio beacons which assists the robot(s) in coverage. This network is also used for navigation. The deployed network can also be used for applications other than coverage. Simulation experiments are presented which show the collaboration between the deployed network and mobile robot(s) for the tasks of coverage/exploration, network deployment and maintenance (repair), and mobile robot(s) recovery (homing behavior). We present a theoretical basis for our algorithm on graphs and show the results of the simulated scenario experiments.

• Type: Conference
• Year: 2003
• Where: IPSN
• Authors: Maxim A. Batalin, Gaurav S. Sukhatme
• Keywords: Deployed Network, Efficient Minimalist Algorithm, IPSN 2003, Sensor Networks, Unknown Dynamic Environment