POMHDP: Search-Based Belief Space Planning Using Multiple Heuristics


  • Sung-Kyun Kim Carnegie Mellon University
  • Oren Salzman Carnegie Mellon University
  • Maxim Likhachev Carnegie Mellon University


Robots operating in the real world encounter substantial uncertainty that cannot be modeled deterministically before the actual execution. This gives rise to the necessity of robust motion planning under uncertainty also known as belief space planning. Belief space planning can be formulated as Partially Observable Markov Decision Processes (POMDPs). However, computing optimal policies for non-trivial POMDPs is computationally intractable. Building upon recent progress from the search community, we propose a novel anytime POMDP solver, Partially Observable Multi-Heuristic Dynamic Programming (POMHDP), that leverages multiple heuristics to efficiently compute high-quality solutions while guaranteeing asymptotic convergence to an optimal policy. Through iterative forward search, POMHDP utilizes domain knowledge to solve POMDPs with specific goals and an infinite horizon. We demonstrate the efficacy of our proposed framework on a real-world, highly-complex, truck unloading application.




How to Cite

Kim, S.-K., Salzman, O., & Likhachev, M. (2021). POMHDP: Search-Based Belief Space Planning Using Multiple Heuristics. Proceedings of the International Conference on Automated Planning and Scheduling, 29(1), 734-744. Retrieved from https://ojs.aaai.org/index.php/ICAPS/article/view/3542