{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:20:32Z","timestamp":1758126032936,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642233203"},{"type":"electronic","value":"9783642233210"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23321-0_3","type":"book-chapter","created":{"date-parts":[[2011,8,19]],"date-time":"2011-08-19T22:17:17Z","timestamp":1313792237000},"page":"15-21","source":"Crossref","is-referenced-by-count":3,"title":["Smooth Path Algorithm Based on A* in Games"],"prefix":"10.1007","author":[{"given":"Xiang","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"17","key":"3_CR1","first-page":"238","volume":"23","author":"Z.H. Tao","year":"2007","unstructured":"Tao, Z.H., Hang, C.Y.: Path Finding Using A* Algorithm. Micro Computer Information\u00a023(17), 238\u2013240 (2007)","journal-title":"Micro Computer Information"},{"key":"3_CR2","unstructured":"Lester, P.: A* pathfinding for beginners (2005), \n                  \n                    http:\/\/www.policyalmanac.org\/games\/aStarTutoria.lhtm"},{"issue":"12","key":"3_CR3","first-page":"118","volume":"22","author":"C. Heping","year":"2005","unstructured":"Heping, C., Qianshao, Z.: Applicaion And Implementation of A*Agorithms in the Game Map Pathfinding. Computer Applications and Software\u00a022(12), 118\u2013120 (2005)","journal-title":"Computer Applications and Software"},{"key":"3_CR4","unstructured":"Lester, P.: Using Binary Heaps in A* Pathfinding (2003), \n                  \n                    http:\/\/www.policyalmanac.org\/games\/binaryHeaps.htm"},{"key":"3_CR5","unstructured":"Wei, S., Zhengda, M.: Smooth path design for mobile service robots based on improved A* algorithm. Journal of Southeast University (Natural Science Edition)\u00a040sup(I) (September 2010)"},{"key":"3_CR6","volume-title":"Game Programming Gems","author":"M. Deloura","year":"2000","unstructured":"Deloura, M.: Game Programming Gems. Charles River Media, Inc., London (2000)"},{"key":"3_CR7","volume-title":"AI Game Programming Wisdom","author":"F. Higgins Daniel","year":"2002","unstructured":"Higgins Daniel, F.: Pathfinding Design Architecture. In: AI Game Programming Wisdom. Charles River Media, London (2002)"}],"container-title":["Communications in Computer and Information Science","Advances in Computer Science, Environment, Ecoinformatics, and Education"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23321-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T22:15:41Z","timestamp":1558390541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23321-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642233203","9783642233210"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23321-0_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}