{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T04:26:02Z","timestamp":1745209562254,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421856"},{"type":"electronic","value":"9783540453246"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45324-5_6","type":"book-chapter","created":{"date-parts":[[2007,7,23]],"date-time":"2007-07-23T02:35:42Z","timestamp":1185158142000},"page":"76-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Adaptive Path Planner for Highly Dynamic Environments"],"prefix":"10.1007","author":[{"given":"Jacky","family":"Baltes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Hildreth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Antonio Bicchi, Giuseppe Casalino, and Corrado San tilli. Planning shortest bounded-curvature paths for a class of nonholomic vehicles among obstacles. In Proceedings of the IEEE International Conference on Robotics and Automation, pages 1349\u20131354, 1995.","DOI":"10.1109\/ROBOT.1995.525466"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Kristian J. Hammond. Case Based Planning. Academic Press Inc., 1989.","DOI":"10.1016\/B978-0-12-322060-8.50018-8"},{"key":"6_CR3","unstructured":"Nicholas Hildreth. Adaptive path planning for real-time systems. Master\u2019s thesis, University of Auckland, July 2000."},{"key":"6_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J.C. Latombe","year":"1991","unstructured":"J.C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"J.A. Reeds and R.A. Shepp. Optimal paths for a car that goes both forward and backward.Pacific Journal of Mathematics, 145(2), 1990.","DOI":"10.2140\/pjm.1990.145.367"},{"key":"6_CR6","first-page":"598","volume-title":"A rtificial Intelligence: A Modern Approach","author":"S. Russel","year":"1995","unstructured":"Stuart Russel and Peter Norvig. A rtificial Intelligence: A Modern Approach, chapter 20, pages 598\u2013624. Prentice-Hall Inc., Englewood Cliffs, New Jersey 07632, 1995."}],"container-title":["Lecture Notes in Computer Science","RoboCup 2000: Robot Soccer World Cup IV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45324-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:29:32Z","timestamp":1737322172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45324-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421856","9783540453246"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45324-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"20 September 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}