A framework for multi-robot node coverage in sensor networks

Annals of Mathematics and Artificial Intelligence

Volumn 52, Issue 2-4, 2008, Pages 281-305

  Gasparri, Andrea ^a   Krishnamachari, Bhaskar ^b   Sukhatme, Gaurav S ^c  

^a ROMA TRE UNIVERSITY   (Italy)

^b University of Southern California   (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Area coverage; Multi robot systems; Sensor networks

Indexed keywords

EID: 64749095011     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-009-9126-9     Document Type: Article

References (48)

1. Arkin, E., Fekete, S., Mitchell, J.: The lawnmower problem. In: 5th Canadian Conf. on Computational Geometry, Waterloo, August 1993
2. Colegrave, J., Branch, A.: A case study of autonomous household vacuum cleaner. In: AIAA/NASA CIRFFSS, Houston, 20-24 March 1994
3. Gage, D.W.: Randomized search strategies with imperfect sensors. In: Chun, W.H., Wolfe, W.J. (eds.) Presented at the Society of Photo-Optical Instrumentation Engineers (SPIE) Conference, Mobile Robots VIII, vol. 2058, pp. 270-279, Society of Photo-Optical Instrumentation Engineers, Bellingham, Feb. 1994
4. Pearce, A.L., Rybski, P.E., Stoeter, S.A., Papanikolopoulos, N.: Dispersion behaviors for a team of multiple miniature robots. In: International Conference on Robotics and Automation, ICRA-2003, pp. 1158-1163, Taipei, September 2003
5. H Choset 2001 Coverage for robotics-a survey of recent results Ann. Math. Artif. Intell. 31 1 113 126
6. EM Arkin SP Fekete JSB Mitchell 2000 Approximation algorithms for lawn mowing and milling Comput. Geom. 17 1-2 25 50
7. H Choset 2001 Coverage for robotics-a survey of recent results Ann. Math. Artif. Intell. 31 113 126
8. Y Gabriely E Rimon 2001 Spanning-tree based coverage of continuous areas by a mobile robot Ann. Math. Artif. Intell. 31 1-4 77 98
9. Hazon, N., Kaminka, G.A.: Redundancy, efficiency, and robustness in multi-robot coverage. In: ICRA 2005, Barcelona, 18-22 April 2005
10. Agmon, N., Hazon, N., Kaminka, G.A.: Constructing spanning trees for efficient multi-robot coverage. In: ICRA 2006, Orlando, 15-19 May 2006
11. Kong, C.S., Peng, N.A., Rekleitis, I.: Distributed coverage with multi-robot system. In: IEEE International Conference on Robotics and Automation, ICRA-2006, pp. 2423-2429, Orlando, May 2006
12. Shuzhi, S.G., Fua, C.: Complete multi-robot coverage of unknown environments with minimum repeated coverage. In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation, pp. 715-720, Barcelona, 18-22 April 2005
13. Rogge, J., Aeyels, D.: A novel strategy for exploration with multiple robots. In: Proceedings of the 4th International Conference on Informatics in Control, Automation and Robotics, Angers (2007)
14. Rekleitis, I., Lee-Shue, V., New, A.P., Choset, H.: Limited communication, multi-robot team based coverage. In: International Conference on Robotics and Automation, 2004. Proceedings, ICRA '04. 2004 IEEE, vol. 4, pp. 3462-3468. IEEE, Piscataway (2004)
15. Kurabayashi, D., Ota, J., Yoshida, E.: An algorithm of dividing a work area to multiple mobile robots. In: IROS '95: Proceedings of the International Conference on Intelligent Robots and Systems, vol. 2, p. 2286. IEEE Computer Society, Washington, DC (1995)
16. Min, T.W., Yin, H.K.: A decentralized approach for cooperative sweeping by multiple mobile robots. In: International Conference on Intelligent Robots and Systems, 1998. Proceedings, 1998 IEEE/RSJ, pp. 380-385. IEEE, Piscataway (1998)
17. Butler, Z., Rizzi, A., Hollis, R.: Distributed coverage of rectilinear environments. In: Peters, A.K. (eds.) Proc. of the Workshop on the Algorithmic Foundations of Robotics, January 2001
18. Zheng, X., Jain, S., Koenig, S., Kempe, D.: Multi-robot forest coverage. In: IROS 2005, Edmonton, 2-6 August 2005
19. I Wagner M Lindenbaum A Bruckstein 1999 Distributed covering by ant-robots using evaporating traces IEEE Trans. Robot. Autom. 15 5 918 933
20. Batalin, M., Sukhatme, G.: Spreading out: a local approach to multi-robot coverage. In: 6th International Symposium on Distributed Autonomous Robotic Systems, pp. 373-382 (2002)
21. Chaomin, L., Yang, S.: A real-time cooperative sweeping strategy for multiple cleaning robots. In: Proceedings of the 2002 IEEE International Symposium on Intelligent Control, pp. 660-665. IEEE, Piscataway (2002)
22. EU Acar H Choset 2002 Sensor-based coverage of unknown environments: incremental construction of morse decompositions Int. J. Rob. Res. 21 4 345 366
23. Choset, H., Pignon, P.: Coverage path planning: the boustrophedon cellular decomposition. In: International Conference on Field and Service Robotics, Canberra, Australia (1997)
24. Butler, Z., Rizzi, A., Hollis, R.: Contact sensor-based coverage of rectilinear environments. In: IEEE Int'l Symposium on Intelligent Control, September 1999, pp. 266-271. IEEE, Piscataway (1999)
25. Bang-Jensen, J., Gutin, G. (eds.): Digraphs: Theory, Algorithms and Applications. Springer Monographs in Mathematics. Springer, London (2000)
26. T Volgenant R Jonker 1982 A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation Eur. J. Oper. Res. 9 83 89
27. M Diaby 2007 The traveling salesman problem: a linear programming formulation WSEAS Trans. Math. 6 6 745 754
28. CE Miller AW Tucker RA Zemlin 1960 Integer programming formulation of traveling salesman problems J. ACM 7 4 326 329
29. LL Karg GL Thompson 1964 A heuristic approach to traveling salesman problems Manage. Sci. 10 225 248
30. D Rosenkrantz R Stearns P Lewis 1977 An analysis of several heuristics for the traveling salesman problem SIAM J. Comput. 6 3 563 581
31. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Graduate School of Industrial Administration, CMU, Tech. Rep. 388 (1976)
32. G Clarke G Wright 1964 Scheduling of vehicles from a central depot to number of delivery points Oper. Res. 12 568 581
33. Bock, F.: An algorithm for solving traveling-salesman and related network optimization problems. Unpublished Manuscript Associated with Talk Presented at the 14th ORSA National Meeting (1965)
34. S Kirkpatrick CD Gelatt MP Vecchi 1983 Optimization by simulated annealing Science 220 4598 671 680
35. H Muhlenbein M Georges-Schleuter O Kramer 1988 Evolution algorithms in combinatorial optimization Parallel Comput. 7 65 85
36. M Budinich 1995 Neural networks for the travelling salesman problem J. Artif. Neural Netw. 2 4 431 435
37. M Dorigo LM Gambardella 1997 Ant colony system: a cooperative learning approach to the traveling salesman problem IEEE Trans. Evol. Comput. 1 1 53 66
38. J Allwright D Carpenter 1989 A distributed implementation of simulated annealing for the traveling salesman problem Parallel Comput. 10 335 338
39. GA Sena D Megherbi G Isern 2001 Implementation of a parallel genetic algorithm on a cluster of workstations: traveling salesman problem, a case study Future Gener. Comput. Syst. 17 4 477 488
40. Tschöke, S., Lüling, R., Monien, B.: Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. In: IPPS '95: Proceedings of the 9th International Symposium on Parallel Processing, pp. 182-189. IEEE Computer Society, Washington, DC (1995)
41. T Bektas 2006 The multiple traveling salesman problem: an overview of formulations and solution procedures Omega Int. J. Manag. Sci. 34 3 209 219
42. M Batalin GS Sukhatme 2004 Coverage, exploration and deployment by a mobile robot and communication network Telecommun. Syst. J. 26 2 181 196 special issue on Wireless Sensor Networks
43. M Batalin GS Sukhatme 2007 The design and analysis of an efficient local algorithm for coverage and exploration based on sensor network deployment IEEE Trans. Robot. 23 4 661 675
44. Gasparri, A., Panzieri, S., Pascucci, F., Ulivi, G.: An interlaced kalm filter for sensors networks localization. Int. J. Sens. Netw. (IJSNet) (2007) (special issue on Interdisciplinary Design of Algorithms and Protocols in Wireless Sensor Networks)
45. J Beasley 1983 Route first-cluster second methods for vehicle routing Omega 11 4 403 408
46. Kim, Y., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: NSDI'05: Proceedings of the 2nd Conference on Symposium on Networked Systems Design & Implementation, pp. 16-16. USENIX Association, Berkeley (2005)
47. Kim, Y.J., Govindan, R., Karp, B., Shenker, S.: Lazy cross-link removal for geographic routing. In: Proceedings of the ACM Conference on Embedded Networked Sensor Systems (Sensys), Boulder, November 2006
48. G Laporte 1986 Generalized subtour elimination constraints and connectivity constraints J. Oper. Res. Soc. 37 5 509 514