{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:30:17Z","timestamp":1736573417947,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540384823"},{"type":"electronic","value":"9783540384830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11839088_13","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T14:22:12Z","timestamp":1156515732000},"page":"144-155","source":"Crossref","is-referenced-by-count":3,"title":["Covering a Continuous Domain by Distributed, Limited Robots"],"prefix":"10.1007","author":[{"given":"Eliyahu","family":"Osherovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred M.","family":"Bruckstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Yanovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1016688707365","volume":"31","author":"V. Yanovski","year":"2001","unstructured":"Yanovski, V., Wagner, I.A., Bruckstein, A.M.: Vertex-ant-walk - A robust method for efficient exploration of faulty graphs. Annals of Mathematics and Artificial Intelligence\u00a031(1-4), 99\u2013112 (2001)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/BF03024195","volume":"15","author":"A.M. Bruckstein","year":"1993","unstructured":"Bruckstein, A.M.: Why the ant trails look so straight and nice. The Mathematical Intelligencer\u00a015(2), 58\u201362 (1993)","journal-title":"The Mathematical Intelligencer"},{"key":"13_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-10306-7","volume-title":"The Ants!","author":"B. H\u00f6lldobler","year":"1990","unstructured":"H\u00f6lldobler, B., Wilson, E.O.: The Ants! Harvard University Press, Cambridge (1990)"},{"key":"13_CR4","doi-asserted-by":"crossref","DOI":"10.1515\/9781400856848","volume-title":"Spatial orientation : the spatial control of behavior in animals and man.","author":"H. Sch\u00f6ne","year":"1984","unstructured":"Sch\u00f6ne, H.: Spatial orientation: the spatial control of behavior in animals and man. Princeton University Press, Princeton (1984)"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Trans. on Systems, Man, and Cybernetics\u2013Part B\u00a026(1), 29\u201341 (1996)","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics\u2013Part B"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. Artificial Life\u00a05(2), 137\u2013172 (1999)","journal-title":"Artificial Life"},{"issue":"1-4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1016666118983","volume":"31","author":"I.A. Wagner","year":"2001","unstructured":"Wagner, I.A., Bruckstein, A.M.: From ants to a(ge)nts: A special issue on ant-robotics. Annals of Mathematics and Artificial Intelligence\u00a031(1-4), 1\u20135 (2001)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1038\/scientificamerican0300-72","volume":"282","author":"E. Bonabeau","year":"2000","unstructured":"Bonabeau, E., Th\u00e9raulaz, G.: Swarm smarts. Scientific American\u00a0282(3), 72\u201379 (2000)","journal-title":"Scientific American"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Russell, R.A.: Ant trails - an example for robots to follow? In: ICRA, pp. 2698\u20132703 (1999)","DOI":"10.1109\/ROBOT.1999.774005"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1145\/375735.376463","volume-title":"AGENTS 2001: Proceedings of the fifth international conference on Autonomous agents","author":"S. Koenig","year":"2001","unstructured":"Koenig, S., Liu, Y.: Terrain coverage with ant robots: a simulation study. In: AGENTS 2001: Proceedings of the fifth international conference on Autonomous agents, pp. 600\u2013607. ACM Press, New York (2001)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Blum, M., Sakoda, W.: On the capability of finite automata in 2 and 3 dimensional space. In: Ann. Symp. on Foundations in Computer Science, pp. 147\u2013161 (1977)","DOI":"10.1109\/SFCS.1977.20"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Blum, M., Kozen, D.: On the power of the compass. In: Proc. 19th Ann. Symp. on Foundations in Computer Science, pp. 132\u2013142 (1978)","DOI":"10.1109\/SFCS.1978.30"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/276698.276759","volume-title":"STOC 1998: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing","author":"M.A. Bender","year":"1998","unstructured":"Bender, M.A., Fern\u00e1ndez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: exploring and mapping directed graphs. In: STOC 1998: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 269\u2013278. ACM Press, New York (1998)"},{"key":"13_CR14","first-page":"219","volume-title":"Proceedings of the 4th Israel Symposium on Theory of Computing and Systems, ISTCS 1996","author":"I.A. Wagner","year":"1996","unstructured":"Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Smell as a computational resource \u2014 A lesson we can learn from the ant. In: Proceedings of the 4th Israel Symposium on Theory of Computing and Systems, ISTCS 1996, Jerusalem, Israel, June 10-12, pp. 219\u2013230. IEEE Computer Society Press, Los Alamitos-Washington-Brussels-Tokyo (1996)"},{"issue":"1-4","key":"13_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1018957401093","volume":"24","author":"I.A. Wagner","year":"1998","unstructured":"Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Efficiently searching a graph by a smell-oriented vertex process. Annals of Mathematics and Artificial Intelligence\u00a024(1-4), 211\u2013223 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1177\/027836498600500106","volume":"5","author":"O. Khatib","year":"1986","unstructured":"Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots. The International Journal of Robotics Research\u00a05(1), 90\u201398 (1986)","journal-title":"The International Journal of Robotics Research"},{"key":"13_CR17","unstructured":"Zelinsky, A., Byrne, J.C., Jarvis, R.A.: Planning paths of complete coverage of an unstructured environment by a mobile robot. In: International Conference on Advanced Robotics (ICAR) (1993)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Choset, H., Pignon, P.: Coverage path planning: The boustrophedon decomposition. In: International Conference on Field and Service Robotics (1997)","DOI":"10.1007\/978-1-4471-1273-0_32"},{"key":"13_CR19","unstructured":"Butler, Z.J.: Distributed coverage of rectilinear environments. PhD thesis, Carnegie Mellon University (2000)"},{"issue":"7-8","key":"13_CR20","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1177\/02783649030227002","volume":"22","author":"E.U. Acar","year":"2003","unstructured":"Acar, E.U., Choset, H., Zhang, Y., Schervish, M.J.: Path planning for robotic demining: Robust sensor-based coverage of unstructured environments and probabilistic methods. I. J. Robotic Res.\u00a022(7-8), 441\u2013466 (2003)","journal-title":"I. J. Robotic Res."},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Wagner, Lindenbaum, Bruckstein: MAC vs. PC: Determinism and randomness as complementary approaches to robotic exploration of continuous unknown domains. ROBRES: The International Journal of Robotics Research\u00a019 (2000)","DOI":"10.1177\/02783640022066716"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Gage, D.W.: Randomized search strategies with imperfect sensors. In: Chun, W.H., Wolfe, W.J. (eds.) Proc. SPIE, vol.\u00a02058, pp. 270\u2013279 (1994)","DOI":"10.1117\/12.167503"}],"container-title":["Lecture Notes in Computer Science","Ant Colony Optimization and Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11839088_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T15:39:40Z","timestamp":1736523580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11839088_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540384823","9783540384830"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11839088_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}