{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:10:40Z","timestamp":1778253040898,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540226727","type":"print"},{"value":"9783540286462","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28646-2_36","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T15:30:21Z","timestamp":1285083021000},"page":"366-373","source":"Crossref","is-referenced-by-count":2,"title":["Large Pheromones: A Case Study with Multi-agent Physical A*"],"prefix":"10.1007","author":[{"given":"Ariel","family":"Felner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaron","family":"Shoshani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Israel A.","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred M.","family":"Bruckstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"36_CR1","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/3828.3830","volume":"32","author":"R. Dechter","year":"1985","unstructured":"Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of A*. Journal of the Association for Computing Machinery\u00a032(3), 505\u2013536 (1985)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE T-SMC, Part B\u00a026(1), 29\u201341","DOI":"10.1109\/3477.484436"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Felner, A., Stern, R., Ben-Yair, A., Kraus, S., Netanyahu, N.: Pha*: Finding the shortest path with a* in unknown physical environments. Accepted to JAIR (2003)","DOI":"10.1613\/jair.1373"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Felner, A., Stern, R., Kraus, S.: PHA*: Performing A* in unknown physical environments. In: Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems, Bologna, Italy, pp. 240\u2013247 (2002)","DOI":"10.1145\/544741.544800"},{"issue":"2","key":"36_CR5","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"SCC-4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics\u00a0SCC-4(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"36_CR6","volume-title":"Spatial Tessellations, Concepts, and Applications of Voronoi Diagrams","author":"A. Okabe","year":"1992","unstructured":"Okabe, A., Boots, B., Sugihara, K.: Spatial Tessellations, Concepts, and Applications of Voronoi Diagrams. Wiley, Chichester (1992)"},{"issue":"8","key":"36_CR7","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/S0167-739X(00)00045-5","volume":"16","author":"A. Wagner","year":"2000","unstructured":"Wagner, A., Bruckstein, A.M.: ANTS: Agents, networks, trees, and subgraphs. Future Generation Computer Systems Journal\u00a016(8), 915\u2013926 (2000)","journal-title":"Future Generation Computer Systems Journal"},{"issue":"1-4","key":"36_CR8","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"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00453-003-1030-9","volume":"37","author":"V.M. Yanovski","year":"2003","unstructured":"Yanovski, V.M., Wagner, I.A., Bruckstein, A.M.: A distributed ant algorithm for efficiently patrolling a network. Algorithmica\u00a037, 165\u2013186 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Ant Colony Optimization and Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28646-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:20:35Z","timestamp":1778250035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-28646-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226727","9783540286462"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28646-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}