The Delayed D* Algorithm for Efficient Path Replanning

Mobile robots are often required to navigate environments for which prior maps are incomplete or inaccurate. In such cases, initial paths generated for the robots may need to be amended as new information is received that is in conflict with the original maps. The most widely used algorithm for performing this path replanning is Focussed Dynamic A* (D*), which is a generalization of A* for dynamic environments. D* has been shown to be up to two orders of magnitude faster than planning from scratch. In this paper, we present a new replanning algorithm that generates equivalent paths to D* while requiring about half its computation time. Like D*, our algorithm incrementally repairs previous paths and focusses these repairs towards the current robot position. However, it performs these repairs in a novel way that leads to improved efficiency.

Authors

• Dave Ferguson 0001
• Anthony Stentz

Keywords

• Delay
• Mobile robots
• Navigation
• Cost function
• Robot sensing systems
• Vehicle dynamics
• Path planning
• Vehicles
• Motion planning
• State-space methods
• Path Replanning
• Mobile Robot
• State Space
• Increase In Costs
• State Value
• Goal State
• Decrease In Costs
• Current Solution
• Optimal Path
• Map Information
• Key Values
• Lexicographic
• Starting State
• Updated Values
• Successor States
• Onboard Sensors
• Robot Navigation
• Solution Path
• State Cost
• Least Cost Path
• Priority Queue
• Multiple Phases
• Source Of Inefficiency
• Environmental Areas
• Changes In Conditions