{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:26:14Z","timestamp":1725564374091},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205456"},{"type":"electronic","value":"9783540400318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40031-8_23","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:03:50Z","timestamp":1283727830000},"page":"345-359","source":"Crossref","is-referenced-by-count":2,"title":["Perimeter Search Performance"],"prefix":"10.1007","author":[{"given":"Carlos Linares","family":"L\u00f3pez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Junghanns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/322003.322004","volume":"24","author":"D. Champeaux de","year":"1977","unstructured":"de Champeaux, D., Sint, L.: An improved bidirectional heuristic search algorithm. Journal of the Association for Computing Machinery\u00a024, 177\u2013191 (1977)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1613\/jair.460","volume":"7","author":"H. Kaindl","year":"1997","unstructured":"Kaindl, H., Kainz, G.: Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research\u00a07, 283\u2013317 (1997)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/322358.322360","volume":"30","author":"D. Champeaux de","year":"1983","unstructured":"de Champeaux, D.: Bidirectional heuristic search again. Journal of the Association for Computing Machinery\u00a030, 22\u201332 (1983)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Pohl, I.: Bi-directional and heuristic search in path problems. Stanford University (1969), SLAC Report 104","DOI":"10.2172\/4785039"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0004-3702(89)90069-6","volume":"38","author":"J. Kwa","year":"1989","unstructured":"Kwa, J.: BS*: An admissible bidirectional staged heuristic search algorithm. Artificial Intelligence\u00a038, 95\u2013109 (1989)","journal-title":"Artificial Intelligence"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P. Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics\u00a04, 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"23_CR7","first-page":"9","volume":"37","author":"P. Hart","year":"1972","unstructured":"Hart, P., Nilsson, N., Raphael, B.: Correction to a formed basis for the heuristic determination of minimum cost paths. SIGART Newsletter\u00a037, 9 (1972)","journal-title":"SIGART Newsletter"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90040-X","volume":"65","author":"J. Dillenburg","year":"1994","unstructured":"Dillenburg, J., Nelson, P.: Perimeter search. Artificial Intelligence\u00a065, 165\u2013178 (1994)","journal-title":"Artificial Intelligence"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0004-3702(95)00017-9","volume":"75","author":"G. Manzini","year":"1995","unstructured":"Manzini, G.: BIDA*: An improved perimeter search algorithm. Artificial Intelligence\u00a075, 347\u2013360 (1995)","journal-title":"Artificial Intelligence"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. Korf","year":"1985","unstructured":"Korf, R.: Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence\u00a027, 97\u2013109 (1985)","journal-title":"Artificial Intelligence"},{"key":"23_CR11","first-page":"305","volume-title":"Fifteenth National Conference of the American Association for Artificial Intelligence (AAAI 1998)","author":"R. Korf","year":"1998","unstructured":"Korf, R., Reid, M.: Complexity analysis of admissible heuristic search. In: Fifteenth National Conference of the American Association for Artificial Intelligence (AAAI 1998), pp. 305\u2013310. AAAI Press, Menlo Park (1998)"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0004-3702(01)00094-7","volume":"129","author":"R. Korf","year":"2001","unstructured":"Korf, R., Reid, M., Edelkamp, S.: Time complexity of iterative-deepening-A*. Artificial Intelligence\u00a0129, 199\u2013218 (2001)","journal-title":"Artificial Intelligence"},{"key":"23_CR13","unstructured":"Junghanns, A.: Pushing the Limits: New Developments in Single-Agent Search. PhD thesis, University of Alberta (1999)"},{"key":"23_CR14","volume-title":"Heuristics \u2013 Intelligent Search Strategies for Computer Problem Solving","author":"J. Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics \u2013 Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Co., Reading (1984)"},{"key":"23_CR15","unstructured":"Linares, C.: Caracterizaci\u00f3n de los modelos de b\u00fasqueda de un agente con descripciones generalizadas de los nodos origen y destino. PhD thesis, Facultad de Inform\u00e1tica. Universidad Polit\u00e9cnica de Madrid (2001)"},{"key":"23_CR16","first-page":"299","volume-title":"Fifteenth National Conference of the American Association for Artificial Intelligence (AAAI 1998)","author":"S. Edelkamp","year":"1998","unstructured":"Edelkamp, S., Korf, R.: The branching factor of regular search spaces. In: Fifteenth National Conference of the American Association for Artificial Intelligence (AAAI 1998), pp. 299\u2013304. AAAI Press, Menlo Park (1998)"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40031-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T21:17:30Z","timestamp":1559596650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40031-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205456","9783540400318"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40031-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}