Faster Heuristic Search Algorithms for Planning with Uncertainty and Full Feedback
Blai Bonet, Héctor Geffner · 2003
Recent algorithms like RTDP and LAO* combine the strength of Heuristic Search (HS) and Dynamic Programming (DP) methods by exploiting knowledge of the initial state and an admissible heuristic function for producing optimal policies without evaluating the entire space. In this paper, we introduce and analyze three new HS/DP algorithms.