Approximate planning in POMDPs via MDP heuristic
Yong Hua Lin, Xingjia Lu, Fillia S. Makedon · 2014
MDP heuristic based POMDP algorithms have been considered as simple, fast, but imprecise solutions. This paper provides a novel MDP heuristic value iteration algorithm for POMDPs. Besides the help of MDP, our algorithm utilizes a weighted graph model for the belief point approximation and reassignment, to further improve the efficiency and decrease the space complexity. Experimental results indicate our algorithm is fast and has high solution quality for POMDP problems.