A minimalist algorithm for multirobot continuous coverage

IEEE Transactions on Robotics

Volumn 27, Issue 2, 2011, Pages 297-312

  Cannata, Giorgio ^a   Sgorbissa, Antonio ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

Ant like algorithms; coverage; distributed robot systems; real time search

Indexed keywords

ANT-LIKE ALGORITHMS; COMPUTATIONAL POWER; CONTINUOUS COVERAGE; CONTROLLED FREQUENCY; COVERAGE; DISTRIBUTED ROBOT SYSTEMS; FREQUENCY DISTRIBUTIONS; INTER-ROBOT COMMUNICATION; MEMORYLESS; MULTIROBOTS; REAL-TIME SEARCH; REAL-WORLD APPLICATION; ROBOT SWARMS;

ALGORITHMS; INDUSTRIAL ROBOTS;

REAL TIME SYSTEMS;

EID: 79953795676     PISSN: 15523098     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRO.2011.2104510     Document Type: Article

References (66)

1. Y. Elmaliach, N. Agmon, and G. Kaminka, "Multi-robot area patrol under frequency constraints," in Proc. IEEE Int. Conf. Robotics Automat., Apr. 2007, pp. 385-390. (Pubitemid 350140217)
2. R. Korf, "Real-time heuristic search," Artif. Intell., vol. 42, no. 2/3, pp. 189-211, 1990. (Pubitemid 20673782)
3. G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," IEEE Trans. Robotics Automat., vol. 7, no. 6, pp. 859-865, Dec. 1991. (Pubitemid 23563811)
4. S. Koenig, B. Szymanski, and Y. Liu, "Efficient and inefficient ant coverage methods," Ann. Math. Artif. Intell., vol. 31, no. 1-4, p. 4176, 2001.
5. I. Wagner, M. Lindenbaum, and A. Bruckstein, "Distributed covering by ant-robots using evaporating traces," IEEE Trans. Robotics Automat., vol. 15, no. 5, pp. 918-933, Oct. 1999. (Pubitemid 30514358)
6. V. Ziparo, A. Kleiner, B. Nebel, and D. Nardi, "RFID-based exploration for large robot teams," in Proc. IEEE Int. Conf. Robotics Automat., Apr. 2007, pp. 4606-4613. (Pubitemid 350140901)
7. A. Kleiner, J. Prediger, and B. Nebel, "Rfid technology-based exploration and slam for search and rescue," in Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst., Oct., 2006, pp. 4054-4059. (Pubitemid 46928561)
8. E. Ferranti and N. Trigoni, "Robot-assisted discovery of evacuation routes in emergency scenarios," in Proc. IEEE Int. Conf. Robotics Automat., May, 2008, pp. 2824-2830.
9. D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chains and Mixing Times. Providence, RI: Amer. Math. Soc., 2008.
10. A. F. Karr, "Markov chains and processes with a prescribed invariant measure," Stochastic Processes Appl., vol. 7, no. 3, pp. 277-290, 1978.
11. S. Ntafos, "Watchman routes under limited visibility," Comput. Geom. Theory Appl., vol. 1, no. 3, pp. 149-170, 1992.
12. E. Lawler, J. Lenstra, A. R. Kan, andD. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. NewYork: Wiley, 1985.
13. E. Arkin, S. Fekete, and J. Mitchell. (1997). Approximation algorithms for lawn mowing and milling. Math. Inst., Univ. Köln, Köln, Germany, Tech. Rep. 255. [Online]. Available: ftp.zpr.uni-koeln.de/pub/paper/zpr97- 255.ps.gz
14. H. Choset, "Coverage path planning: The boustrophedon cellular decomposition," in Proc. Int. Conf. Field Service Robotics, 1997.
15. I. Rekleitis, A. P. New, E. S. Rankin, and H. Choset, "Efficient boustrophedon multi-robot coverage: An algorithmic approach," Ann. Math. Artif. Intell., vol. 52, no. 2-4, pp. 109-142, Apr. 2008.
16. T. Min and H. Yin, "A decentralized approach for cooperative sweeping by multiple mobile robots," in Proc. IEEE Int. Conf. Intell. Robotics Syst., 1998, pp. 380-385.
17. W. Huang, "Optimal line-sweep-based decompositions for coverage algorithms," in Proc. IEEE Int. Conf. Robotics Automat., vol. 1, 2001, pp. 27-32. (Pubitemid 32815179)
18. Y. Guo, L. Parker, and R. Madhavan, "A mrobot system for continuous area sweeping tasks," in Proc. Int. Symp. Collaborative Technol. Syst., 2004, pp. 235-240.
19. M. Ahmadi and P. Stone, "A multi-robot system for continuous area sweeping tasks," in Proc. IEEE Int. Conf. Robotics Automat., May, 2006, pp. 1724-1729. (Pubitemid 44940318)
20. Z. Butler, A. Rizzi, and C. Butler, "Distributed coverage of rectilinear environments," in Proc. Workshop Algorithmic Found. Rob., Hanover, NH, 2001.
21. D. Kurabayashi, J. Ota, T. Arai, and E. Yoshida, "Cooperative sweeping by multiple mobile robots," in Proc. IEEE Int. Conf. Robotics Automat., 1996, vol. 2, pp. 1744-1749.
22. Y. Gabriely and E. Rimon, "Spanning-tree based coverage of continuous areas by a mobile robot.," Ann. Math. Artif. Intell., vol. 31, no. 1-4, pp. 77-98, 2001.
23. Y. Gabriely and E. Rimon, "Competitive on-line coverage of grid environments by a mobile robot," Comput. Geom. Theory Appl., vol. 24, no. 3, pp. 197-224, 2003. (Pubitemid 35418423)
24. X. Zheng, S. Jain, S. Koenig, and D. Kempe, "Multi-robot forest coverage,"in Proc. IEEE Int. Conf. Intell. Robotics Syst., 2005, pp. 3852-3857.
25. N. Hazon, F. Mieli, and G. Kaminka, "Towards robust on-line multi-robot coverage," in Proc. IEEE Int. Conf. Robotics Automat., 2006, pp. 1710- 1715. (Pubitemid 44940316)
26. C. Trevai, Y. Fukazawa, H. Yuasa, J. Ota, T. Arai, and H. Asama, "Exploration path generation for multiple mobile robots using reaction-diffusion equation on a graph," Integr. Comput.-Aided Eng., vol. 11, no. 3, pp. 195- 212, 2004.
27. S. S. Ge and C. Fua, "Complete multi-robot coverage of unknown environments with minimum repeated coverage," in Proc. IEEE Int. Conf. Rob. Autom., 2005, pp. 715-720. (Pubitemid 46083881)
28. C. Luo, S. Yang, and D. Stacey, "Real-time path planning with deadlock avoidance of multiple cleaning robots," in Proc. IEEE Int. Conf. Robotics Automat., vol. 3, 2003, pp. 4080-4085.
29. A. Marino, L. E. Parker, G. Antonelli, and F. Caccavale, "Behavioral control for multi-robot perimeter patrol:Afinite state automata approach," in Proc. IEEE Int. Conf. Robotics Automat., 2009, pp. 831-836.
30. T. D. Parsons, Pursuit Evasion in a Graph. New York: Springer-Verlag, 1976, pp. 426-441.
31. I. Suzuki and M. Yamashita, "Searching for a mobile intruder in a polygonal region," SIAM J. Comput., vol. 21, no. 5, pp. 863-888, 1992. (Pubitemid 23603832)
32. L. J. Guibas, J. claude Latombe, S. M. Lavalle, D. Lin, and R.Motwani, "A visibility-based pursuit-evasion problem," Int. J. Comput. Geom. Appl., vol. 9, pp. 471-494, 1996.
33. S. M. Lavalle and J. E. Hinrichsen, "Visibility-based pursuit-evasion: The case of curved environments,", vol. 17, no. 2, pp. 196-201, 1999.
34. S. Sachs, S. Rajko, and S. M. Lavalle, "Visibility-based pursuit-evasion in an unknown planar environment," Int. J. Robotics Res., vol. 23, no. 1, pp. 3-26, 2004. (Pubitemid 44616084)
35. N. Agmon, S. Kraus, and G. Kaminka, "Multi-robot perimeter patrol in adversarial settings," in Proc. IEEE Int. Conf. Robotics Automat., May,2008, pp. 2339-2345.
36. T. Sak, J. Wainer, and S. Goldenstein, "Probabilistic multiagent patrolling," in Proc. Adv. Artif. Intell. SBIA 2008, Lecture Notes Comput. Sci.. vol. 5249, Berlin, Germany: Springer, 2008, pp. 124-133.
37. F. Amigoni, N. Basilico, and N. Gatti, "Finding the optimal strategies for robotic patrolling with adversaries in topologically-represented environments,"in Proc. IEEE Int. Conf. Robotics Automat., 2009, pp. 819-824.
38. V. Isler, S. Kannan, and S. Khanna. (2005, Oct.)., "Randomized pursuit-evasion in a polygonal environment," IEEE Trans. Rob., vol. 5, no. 21, pp. 864-875. [Online]. Available: http://www.cs.rpi.edu/~isler/new/pub/pubs/ randpe-tro.pdf.
39. S. Koenig and R. Simmons, "Easy and hard testbeds for real-time search algorithms," in Proc. Nat. Conf. Artif. Intell., 1996, pp. 279-285.
40. A. Pirzadeh andW. Snyder, "A unified solution to coverage and search in explored and unexplored terrains using indirect control," in Proc. IEEEInt. Conf. Robotics Automat., vol. 3, May, 1990, pp. 2113-2119.
41. T. Balch, "Avoiding the past: A simple but effective strategy for reactive navigation," in Proc. IEEE Int. Conf. Robotics Automat.,May, 1993, vol. 1, pp. 678-685.
42. M. Bender, A. Fernández, D. Ron, A. Sahai, and S.Vadhan, "The power of a pebble: Exploring and mapping directed graphs," in STOC : Proc. 30th ACM Symp. Theory Comput.. New York: ACM, 1998, pp. 269-278.
43. D. Xiaotie and A. Mirzaian, "Competitive robot mapping with homogeneous markers," IEEE Trans. Robotics Automat., vol. 12, no. 4, pp. 532- 542, Aug. 1996. (Pubitemid 126774159)
44. I. Wagner, M. Lindenbaum, and A. Bruckstein, "Efficiently searching a graph by a smell-oriented vertex process," Ann. Math. Artif. Intell., vol. 24, no. 1-4, pp. 211-223, 1998. (Pubitemid 128404023)
45. A. Machado, G. Ramalho, J. Zucker, and A. Drogoul, "Multi-agent patrolling: An empirical analysis of alternative architectures," in Multi- Agent-Based Simulation II, Lecture Notes Computer Science. vol. 2581, Berlin, Germany: Springer, 2003, pp. 81-97.
46. J. Svennebring and S. Koenig, "Trail-laying robots for robust terrain coverage," in Proc. IEEE Int. Conf. Robotics Automat., vol. 1, Sep., 2003, pp. 75-82.
47. B. Grone and S. Pierce, "Extremal positive semidefinite doubly stochastic matrices," Linear Algebra Appl., vol. 150, pp. 107-117, 1991.
48. N. Shaked-Monderer and A. Berman, "More on extremal positive semidefinite doubly stochastic matrices," Linear Algebra Appl., vol. 167, pp. 17- 34, 1992.
49. R. Loewy, D. R. Shier, and C. R. Johnson, "Perron eigenvectors and the symmetric transportation polytope," Linear Algebra Appl., vol. 150, pp. 139-155, 1991.
50. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, "Equation of state calculations by fast computing machines," J Chem. Phys., vol. 21, no. 6, pp. 1087-1092, 1953.
51. E. C. MacRae, "Estimation of time-varying Markov processes with aggregate data," Econometrica, vol. 45, no. 1, pp. 183-198.
52. C. M. L. Kelton, "Estimation of time-independent Markov processes with aggregate data: A comparison of techniques," Econometrica, vol. 49, no. 2, pp. 517-518.
53. M. Mamei and F. Zambonelli, "Pervasive pheromone-based interaction with rfid tags," ACM Trans. Auton. Adapt. Syst., vol. 2, no. 2, p. 4, 2007.
54. M. Kim and N. Chong, "Rfid-based mobile robot guidance to a stationary target," Mechatronics, vol. 17, no. 4/5, pp. 217-229, 2007. (Pubitemid 46659822)
55. D. Hahnel, W. Burgard, D. Fox, K. Fishkin, and M. Philipose, "Mappingand localizationwith RFID technology," in Proc. IEEE Int. Conf. Robotics Automat., vol. 1, Apr./May 2004, pp. 1015-1020.
56. K. Tanaka, Y. Kimuro, K. Yamano, M. M. Hirayama, E. Kondo, and M. Matsumoto, "A Supervised learning approach to robot localization using a short-range RFID sensor," IEICE Trans. Inf. Syst., vol. E90-D, no. 11, pp. 1762-1771, 2007.
57. Vorwerk Group Website. (Mar. 2010). [Online]. Available: http://www.vorwerk-teppich.de/sc/vorwerk/rfid-en.html
58. M. Batalin and G. Sukhatme, "The analysis of an efficient algorithm for robot coverage and exploration based on sensor network deployment," in Proc. IEEE Int. Conf. Robotics Automat., pp. 3478-3485, Apr. 2005. (Pubitemid 46084323)
59. A.Kemppainen, T.Mäkelä, J. Haverinen, and J. Röning, "An experimental environment for optimal spatial sampling in a multi-robot system," in Proc. 10th Int. Conf. Intell. Autonom. Syst., W. Burgard, R. Dillmann, C. Plagemann, and N. Vahrenkamp, Eds., pp. 246-253, 2008.
60. T. Tammet, J. Vain, A. Kuusik, and A. Puusepp, "Rfid-based communication for a self-organizing robot swarm.," in Proc. 2nd IEEE Int. Conf. Self-Adapt. Self-Organizing Syst., Oct. 2008.
61. Eu fp6 Roboswarm Project Website. (Mar. 2010). [Online]. Available: http://www.roboswarm.eu
62. G. Bolch, S. Greiner, H. deMeer, and K. Trivedi, Queueing Networks and Markov Chains. Hoboken, NJ: Wiley, 1998.
63. M. Kijima, Markov Processes for Stochastic Modeling. Boston, MA/Boca Raton, FL: Chapman & Hall/CRC, Jan. 1997.
64. M. Baglietto, G. Cannata, F. Capezio, and A. Sgorbissa, "Multi-robot uniform frequency coverage of significant locations in the environment," in Proc. Distrib. Auton. Rob. Syst., H. Asama, H. Kurokawa, J. Ota, and K. Sekiyama, Eds. Berlin, Germany: Springer-Verlag, 2009, pp. 3-14.
65. S. Boyd, P. Diaconis, and L. Xiao, "Fastest mixing Markov chain on a graph," SIAM Rev., vol. 46, no. 4, pp. 667-689, 2004. (Pubitemid 40072140)
66. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, Cambridge, U.K., Mar. 2004.