{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:11:38Z","timestamp":1725559898920},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540278726"},{"type":"electronic","value":"9783540318828"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11527862_9","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T19:48:01Z","timestamp":1279655281000},"page":"121-133","source":"Crossref","is-referenced-by-count":12,"title":["Hierarchical Heuristic Search Revisited"],"prefix":"10.1007","author":[{"given":"Robert C.","family":"Holte","sequence":"first","affiliation":[]},{"given":"Jeffery","family":"Grajkowski","sequence":"additional","affiliation":[]},{"given":"Brian","family":"Tanner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Auer, A., Kaindl, H.: A case study of revisiting best-first vs. depth-first search. In: Proceedings of the Sixteenth European Conference on Artificial Intelligence (ECAI 2004), pp. 141\u2013145 (2004)","key":"9_CR1"},{"issue":"1-3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0166-218X(96)00069-8","volume":"71","author":"T. Chen","year":"1996","unstructured":"Chen, T., Skiena, S.: Sorting with fixed-length reversals. Discrete Applied Mathematics\u00a071(1-3), 269\u2013295 (1996); Special volume on computational molecular biology","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Culberson, J.C., Schaeffer, J.: Efficiently searching the 15-puzzle. Technical report, Department of Computer Science, University of Alberta (1994)","key":"9_CR3"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"J.C. Culberson","year":"1998","unstructured":"Culberson, J.C., Schaeffer, J.: Pattern databases. Computational Intelligence\u00a014(3), 318\u2013334 (1998)","journal-title":"Computational Intelligence"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.2307\/2318261","volume":"82","author":"H. Dweighter","year":"1975","unstructured":"Dweighter, H.: Problem e2569. American Mathematical Monthly\u00a082, 1010 (1975)","journal-title":"American Mathematical Monthly"},{"unstructured":"Edelkamp, S.: Planning with pattern databases. In: Proceedings of the 6th European Conference on Planning (ECP 2001), pp. 13\u201324 (2001)","key":"9_CR6"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/B:AIRE.0000007440.74721.fb","volume":"21","author":"A. Felner","year":"2004","unstructured":"Felner, A., Korf, R.E., Hanan, S.: Additive pattern database heuristics. Journal of Artificial Intelligence\u00a021, 1\u201339 (2004)","journal-title":"Journal of Artificial Intelligence"},{"unstructured":"Felner, A., Zahavi, U., Schaeffer, J., Holte, R.: Dual lookups in pattern databases. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI 2005 (2005)","key":"9_CR8"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"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\u00a04, 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"9_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-45153-6_19","volume-title":"Advances in Artificial Intelligence","author":"I.T. Hern\u00e1dv\u00f6lgyi","year":"2001","unstructured":"Hern\u00e1dv\u00f6lgyi, I.T.: Searching for macro operators with automatically generated heuristics. In: Stroulia, E., Matwin, S. (eds.) Canadian AI 2001. LNCS (LNAI), vol.\u00a02056, pp. 194\u2013203. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"Hern\u00e1dv\u00f6lgyi, I.T.: Solving the sequential ordering problem with automatically generated lower bounds. In: Proceedings of Operations Research 2003, Heidelberg, Germany, pp. 355\u2013362 (2003)","key":"9_CR11","DOI":"10.1007\/978-3-642-17022-5_46"},{"unstructured":"Holte, R.C., Perez, M.B., Zimmer, R.M., MacDonald, A.J.: Hierarchical A*: Searching abstraction hierarchies efficiently. In: Proc. Thirteenth National Conference on Artificial Intelligence (AAAI 1996), pp. 530\u2013535 (1996)","key":"9_CR12"},{"unstructured":"Holte, R.C., Newton, J., Felner, A., Meshulam, R.: Mutiple pattern databases. In: Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 122\u2013131 (2004)","key":"9_CR13"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence\u00a027, 97\u2013109 (1985)","journal-title":"Artificial Intelligence"},{"unstructured":"Korf, R.E.: Finding optimal solutions to Rubik\u2019s Cube using pattern databases. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI 1997), pp. 700\u2013705 (1997)","key":"9_CR15"},{"doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative pathfinding. In: Proceedings of the First Annual Conference on Artificial Intelligence and Interactive Entertainment (AIIDE 2005), pp. 117\u2013122 (2005)","key":"9_CR16","DOI":"10.1609\/aiide.v1i1.18726"},{"unstructured":"Zhou, R., Hansen, E.A.: Space-efficient memory-based heuristics. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI 2004), pp. 677\u2013682 (2004)","key":"9_CR17"}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11527862_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T06:24:22Z","timestamp":1685687062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11527862_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278726","9783540318828"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11527862_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}