{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T20:30:12Z","timestamp":1718656212899},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T00:00:00Z","timestamp":1207008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s10472-009-9126-9","type":"journal-article","created":{"date-parts":[[2009,3,10]],"date-time":"2009-03-10T09:43:02Z","timestamp":1236678182000},"page":"281-305","source":"Crossref","is-referenced-by-count":23,"title":["A framework for multi-robot node coverage in sensor networks"],"prefix":"10.1007","volume":"52","author":[{"given":"Andrea","family":"Gasparri","sequence":"first","affiliation":[]},{"given":"Bhaskar","family":"Krishnamachari","sequence":"additional","affiliation":[]},{"given":"Gaurav S.","family":"Sukhatme","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,3,11]]},"reference":[{"key":"9126_CR1","unstructured":"Arkin, E., Fekete, S., Mitchell, J.: The lawnmower problem. In: 5th Canadian Conf. on Computational Geometry, Waterloo, August 1993"},{"key":"9126_CR2","unstructured":"Colegrave, J., Branch, A.: A case study of autonomous household vacuum cleaner. In: AIAA\/NASA CIRFFSS, Houston, 20\u201324 March 1994"},{"key":"9126_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013279, Society of Photo-Optical Instrumentation Engineers, Bellingham, Feb. 1994","DOI":"10.1117\/12.167503"},{"key":"9126_CR4","doi-asserted-by":"crossref","unstructured":"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\u20131163, Taipei, September 2003","DOI":"10.1109\/ROBOT.2003.1241749"},{"issue":"1","key":"9126_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1016639210559","volume":"31","author":"H Choset","year":"2001","unstructured":"Choset, H.: Coverage for robotics\u2014a survey of recent results. Ann. Math. Artif. Intell. 31(1), 113\u2013126 (2001)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1\u20132","key":"9126_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0925-7721(00)00015-8","volume":"17","author":"EM Arkin","year":"2000","unstructured":"Arkin, E.M., Fekete, S.P., Mitchell, J.S.B.: Approximation algorithms for lawn mowing and milling. Comput. Geom. 17(1\u20132), 25\u201350 (2000)","journal-title":"Comput. Geom."},{"key":"9126_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1016639210559","volume":"31","author":"H Choset","year":"2001","unstructured":"Choset, H.: Coverage for robotics\u2014a survey of recent results. Ann. Math. Artif. Intell. 31, 113\u2013126 (2001)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1\u20134","key":"9126_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1016610507833","volume":"31","author":"Y Gabriely","year":"2001","unstructured":"Gabriely, Y., Rimon, E.: Spanning-tree based coverage of continuous areas by a mobile robot. Ann. Math. Artif. Intell. 31(1\u20134), 77\u201398 (2001)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9126_CR9","doi-asserted-by":"crossref","unstructured":"Hazon, N., Kaminka, G.A.: Redundancy, efficiency, and robustness in multi-robot coverage. In: ICRA 2005, Barcelona, 18\u201322 April 2005","DOI":"10.1109\/ROBOT.2005.1570205"},{"key":"9126_CR10","unstructured":"Agmon, N., Hazon, N., Kaminka, G.A.: Constructing spanning trees for efficient multi-robot coverage. In: ICRA 2006, Orlando, 15\u201319 May 2006"},{"key":"9126_CR11","unstructured":"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\u20132429, Orlando, May 2006"},{"key":"9126_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013720, Barcelona, 18\u201322 April 2005","DOI":"10.1109\/ROBOT.2005.1570202"},{"key":"9126_CR13","unstructured":"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)"},{"key":"9126_CR14","doi-asserted-by":"crossref","unstructured":"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 \u201804. 2004 IEEE, vol.\u00a04, pp. 3462\u20133468. IEEE, Piscataway (2004)","DOI":"10.1109\/ROBOT.2004.1308789"},{"key":"9126_CR15","doi-asserted-by":"crossref","unstructured":"Kurabayashi, D., Ota, J., Yoshida, E.: An algorithm of dividing a work area to multiple mobile robots. In: IROS \u201995: Proceedings of the International Conference on Intelligent Robots and Systems, vol. 2, p. 2286. IEEE Computer Society, Washington, DC (1995)","DOI":"10.1109\/IROS.1995.526174"},{"key":"9126_CR16","unstructured":"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\u2013385. IEEE, Piscataway (1998)"},{"key":"9126_CR17","unstructured":"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"},{"key":"9126_CR18","unstructured":"Zheng, X., Jain, S., Koenig, S., Kempe, D.: Multi-robot forest coverage. In: IROS 2005, Edmonton, 2\u20136 August 2005"},{"issue":"5","key":"9126_CR19","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1109\/70.795795","volume":"15","author":"I Wagner","year":"1999","unstructured":"Wagner, I., Lindenbaum, M., Bruckstein, A.: Distributed covering by ant-robots using evaporating traces. IEEE Trans. Robot. Autom. 15(5), 918\u2013933 (1999)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"9126_CR20","doi-asserted-by":"crossref","unstructured":"Batalin, M., Sukhatme, G.: Spreading out: a local approach to multi-robot coverage. In: 6th International Symposium on Distributed Autonomous Robotic Systems, pp. 373\u2013382 (2002)","DOI":"10.1007\/978-4-431-65941-9_37"},{"key":"9126_CR21","doi-asserted-by":"crossref","unstructured":"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\u2013665. IEEE, Piscataway (2002)","DOI":"10.1109\/ISIC.2002.1157841"},{"issue":"4","key":"9126_CR22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1177\/027836402320556368","volume":"21","author":"EU Acar","year":"2002","unstructured":"Acar, E.U., Choset, H.: Sensor-based coverage of unknown environments: incremental construction of morse decompositions. Int. J. Rob. Res. 21(4), 345\u2013366 (2002)","journal-title":"Int. J. Rob. Res."},{"key":"9126_CR23","doi-asserted-by":"crossref","unstructured":"Choset, H., Pignon, P.: Coverage path planning: the boustrophedon cellular decomposition. In: International Conference on Field and Service Robotics, Canberra, Australia (1997)","DOI":"10.1007\/978-1-4471-1273-0_32"},{"key":"9126_CR24","doi-asserted-by":"crossref","unstructured":"Butler, Z., Rizzi, A., Hollis, R.: Contact sensor-based coverage of rectilinear environments. In: IEEE Int\u2019l Symposium on Intelligent Control, September 1999, pp. 266\u2013271. IEEE, Piscataway (1999)","DOI":"10.1109\/ISIC.1999.796666"},{"key":"9126_CR25","volume-title":"Digraphs: Theory, Algorithms and Applications. Springer Monographs in Mathematics","year":"2000","unstructured":"Bang-Jensen, J., Gutin, G. (eds.): Digraphs: Theory, Algorithms and Applications. Springer Monographs in Mathematics. Springer, London (2000)"},{"key":"9126_CR26","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(82)90015-7","volume":"9","author":"T Volgenant","year":"1982","unstructured":"Volgenant, T., Jonker, R.: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation. Eur. J. Oper. Res. 9, 83\u201389 (1982)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9126_CR27","first-page":"745","volume":"6","author":"M Diaby","year":"2007","unstructured":"Diaby, M.: The traveling salesman problem: a linear programming formulation. WSEAS Trans. Math. 6(6), 745\u2013754 (2007)","journal-title":"WSEAS Trans. Math."},{"issue":"4","key":"9126_CR28","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7(4), 326\u2013329 (1960)","journal-title":"J. ACM"},{"key":"9126_CR29","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/mnsc.10.2.225","volume":"10","author":"LL Karg","year":"1964","unstructured":"Karg, L.L., Thompson, G.L.: A heuristic approach to traveling salesman problems. Manage. Sci. 10, 225\u2013248 (1964)","journal-title":"Manage. Sci."},{"issue":"3","key":"9126_CR30","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D., Stearns, R., Lewis, P.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"key":"9126_CR31","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Graduate School of Industrial Administration, CMU, Tech. Rep. 388 (1976)"},{"key":"9126_CR32","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, G.: Scheduling of vehicles from a central depot to number of delivery points. Oper. Res. 12, 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"9126_CR33","unstructured":"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)"},{"issue":"4598","key":"9126_CR34","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"9126_CR35","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","volume":"7","author":"H Muhlenbein","year":"1988","unstructured":"Muhlenbein, H., Georges-Schleuter, M., Kramer, O.: Evolution algorithms in combinatorial optimization. Parallel Comput. 7, 65\u201385 (1988)","journal-title":"Parallel Comput."},{"issue":"4","key":"9126_CR36","first-page":"431","volume":"2","author":"M Budinich","year":"1995","unstructured":"Budinich, M.: Neural networks for the travelling salesman problem. J. Artif. Neural Netw. 2(4), 431\u2013435 (1995)","journal-title":"J. Artif. Neural Netw."},{"issue":"1","key":"9126_CR37","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9126_CR38","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0167-8191(89)90106-3","volume":"10","author":"J Allwright","year":"1989","unstructured":"Allwright, J., Carpenter, D.: A distributed implementation of simulated annealing for the traveling salesman problem. Parallel Comput. 10, 335\u2013338 (1989)","journal-title":"Parallel Comput."},{"issue":"4","key":"9126_CR39","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/S0167-739X(99)00134-X","volume":"17","author":"GA Sena","year":"2001","unstructured":"Sena, G.A., Megherbi, D., Isern, G.: Implementation of a parallel genetic algorithm on a cluster of workstations: traveling salesman problem, a case study. Future Gener. Comput. Syst. 17(4), 477\u2013488 (2001)","journal-title":"Future Gener. Comput. Syst."},{"key":"9126_CR40","doi-asserted-by":"crossref","unstructured":"Tsch\u00f6ke, S., L\u00fcling, R., Monien, B.: Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. In: IPPS \u201995: Proceedings of the 9th International Symposium on Parallel Processing, pp. 182\u2013189. IEEE Computer Society, Washington, DC (1995)","DOI":"10.1109\/IPPS.1995.395930"},{"issue":"3","key":"9126_CR41","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega Int. J. Manag. Sci. 34(3), 209\u2013219 (2006)","journal-title":"Omega Int. J. Manag. Sci."},{"issue":"2","key":"9126_CR42","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1023\/B:TELS.0000029038.31947.d1","volume":"26","author":"M Batalin","year":"2004","unstructured":"Batalin, M., Sukhatme, G.S.: Coverage, exploration and deployment by a mobile robot and communication network. Telecommun. Syst. J. 26(2), 181\u2013196 (2004) (special issue on Wireless Sensor Networks)","journal-title":"Telecommun. Syst. J."},{"issue":"4","key":"9126_CR43","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1109\/TRO.2007.903809","volume":"23","author":"M Batalin","year":"2007","unstructured":"Batalin, M., Sukhatme, G.S.: The design and analysis of an efficient local algorithm for coverage and exploration based on sensor network deployment. IEEE Trans. Robot. 23(4), 661\u2013675 (2007)","journal-title":"IEEE Trans. Robot."},{"key":"9126_CR44","unstructured":"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)"},{"issue":"4","key":"9126_CR45","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"J Beasley","year":"1983","unstructured":"Beasley, J.: Route first\u2014cluster second methods for vehicle routing. Omega 11(4), 403\u2013408 (1983)","journal-title":"Omega"},{"key":"9126_CR46","unstructured":"Kim, Y., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: NSDI\u201905: Proceedings of the 2nd Conference on Symposium on Networked Systems Design & Implementation, pp. 16\u201316. USENIX Association, Berkeley (2005)"},{"key":"9126_CR47","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/1182807.1182819"},{"issue":"5","key":"9126_CR48","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1057\/jors.1986.86","volume":"37","author":"G Laporte","year":"1986","unstructured":"Laporte, G.: Generalized subtour elimination constraints and connectivity constraints. J. Oper. Res. Soc. 37(5), 509\u2013514 (1986)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9126-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-009-9126-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9126-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:51:52Z","timestamp":1559152312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-009-9126-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":48,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["9126"],"URL":"https:\/\/doi.org\/10.1007\/s10472-009-9126-9","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}