Three methods are described for exploring a continuous unknown planar region by a group of robots having limited sensors and no explicit communication. We formalize the problem, prove that its off-line version is NP-hard, and show a lower bound on the length of any solution. Then a deterministic mark and cover (MAC) algorithm is described for the on-line problem using short-lived navigational markers as a means of navigation and indirect communication. The convergence of the algorithm is proved, and its cover time is shown to be the asymptotically optimal O(A/a), where A is the total area and a is the area covered by the robot in a single step. The MAC algorithm is tested against an alternative randomized probabilistic covering (PC) method, which does not rely on sensors but is still able to cover an unknown region in an expected time that depends polynomially on the dimensions of the region. Both algorithms enable cooperation of several robots to achieve faster coverage. Finally, we show that the two methods can be combined to yield a third, hybrid algorithm with a better trade-off between performance and robustness.
Get full access to this article
View all access options for this article.
References
1.
Aldous, D. J. 1991. Threshold limits for cover times . J. Theoret. Probabil.4(1): 197–211 .
Aleliunas, R., et al. 1979 (Oct. 29–31, San Juan, Puerto Rico). Random walks, universal traversal sequences, and the complexity of maze problems . Proc. of the 20th Annual Symp. on Found. of Comp. Science, pp. 218–223 .
4.
Arkin, E. M., and Hassin, R. 1994. Approximation algorithms for the geometric covering salesman problem . Discrete Applied Math.55: 197–218 .
5.
Baeza-Yates, R., Culberson, J. C., and Rawlins, G. J. E. 1993. Searching in the plane . Inform. Computation106(2): 234–252 .
6.
Baeza-Yates, R., and Schott, R. 1995. Parallel searching in the plane . Computational Geometry Theory Applications5: 143–154 .
7.
Balch, T., and Arkin, R. C. 1994. Communication in reactive multiagent robotic systems . Autonomous Robots1(1): 27–52 .
8.
Barnes, G., and Feige, U. 1993. (May 16-18, San Diego, CA). Short random walks on graphs . Proc. of the 25th ACM Symp. on Theory of Computing. New York: ACM, pp. 728–737 .
9.
Bar-Noy, A., et al. 1989. Bounds on universal sequences . SIAM J. Comp.18(2): 268–277 .
10.
Berger, M. 1987. Geometry II. Berlin-Heidelberg: Springer-Verlag .
11.
Bessiere, P., Ahuactzin, J. M., Talbi, E. G., and Mazer, E. 1995. The “Ariadne’s clew” algorithm: Global planning with local methods. Algorithmic Foundation of Robotics. Wellesley, MA: A. K. Peters , pp. 39–47.
12.
Bollobas, B. 1990. Graph Theory: An Introductory Course. Berlin-Heidlberg: Springer-Verlag .
13.
Borenstein, J., Everett, H. R., and Feng, L. 1996. Navigating Mobile Robots: Systems and Techniques. Wellesley, MA: A. K. Peters .
14.
Borenstein, J., and Feng, L. 1996. Measurement and correction of systematic odometry errors in mobile robots . IEEE Trans. Robot. Automat.12(6): 869–880 .
15.
Bridgland, M. F. 1987. Universal traversal sequences for paths and cycles . J. Algorithms8(3): 395–404 .
16.
Broder, A. Z., Karlin, A. R., Raghavan, P., and Upfal, E. 1994. Trading space for time in undirected s – t connectivity . SIAM J. Comp.23(2): 324–334 .
17.
Chandra, A. K. et al. 1997. The electrical resistance of a graph captures its commute and cover times . Computational Complexity6: 312–340 .
18.
Chin, W. P., and Ntafos S. 1986 (June 2–4, Yorktown Heights, NY). Optimum watchman routes . Proc. of the 2nd Annual Symp. on Computational Geometry, pp. 24–33 .
19.
Deng, X., and Mirzaian, A. 1996. Competitive robot mapping with homogeneous markers . IEEE Trans. Robot. Automat.12(4): 532–542 .
20.
Do-Carmo, M. P. 1976. Differential Geometry of Curves and Surfaces. Englewood Cliffs, NJ: Prentice-Hall .
21.
Dudek, G., Jenkin, M., Milios, E., and Wilkes, D. 1991. Robotic exploration as graph construction . IEEE Trans. Robot. Automat.7(6): 859–864 .
22.
Enge, P. et al. 1996. Wide-area augmentation of the global positioning system . Proc. IEEE84(8): 1063–1088 .
23.
Erdmann, M. 1992. Randomization in robot tasks . Intl. J. Robot. Res.11(5): 399–436 .
Feller, W. 1968. An Introduction to Probability Theory and Its Applications, third ed., vol. 1. New York: Wiley .
26.
Gage, D. W. 1993 (Sept. 9–10, Boston, MA). Randomized search strategies with imperfect sensors . Proc. of SPIE Mobile Robots VIII, vol. 2058, pp. 270–279 .
27.
Giralt, G., Weisbin, C. (eds.) 1995. Autonomous Robots2: 259–362 (special issue on autonomous robots for planetary exploration).
28.
Graham, R. L., Knuth, D. E., and Patashnik, O. 1991. Concrete Mathematics. Reading, MA: Addison-Wesley .
29.
Hall, P. 1988. Introduction to the Theory of Coverage Processes. New York: Wiley .
30.
Held, M. 1991. On the Computational Geometry of Pocket Machining, a vol. of Lecture Notes in Computer Science. Berlin-Heidelberg: Springer-Verlag .
31.
Hert, S., Tiwari, S., and Lumelsky, V. 1996. A terrain-covering algorithm for an AUV . Autonomous Robots3(2/3): 91–119 .
32.
Hofner, C., and Schmidt, G. 1995 Path planning and guidance techniques for an autonomous mobile cleaning robot . Robot. Autonomous Sys.14: 199–212 .
33.
Itai, A., Papadimitriou, C. H., and Szwarefiter, J. L. 1982. Hamilton paths in grid graphs . SIAM J. Comp.11(4): 676–686 .
Kershner, R. 1939. The number of circles covering a set . Am. J. Math.61: 665–671 .
36.
Kuipers, B., and Byun, Y. T. 1981. A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations . Robot. Autonomous Sys.8: 47–63 .
37.
LaValle, S. M., and Hutchinson, S. A. 1996. Evaluating motion strategies under nondeterministic or probabilistic uncertainties in sensing and control. Proc. of the 1996 IEEE Intl. Conf. on Robot. and Automat. Washington, DC: IEEE , pp. 3034–3039.
38.
Lovasz, L. 1996. Random walks on graphs: A survey. In Miklos, D., Sos, V. T., and Szony, T. (eds.): Combinatorics, Paul Erdös is Eighty, vol. 2. Budapest: Janos Bolyai Mathematical Society , pp. 353–398.
39.
Lumelsky, V. J., and Stepanov, A. A. 1987. Path-planning strategies for a point mobile automaton moving amidst un-known obstacles of arbitrary shape . Algorithmica2: 403–430 .
40.
Matthews, P. 1989. Covering problems for Brownian motion on spheres . Annals Probability16(1): 189–199 .
41.
Motwani, R., and Raghavan, P. 1995. Randomized Algorithms. Cambridge: Cambridge University Press .
42.
Ntafos, S. 1992. Watchman routes under limited visibility . Computational Geometry Theory Applications1: 149–170 .
43.
Parker, L. E. 1996. On the design of behavior-based multi-robot teams . Adv. Robot.10(6): 547–578 .
44.
Russell, R. A. 1995. Laying and sensing odor markings as a strategy for assisting mobile robot’s navigation tasks . IEEE Robot. Automat. Mag.2(3): 3–9 .
45.
Russell, R. A. 1997. Heat trails as short-lived navigational markers for mobile robots. Proc. of the 1997 IEEE Intl. Conf. on Robot. and Automat. Washington, DC: IEEE , pp. 3534–3539.
46.
Sagan, H. 1994. Space-Filling Curves. New York: Springer-Verlag .
47.
Singh, S., Hines, E. L., and Gardner, J. W. 1996. Fuzzy neural computing of coffee and tainted-water data from an electronic nose . Sensors Actuators (B)30: 185–190 .
48.
Traub, J. F., Wasilkowski, G. W., and Wozniakowski, H. 1988. Information-Based Complexity. San Diego, CA: Academic Press .
49.
Virgil, 1971. The Aeneid of Virgil, trans. by A. Mandelbaum. New York: Bantam Books .
Wagner, I. A., and Bruckstein, A. M. 1997. Cooperative cleaners: A study in ant robotics. In Paulraj, A., Roychowdhury, V., and Schaper, C. D. (eds.): Communications, Computation, Control, and Signal Processing: A Tribute to Thomas Kailath. The Netherlands: Kluwer Academic .
52.
Wagner, I. A., Lindenbaum, M., and Bruckstein, A. M. 1996 (June 10–12, Jerusalem). Smell as a computational resource—a lesson we can learn from the ant . Proc. of the 4th Israeli Symp. on the Theory of Comp. and Sys. (Also Technical Report CIS-9610, Center for Intelligent Systems, Technion, Haifa, April 1996.)
53.
Wagner, I. A., Lindenbaum, M., and Bruckstein, A. M. 1997 (July 28, Providence, RI). On-line graph searching by a smell-oriented vertex process . Working Notes from the AAAI’97 Workshop on On-Line Search, pp. 122–125 .
54.
Yaguchi, H. 1996. Robot introduction to cleaning work in the East Japan Railway Company . Adv. Robot.10(4): 403–414 .
