Skip to main content

Exhaustive geographic search with mobile robots along space-filling curves

  • Conference paper
  • First Online:
Collective Robotics (CRW 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1456))

Included in the following conference series:

Abstract

Swarms of mobile robots can be tasked with searching a geographic region for targets of interest, such as buried land mines. We assume that the individual robots are equipped with sensors tuned to the targets of interest, that these sensors have limited range, and that the robots can communicate with one anotlier to enable cooperation. I low can a swarnl of cooperating sensate robots efficiently search a given geographic region for targets in the absence of a priori information about the targets' locations? Many of the “obvious” approaches are inefficient or lack robustness. One efficient approach is to have the robots traverse a space filling curve. For many geographic search applications, this method is energy-frugal, highly robust, and provides guaranteed coverage in a finite time that decreases as the reciprocal of the number of robots sharing the search task. Furthermore, control is inherently decentralized and requires very little robot-to-robot communication for the robots to organize their movements. This report presents some preliminary results from applying the Hilbert space-filling curve to geographic search by mobile robots.

Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under Contract DE-AC04 94AL85000.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bially, T. Space-Filling Curves: Their Generation and Their Application to Bandwidth Reduction. IEEE Transactions on Information Theory, V 15 No. 6, November 1969, pp. 658–664.

    Google Scholar 

  2. Cao, U., Fukunaga, A., Kahng, A., and Meng, F. 1995. Cooperative mobile robotics: Antecedents and directions. Proc. of IEEE/RSJ IROS, pp. 226–234.

    Google Scholar 

  3. Choset, H., and Pignon, P., Coverage Path Planning: The Boustrophedon Cellular Decomposition. International Conference on Field and Service Robotics, Canberra, Australia, 1997. Also available at http://voronoi.sbp.ri.cmu.edu/~Choset

    Google Scholar 

  4. Gage, D., How to communicate to zillions of robots. Mobile Robots VIII, SPIE, 250–257, 1993.

    Google Scholar 

  5. Gilbert, W., A Cube-Filling Hilbert Curve, http://math.uwaterloo.ca/~wgilbert/Research/HilbertCurve/HilbertCurve.html

    Google Scholar 

  6. Goldsmith, S., and Robinett, R. Collaborative Search by Mobile Robots, Part I. Problem Definition. Sandia National Laboratories Technical Report. Preprint at http://www.sandia.gov/aisl/robotics/collaboration.

    Google Scholar 

  7. Goldsmith, S., and Robinett, R., Collective Search by Mobile Robots Using Alpha-Beta Coordination. Collective Robotics Workshop `98, Agent World, Paris, 1998.

    Google Scholar 

  8. Bert, S., Tiwari, S., and Lumelsky, V. A Terrain-Covering Algorithm for an AUV. Autonomous Robots, 3:91–119, 1996.

    Google Scholar 

  9. Kesteloot, L. Fault-Tolerant Distributed Consensus. http://tofu.alt.net/~Ik/290.paper/290.paper.html

    Google Scholar 

  10. Kurabayashi, D., Ota, J., Arai, T. and Yoshida, E, Cooperative Sweeping by Multiple Mobile Robots, 1996 IEEE Intl. Conf on Robotics and Automation, pp. 1744–1749, 1996.

    Google Scholar 

  11. Lamport, L., Shostak, R., and Pease, M. The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems 4, 3 (July 1982), 382–401.

    Google Scholar 

  12. Moon, B., Jagadish, H. V., Faloutsos, C, and Saltz, J. Analysis of the Clustering Properties of of the Space-filling Curve, 1996 University of Maryland Technical Report CS-fR-361 1, http://www.cs,umd.edu/TR/UMCPCSD:CS-TR-3611

    Google Scholar 

  13. McWhorter, W., Fractint L-System Variations, http://spanky.triumf.ca/www/fractint/lsys/variations.html

    Google Scholar 

  14. Prusinkiewiez, P., Lindenmayer, A. and Fracchia, F. D., Synthesis of Space-filling Curves on the Square Grid. Fractals in the Fundamental and Applied Sciences, edited by Peitgen, H.-O. et al., Elsevier Science Publishers, 1991.

    Google Scholar 

  15. Russell, R. A., Heat Trails as Short-Lived Navigational Markers for Mobile Robots, 1997 IEEE Intl. Corlf on Robotics and Automation 1997, pp. 3534–3539, 1997.

    Google Scholar 

  16. Stevens, R. J., Lehar, A. F. and Perston, F. H. Manipulation and presentation of multidimensional image data using the Peano scan. IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-5(5) (1983) pp. 520–526.

    Google Scholar 

  17. Sagan, H. Space filling Curves, Springer-Verlag, New York 1994.

    Google Scholar 

  18. Weisstein, E., Random Walk: 2-D, http://www.astro.virginia.edu/~eww6n/math/RandomWalk:2-D.html

    Google Scholar 

  19. Weisstein, E., Hilbert Curve, http://www.astro.virginia.edu/~eww6n/math/HilbertCurve.html

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alexis Drogoul Milind Tambe Toshio Fukuda

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spires, S.V., Goldsmith, S.Y. (1998). Exhaustive geographic search with mobile robots along space-filling curves. In: Drogoul, A., Tambe, M., Fukuda, T. (eds) Collective Robotics. CRW 1998. Lecture Notes in Computer Science, vol 1456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033369

Download citation

  • DOI: https://doi.org/10.1007/BFb0033369

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64768-3

  • Online ISBN: 978-3-540-68723-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics