Over the past few years, point-based POMDP solvers scaled up to produce approximate solutions to mid-sized domains. However, to solve real world problems, solvers must exploit the structure of the domain. In this paper we focus on the topological structure of the problem, where the state space contains layers of states. We present here the Topological Order Planner (TOP) that utilizes the topological structure of the domain to compute belief space trajectories. TOP rapidly produces trajectories focused on the solveable regions of the belief space, thus reducing the number of redundant backups considerably. We demonstrate TOP to produce good quality policies faster than any other pointbased algorithm on domains with sufficient structure.

Authors

• Jilles Steeve Dibangoye
• Guy Shani MSAI, Microsoft & Ben Gurion University of the Negev
• Brahim Chaib-draa
• Abdel-illah Mouaddib Université de Caen Basse Normandie

Keywords

No keywords are indexed for this paper.