{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T16:10:41Z","timestamp":1772727041768,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540481102","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-48113-3_22","type":"book-chapter","created":{"date-parts":[[2007,5,14]],"date-time":"2007-05-14T05:57:10Z","timestamp":1179122230000},"page":"239-253","source":"Crossref","is-referenced-by-count":104,"title":["Field D*: An Interpolation-Based Path Planner and Replanner"],"prefix":"10.1007","author":[{"given":"Dave","family":"Ferguson","sequence":"first","affiliation":[]},{"given":"Anthony","family":"Stentz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"O. Brock and O. Khatib. High-speed navigation using the global dynamic window approach. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 1999.","DOI":"10.1109\/ROBOT.1999.770002"},{"key":"22_CR2","volume-title":"3D Field D*","author":"J. Carsten","year":"2005","unstructured":"J. Carsten. 3D Field D*. Master\u2019s thesis, Carnegie Mellon University, Pittsburgh, PA, 2005."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"key":"22_CR4","unstructured":"D. Ferguson and A. Stentz. The Field D* Algorithm for Improved Path Planning and Replanning in Uniform and Non-uniform Cost Environments. Technical Report CMU-RI-TR-05-19, Carnegie Mellon School of Computer Science, 2005."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P. Hart","year":"1968","unstructured":"P. Hart, N. Nilsson, and B. Rafael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4:100\u2013107, 1968.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"22_CR6","unstructured":"A. Kelly. An Intelligent Predictive Control Approach to the High Speed Cross Country Autonomous Navigation Problem. PhD thesis, Carnegie Mellon University, 1995."},{"key":"22_CR7","unstructured":"S. Koenig and M. Likhachev. D* Lite. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 2002."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"S. Koenig and M. Likhachev. Improved fast replanning for robot navigation in unknown terrain. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2002.","DOI":"10.1109\/ROBOT.2002.1013481"},{"key":"22_CR9","unstructured":"S. Koenig and M. Likhachev. Incremental A*. In Advances in Neural Information Processing Systems. MIT Press, 2002."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"K. Konolige. A gradient method for realtime robot control. In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS), 2000.","DOI":"10.1109\/IROS.2000.894676"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"R. Larson. A survey of dynamic programming computational procedures. IEEE Transactions on Automatic Control, pages 767\u2013774, 1967.","DOI":"10.1109\/TAC.1967.1098755"},{"key":"22_CR12","volume-title":"Principles of Dynamic Programming, Part 2","author":"R. Larson","year":"1982","unstructured":"R. Larson and J. Casti. Principles of Dynamic Programming, Part 2. Marcel Dekker, New York, 1982."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"S. LaValle. Planning Algorithms. Cambridge University Press (also available at http:\/\/msl.cs.uiuc.edu\/planning\/), 2006. To be published in 2006.","DOI":"10.1017\/CBO9780511546877"},{"key":"22_CR14","unstructured":"M. Likhachev, D. Ferguson, G. Gordon, A. Stentz, and S. Thrun. Anytime Dynamic A*: An Anytime, Replanning Algorithm. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 2005."},{"key":"22_CR15","unstructured":"M. Likhachev, G. Gordon, and S. Thrun. ARA*: Anytime A* with provable bounds on sub-optimality. In Advances in Neural Information Processing Systems. MIT Press, 2003."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"J. Mitchell. Handbook of Computational Geometry, chapter Geometric Shortest Paths and Network Optimization, pages 633\u2013701. Elsevier Science, 2000.","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J. Mitchell","year":"1991","unstructured":"J. Mitchell and C. Papadimitriou. The weighted region problem: finding shortest paths through a weighted planar subdivision. Journal of the ACM, 38:18\u201373, 1991.","journal-title":"Journal of the ACM"},{"key":"22_CR18","unstructured":"N. Nilsson. Principles of Artificial Intelligence. Tioga Publishing Company, 1980."},{"key":"22_CR19","volume-title":"Motion Planning and Obstacle Avoidance for Mobile Robots in Highly Cluttered Dynamic Environments","author":"R. Philippsen","year":"2004","unstructured":"R. Philippsen. Motion Planning and Obstacle Avoidance for Mobile Robots in Highly Cluttered Dynamic Environments. PhD thesis, EPFL, Lausanne, Switzerland, 2004."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"R. Philippsen and R. Siegwart. An Interpolated Dynamic Navigation Function. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2005.","DOI":"10.1109\/ROBOT.2005.1570697"},{"issue":"6","key":"22_CR21","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1177\/027836499000900605","volume":"9","author":"N. Rowe","year":"1990","unstructured":"N. Rowe and R. Richbourg. An efficient Snell\u2019s-law method for optimal-path planning across two-dimensional irregular homogeneous-cost regions. International Journal of Robotics Research, 9(6):48\u201366, 1990.","journal-title":"International Journal of Robotics Research"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1073\/pnas.93.4.1591","volume":"93","author":"J. Sethian","year":"1996","unstructured":"J. Sethian. A fast marching level set method for monotonically advancing fronts. Applied Mathematics, Proceedings of the National Academy of Science, 93:1591\u20131595, 1996.","journal-title":"Proceedings of the National Academy of Science"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"S. Singh, R. Simmons, T. Smith, A. Stentz, V. Verma, A. Yahja, and K. Schwehr. Recent progress in local and global traversability for planetary rovers. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2000.","DOI":"10.1109\/ROBOT.2000.844761"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"C. Stachniss and W. Burgard. An integrated approach to goal-directed obstacle avoidance under dynamic constraints for dynamic environments. In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS), 2002.","DOI":"10.1109\/IRDS.2002.1041441"},{"issue":"2","key":"22_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF00735431","volume":"2","author":"A. Stentz","year":"1995","unstructured":"A. Stentz and M. Hebert. A complete navigation system for goal acquisition in unknown environments. Autonomous Robots, 2(2):127\u2013145, 1995.","journal-title":"Autonomous Robots"},{"key":"22_CR26","unstructured":"Anthony Stentz. The Focussed D* Algorithm for Real-Time Replanning. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1995."}],"container-title":["Springer Tracts in Advanced Robotics","Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48113-3_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:46:48Z","timestamp":1605743208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48113-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540481102"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48113-3_22","relation":{},"subject":[]}}