An Incremental Self-Deployment Algorithm for Mobile Sensor Networks

This paper describes an incremental deployment algorithm for mobile sensor networks. A mobile sensor network is a distributed collection of nodes, each of which has sensing, computation, communication and locomotion capabilities. The algorithm described in this paper will deploy such nodes one-at-a-time into an unknown environment, with each node making use of information gathered by previously deployed nodes to determine its deployment location. The algorithm is designed to maximize network ‘coverage’ while simultaneously ensuring that nodes retain line-of-sight relationships with one another. This latter constraint arises from the need to localize the nodes in an unknown environment: in our previous work on team localization (A. Howard, M.J. Matarić, and G.S. Sukhatme, in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, EPFL, Switzerland, 2002; IEEE Transactions on Robotics and Autonomous Systems, 2002) we have shown how nodes can localize themselves by using other nodes as landmarks. This paper describes the incremental deployment algorithm and presents the results from an extensive series of simulation experiments. These experiments serve to both validate the algorithm and illuminate its empirical properties.

[1]  Alexander Zelinsky,et al.  A mobile robot exploration algorithm , 1992, IEEE Trans. Robotics Autom..

[2]  Gaurav S. Sukhatme,et al.  Team Localization: A Maximum Likelihood Approach , 2002 .

[3]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4]  Gaurav S. Sukhatme,et al.  Most valuable player: a robot device server for distributed control , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[5]  Gaurav S. Sukhatme,et al.  An incremental deployment algorithm for mobile robot teams , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[6]  Tucker R. Balch,et al.  Behavior-based coordination of large-scale robot formations , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[7]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

[8]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[9]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[10]  Gregory Dudek,et al.  Graph-Based Exploration using Multiple Robots , 2000, DARS.

[11]  Josep Amat,et al.  Map Generation by Cooperative Low-Cost Robots in Structured Unknown Environments , 1998, Auton. Robots.

[12]  Gaurav S. Sukhatme,et al.  Landmark-based Matching Algorithm for Cooperative Mapping by Autonomous Robots , 2000, DARS.

[13]  Alan C. Schultz,et al.  Mobile robot exploration and map-building with continuous localization , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[14]  Gaurav S. Sukhatme,et al.  Relaxation on a mesh: a formalism for generalized localization , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[15]  Brian Yamauchi,et al.  A frontier-based approach for autonomous exploration , 1997, Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97. 'Towards New Computational Principles for Robotics and Automation'.

[16]  Maja J. Matarić,et al.  Cover Me! A Self-Deployment Algorithm for Mobile Sensor Networks , 2001 .

[17]  Maja J. Mataric,et al.  Robot formations using only local sensing and control , 2001, Proceedings 2001 IEEE International Symposium on Computational Intelligence in Robotics and Automation (Cat. No.01EX515).

[18]  Wolfram Burgard,et al.  Coordination for Multi-Robot Exploration and Mapping , 2000, AAAI/IAAI.

[19]  David W. Payton,et al.  Pheromone Robotics , 2001, Auton. Robots.

[20]  Alberto Elfes,et al.  Sonar-based real-world mapping and navigation , 1987, IEEE J. Robotics Autom..

[21]  Deborah Estrin,et al.  Adaptive beacon placement , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[22]  Wolfram Burgard,et al.  Robust Monte Carlo localization for mobile robots , 2001, Artif. Intell..

[23]  Alan F. T. Winfield,et al.  Distributed Sensing and Data Collection via Broken Ad Hoc Wireless Connected Networks of Mobile Robots , 2000, DARS.

[24]  Wolfram Burgard,et al.  Collaborative multi-robot exploration , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[25]  Frank E. Schneider,et al.  Motion Coordination in Formations of Multiple Mobile Robots Using a Potential Field Approach , 2000, DARS.

[26]  Gaurav S. Sukhatme,et al.  Localization for mobile robot teams using maximum likelihood estimation , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[27]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[28]  Douglas W. Gage,et al.  Command Control for Many-Robot Systems , 1992 .

[29]  Wolfram Burgard,et al.  A real-time algorithm for mobile robot mapping with applications to multi-robot and 3D mapping , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).