{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T18:49:23Z","timestamp":1772304563440,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1023\/a:1018957401093","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"211-223","source":"Crossref","is-referenced-by-count":62,"title":["Efficiently searching a graph by a smell-oriented vertex process"],"prefix":"10.1007","volume":"24","author":[{"given":"Israel A.","family":"Wagner","sequence":"first","affiliation":[]},{"given":"Michael","family":"Lindenbaum","sequence":"additional","affiliation":[]},{"given":"Alfred M.","family":"Bruckstein","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"325514_CR1","doi-asserted-by":"crossref","unstructured":"R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz and C. Rakoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico (October 1979) pp. 218\u2013223.","DOI":"10.1109\/SFCS.1979.34"},{"key":"325514_CR2","doi-asserted-by":"crossref","unstructured":"G. Barnes and U. Feige, Short random walks on graphs, in: Proc. of the 25th ACM STOC (1993).","DOI":"10.1145\/167088.167275"},{"key":"325514_CR3","doi-asserted-by":"crossref","unstructured":"M. Blum and D. Kozen, On the power of the compass, or, Why mazes are easier to search than graphs, in: Proc. of FOCS' 78 (1978) pp. 132\u2013142.","DOI":"10.1109\/SFCS.1978.30"},{"key":"325514_CR4","doi-asserted-by":"crossref","unstructured":"M. Blum and W.J. Sakoda, On the capability of finite automata in 2-and 3-dimensional space, in: Proc. of FOCS' 77 (1977) pp. 147\u2013161.","DOI":"10.1109\/SFCS.1977.20"},{"issue":"2","key":"325514_CR5","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1137\/S0097539790190144","volume":"23","author":"A.Z. Broder","year":"1994","unstructured":"A.Z. Broder, A.R. Karlin, P. Raghavan and E. Upfal, Trading space for time in undirected s\u2013t connectivity, SIAM J. Comput. 23(2) (1994) 324\u2013334.","journal-title":"SIAM J. Comput."},{"key":"325514_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"M. Dorigo, V. Maniezzo and A. Colorni, The ant system: Optimization by a colony of cooperating agents, IEEE Trans. on Systems, Man, and Cybernetics \u2013 Part B 26 (1996) 29\u201341.","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics \u2013 Part B"},{"key":"325514_CR7","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even, Graph Algorithms (Computer Science Press, Rockville, MD, 1979)."},{"key":"325514_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.2307\/2688386","volume":"43","author":"A.S. Fraenkel","year":"1970","unstructured":"A.S. Fraenkel, Economic traversal of labyrinths, Math. Mag. 43 (1970) 125\u2013130, and a correction in 44 (1971) 12.","journal-title":"Math. Mag."},{"key":"325514_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1017\/S0269964800001625","volume":"4","author":"S. Gal","year":"1990","unstructured":"S. Gal and E.J. Anderson, Search in a maze, Probab. Engrg. Inform. Sci. 4 (1990) 311\u2013318.","journal-title":"Probab. Engrg. Inform. Sci."},{"key":"325514_CR10","unstructured":"C.V. Goldman and J.S. Rosenschein, Emergent coordination through the use of cooperative state-changing rules, in: Proc. of The National Conference on AI, Seattle, WA (August 1994) pp. 408\u2013413."},{"key":"325514_CR11","doi-asserted-by":"crossref","unstructured":"J. Hopcroft and R. Tarjan, Efficient algorithms for graph manipulation, Comm. ACM (1973) 372\u2013378.","DOI":"10.1145\/362248.362272"},{"key":"325514_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"R.E. Korf","year":"1990","unstructured":"R.E. Korf, Real-time heuristic search, Artificial Intelligence 42 (1990) 189\u2013211.","journal-title":"Artificial Intelligence"},{"key":"325514_CR13","doi-asserted-by":"crossref","unstructured":"S. Koenig and Y. Smirnov, Graph learning with a nearest neighbor approach, in: Proc. of COLT' 96, Desenzano del Garda, Italy (June 28\u2013July 1, 1996).","DOI":"10.1145\/238061.238065"},{"key":"325514_CR14","volume-title":"The Self-Avoiding Walk","author":"N. Madras","year":"1993","unstructured":"N. Madras and G. Slade, The Self-Avoiding Walk (Birkh\u00e4user, Basel, 1993)."},{"issue":"2","key":"325514_CR15","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1(2) (1972) 146\u2013160.","journal-title":"SIAM J. Comput."},{"key":"325514_CR16","first-page":"187","volume":"14","author":"G. Tarry","year":"1895","unstructured":"G. Tarry, Le problem des labyrinths, Nouvelles Annales de Mathematiques 14 (1895) 187.","journal-title":"Le problem des labyrinths, Nouvelles Annales de Mathematiques"},{"key":"325514_CR17","volume-title":"Handbook for Intelligent Control: Neural, Fuzzy and Adaptive Approaches","author":"S. Thrun","year":"1992","unstructured":"S. Thrun, The role of exploration in learning control, in: Handbook for Intelligent Control: Neural, Fuzzy and Adaptive Approaches (Van Nostrand Reinhold, Florence, KY, 1992)."},{"key":"325514_CR18","series-title":"Technical Report","volume-title":"Efficient Exploration in Reinforcement Learning","author":"S. Thrun","year":"1992","unstructured":"S. Thrun, Efficient Exploration in Reinforcement Learning, Technical Report CMU-CS-92-102, Carnegie-Mellon Univ., Pittsburgh, PA (1992)."},{"key":"325514_CR19","unstructured":"I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, Smell as a computational resource \u2013 a lesson we can learn from the ant, in: Proc. of ISTCS' 96 (1996) pp. 219\u2013230. Web accessible through: http:\/\/www.cs.technion.ac.il\/_wagner."},{"key":"325514_CR20","series-title":"Technical Report","volume-title":"Cooperative covering by ant-robots using evaporating traces","author":"I.A. Wagner","year":"1996","unstructured":"I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, Cooperative covering by ant-robots using evaporating traces, Technical Report CIS-9610, Center for Intelligent Systems, Technion, Haifa (April 1996); to appear in IEEE Trans. Robot. Autom."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018957401093.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018957401093\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018957401093.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:39:30Z","timestamp":1747546770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018957401093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":20,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["325514"],"URL":"https:\/\/doi.org\/10.1023\/a:1018957401093","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}