Field D^*: An interpolation-based path planner and replanner

DOI10.1007/978-3-540-48113-3_22zbMATH Open1209.68553OpenAlexW1585104299MaRDI QIDQ3564070FDOQ3564070

Authors: Dave Ferguson, Anthony Stentz 

Publication date: 2 June 2010

Published in: Springer Tracts in Advanced Robotics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-48113-3_22

Recommendations

• Using interpolation to improve path planning: The Field D* algorithm
• Theta\(^*\): any-angle path planning on grids
• scientific article; zbMATH DE number 426008
• scientific article; zbMATH DE number 4174372
• scientific article; zbMATH DE number 5488832

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Cited In (3)

• Fast optimal and bounded suboptimal Euclidean pathfinding
• Using interpolation to improve path planning: The Field D* algorithm
• Theta\(^*\): any-angle path planning on grids

This page was built for publication: Field D\(^*\): An interpolation-based path planner and replanner

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564070)