{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:37:09Z","timestamp":1725568629573},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169571"},{"type":"electronic","value":"9783642169588"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16958-8_8","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T12:26:12Z","timestamp":1288700772000},"page":"70-81","source":"Crossref","is-referenced-by-count":1,"title":["Scalable Precomputed Search Trees"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Lau","sequence":"first","affiliation":[]},{"given":"James","family":"Kuffner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Branicky, M.S., Knepper, R.A., Kuffner, J.: Path and trajectory diversity: Theory and algorithms. In: Int\u2019l Conf. on Robotics and Automation (May 2008)","DOI":"10.1109\/ROBOT.2008.4543392"},{"key":"8_CR2","unstructured":"Chestnutt, J., Kuffner, J., Nishiwaki, K., Kagami, S.: Planning biped navigation strategies in complex environments. In: Proceedings of the 2003 Intl. Conference on Humanoid Robots (October 2003)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Erickson, L., LaValle, S.: Survivability: Measuring and ensuring path diversity. In: IEEE International Conference on Robotics and Automation (2009)","DOI":"10.1109\/ROBOT.2009.5152773"},{"key":"8_CR4","unstructured":"Green, C., Kelly, A.: Toward optimal sampling in the space of paths. In: 13th Intl. Symposium of Robotics Research (November 2007)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Kavraki, L.E., Svestka, P., Claude Latombe, J., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration space. Int\u2019l Transactions on Robotics and Automation, 566\u2013580 (1996)","DOI":"10.1109\/70.508439"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Knepper, R.A., Mason, M.: Empirical sampling of path sets for local area motion planning. In: International Symposium on Experimental Robotics. IFRR (July 2008)","DOI":"10.1007\/978-3-642-00196-3_52"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Lau, M., Kuffner, J.J.: Behavior planning for character animation. In: 2005 ACM SIGGRAPH \/ Eurographics Symposium on Computer Animation, pp. 271\u2013280 (August 2005)","DOI":"10.1145\/1073368.1073408"},{"key":"8_CR8","unstructured":"Lau, M., Kuffner, J.J.: Precomputed search trees: Planning for interactive goal-driven animation. In: 2006 ACM SIGGRAPH \/ Eurographics Symposium on Computer Animation, pp. 299\u2013308 (September 2006)"},{"key":"8_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"S.M. LaValle","year":"2006","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006), http:\/\/planning.cs.uiuc.edu\/"},{"key":"8_CR10","unstructured":"Lavalle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: Progress and prospects. Algorithmic and Computational Robotics: New Directions, 293\u2013308 (2001)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Leven, P., Hutchinson, S.: A framework for real-time path planning in changing environments. Intl. J. Robotics Research (2002)","DOI":"10.1177\/0278364902021012001"},{"key":"8_CR12","volume-title":"Artificial Intelligence: A Modern Approach","author":"S. Russell","year":"2002","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs (2002)"}],"container-title":["Lecture Notes in Computer Science","Motion in Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16958-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T21:29:05Z","timestamp":1559770145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16958-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169571","9783642169588"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16958-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}