{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:12:28Z","timestamp":1780585948507,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642318993","type":"print"},{"value":"9783642319006","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31900-6_32","type":"book-chapter","created":{"date-parts":[[2012,7,28]],"date-time":"2012-07-28T03:22:28Z","timestamp":1343445748000},"page":"248-256","source":"Crossref","is-referenced-by-count":5,"title":["Hierarchical Path-Finding Based on Decision Tree"],"prefix":"10.1007","author":[{"given":"Yan","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lan-Ming","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen-Liang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","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, 100\u2013107 (1968)","DOI":"10.1109\/TSSC.1968.300136"},{"key":"32_CR2","unstructured":"Patrick, L.: A* Path-finding for Beginners, http:\/\/www.policyalmanac.org\/games\/aStarTutorial.html (updated July 18, 2005)"},{"issue":"1-2","key":"32_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S. Koening","year":"2004","unstructured":"Koening, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artificial Intelligence Journal\u00a0155(1-2), 93\u2013146 (2004)","journal-title":"Artificial Intelligence Journal"},{"key":"32_CR4","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1613\/jair.2994","volume":"39","author":"D. Kenny","year":"2010","unstructured":"Kenny, D., Nash, A., Koenig, S.: Theta*: Any-Angle Path Planning on Grids. Journal of Artificial Intelligence Research\u00a039, 533\u2013579 (2010)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Samet, H.: An overview of Quad trees, Octrees, and Related hierarchical data structures. NATO ASI Series, vol.\u00a040, pp. 51\u201368 (1988)","DOI":"10.1007\/978-3-642-83539-1_2"},{"key":"32_CR6","unstructured":"Yahja, A., Stentz, A., Singh, S., et al.: Framed-Quad tree path planning for mobile robots operating in sparse environments. In: Proceedings of IEEE Conference on Robotics and Automation (ICRA), Leuven, Belgium (May 1998)"},{"key":"32_CR7","unstructured":"Choset, H., Lynch, K.M., Hutchinson, S., et al.: Principles of Robot Motion. MIT Press (2004)"},{"key":"32_CR8","unstructured":"Demyen, D., Buro, M.: Efficient triangulation-based path-finding. In: Proceedings of AAAI (2006)"},{"key":"32_CR9","unstructured":"Sturtevant, N., Buro, M.: Partial pathfinding using map abstraction and refinement. In: Proceedings of AAAI, pp. 1392\u20131397 (2005)"},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1613\/jair.2293","volume":"30","author":"V. Bulitko","year":"2007","unstructured":"Bulitko, V., Sturtevant, N.: Graph abstraction in real-time heuristic search. Journal of Artificial Intelligence Research\u00a030, 51\u2013100 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"32_CR11","first-page":"7","volume":"1","author":"A. Botea","year":"2004","unstructured":"Botea, A., Muller, M., Schaeffer, J.: Near optimal hierarchical path-finding. Journal of Game Development\u00a01, 7\u201328 (2004)","journal-title":"Journal of Game Development"},{"key":"32_CR12","unstructured":"Rabin, S.: A* Aesthetic Optimizations. Game Programming Gems, 264\u2013271 (2000)"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Jansen, M.R., Buro, M.: HPA* Enhancements. In: Proceedings of the Third Artificial Intelligence and Interactive Digital Entertainment Conference, Stanford, California, USA, pp. 84\u201387 (2007)","DOI":"10.1609\/aiide.v3i1.18791"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Harabor, D., Botea, A.: Hierarchical path planning for multi-size agents in heterogeneous environments. In: IEEE Symposium on Computational Intelligence and Games, pp. 258\u2013265 (2008)","DOI":"10.1109\/CIG.2008.5035648"},{"key":"32_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1613\/jair.279","volume":"4","author":"J.R. Quinlan","year":"1996","unstructured":"Quinlan, J.R.: Improved use of continuous attributes in C4.5. Journal of Artificial Intelligence Research\u00a04, 77\u201390 (1996)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"32_CR16","volume-title":"Classification and Regression Tree","author":"L. Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., et al.: Classification and Regression Tree. Wadsworth International Group, Monterey (1984)"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Knowledge Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31900-6_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T18:54:32Z","timestamp":1687632872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31900-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318993","9783642319006"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31900-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}