Skip to main content
Log in

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

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

We consider the problem of coverage and exploration of an unknown dynamic environment using a mobile robot. The environment is assumed to be large enough such that constant motion by the robot 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 in coverage. The network is also used by the robot for navigation. The deployed network can also be used for applications other than coverage (such as multi-robot task allocation). Simulation experiments are presented which show the collaboration between the deployed network and mobile robot for the tasks of coverage/exploration, network deployment and maintenance (repair), and mobile robot recovery (homing behavior). We discuss a theoretical basis for our algorithm on graphs and show the results of the simulated scenario experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M.A. Batalin and G.S. Sukhatme, Sensor coverage using mobile robots and stationary nodes, in: SPIE Conf. 4868 on Scalability and Traffic Control in IP Networks II (Disaster Recovery Networks), 2002, pp. 269–276.

  2. M.A. Batalin and G.S. Sukhatme, Spreading out: A local approach to multi-robot coverage, in: Proc. of the 6th Internat. Symposium on Distributed Autonomous Robotic Systems, Fukuoka, Japan, 2002, pp. 373–382.

  3. M.A. Batalin and G.S. Sukhatme, Sensor network-based multi-robot task allocation, in: Proc. of IEEE/RSJ Internat. Conf. on Intelligent Robots and Systems (IROS'03), Las Vegas, Nevada, 2003, to appear.

  4. M.A. Bender, A. Fernandez, D. Ron, A. Sahai and S. Vadhan, The power of a pebble: Exploring and mapping directed graphs, in: Annual ACM Symposium on Theory of Computing (STOC' 98), 1998.

  5. W. Burgard, D. Fox, M. Moors, R. Simmons and S. Thrun, Collaborative multirobot exploration, in: Proc. of IEEE Internat. Conf. on Robotics and Automation (ICRA), Vol. 1, 2000, pp. 476–481.

    Google Scholar 

  6. G. Dudek, M. Jenkin, E. Milios and D. Wilkes, Robotic exploration as graph construction, IEEE Transactions on Robotics and Automation 7(6) (1991) 859–865.

    Google Scholar 

  7. D.W. Gage, Command and control for many-robot systems, in: Nineteenth Annual AUVS Technical Symposium, Huntsville, Alabama, USA, 1992, pp. 22–24.

  8. A. Howard, M.J. Mataric and G.S. Sukhatme, Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem, in: Proc. of the 6th Internat. Symposium on Distributed Autonomous Robotic Systems, Fukuoka, Japan, 2002, pp. 299–308.

  9. S. Koenig and R.G. Simmons, Complexity analysis of real-time reinforcement learning applied to finding shortest paths in deterministic domains, Technical Report CMU-CS-93-106, School of Computer Science, Carnegie Mellon University, Pittsburg, PA (1992).

    Google Scholar 

  10. S. Koenig and R. Simmons, Easy and hard testbeds for real-time search algorithms, in: Proc. of National Conf. on Artificial Intelligence, 1996, pp. 279–285.

  11. Q. Li, M. DeRosa and D. Rus, Distributed algorithms for guiding navigation across a sensor network, Technical Report TR2002-435, Dartmouth, Computer Science Technical Report (2002).

  12. L. Lovasz, Random walks on graphs: A survey, in: Combinatorics, A volume dedicated to Paul Erdos, eds. D. Miklos, V.T. Sos and T. Szonyi (Janos Bolyai Math. Soc., Keszthely, Hungary, 1993) pp. 1–46.

    Google Scholar 

  13. M.J. Mataric, Behavior-based control: Examples from navigation, learning, and group behavior, Special Issue on Software Architectures for Physical Agents of Journal of Experimental and Theoretical Artificial Intelligence 9 (1997) 323–336.

    Google Scholar 

  14. J. O'Rourke, Art Gallery Theorems and Algorithms (Oxford Univ. Press, New York, 1987).

  15. P. Pirjanian, Behavior coordination mechanisms–state-of-the-art, Technical Report IRIS-99-375, Institute for Robotics and Intelligent Systems, University of Southern California (1999).

  16. K.S.J. Pister, J.M. Kahn and B.E. Boser, Smart dust: Wireless networks of millimeter-scale sensor nodes, Electronics Research Laboratory Research Summary (1999).

  17. B. Szymanski and S. Koenig, The complexity of node counting on undirected graphs, Technical Report, Computer Science Department, Rensselaer Technical Institute, Troy, NY (1998).

    Google Scholar 

  18. R. Vaughan, K. Stoy, G.S. Sukhatme and M.J. Matarić, Lost: Localization-space trails for robot teams, Special Issue on Multi-robot Systems of IEEE Transactions on Robotics and Automation 18 (2002) 796–812.

    Google Scholar 

  19. D.J. White, Markov Decision Process (Wiley, West Sussex, England, 1993).

    Google Scholar 

  20. B. Yamauchi, Frontier-based approach for autonomous exploration, in: Proc. of the IEEE Internat. Symposium on Computational Intelligence, Robotics and Automation, 1997, pp. 146–151.

  21. B. Yamauchi, A. Schultz and W. Adams, Mobile robot exploration and map-building with continuous localization, in: Proc. of the 1998 IEEE/RSJ Internat. Conf. on Robotics and Automation, Vol. 4, 1998, pp. 3175–3720.

    Google Scholar 

  22. A. Zelinsky, A mobile robot exploration algorithm, IEEE Transactions on Robotics and Automation 8 (1992) 707–717.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Batalin, M.A., Sukhatme, G.S. Coverage, Exploration and Deployment by a Mobile Robot and Communication Network. Telecommunication Systems 26, 181–196 (2004). https://doi.org/10.1023/B:TELS.0000029038.31947.d1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:TELS.0000029038.31947.d1

Navigation