A hybridized planner for stochastic domains

  • Authors:

  • Mausam;Piergiorgio Bertoli;Daniel S. Weld

  • Affiliations:

  • Dept. of Computer Sc. and Engg., University of Washington, Seattle, WA;ITC-IRST, Povo, Trento, Italy;Dept. of Computer Sc. and Engg., University of Washington, Seattle, WA

  • Venue:
  • IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Markov Decision Processes are a powerful framework for planning under uncertainty, but current algorithms have difficulties scaling to large problems. We present a novel probabilistic planner based on the notion of hybridizing two algorithms. In particular, we hybridize GPT, an exact MDP solver, with MBP, a planner that plans using a qualitative (nondeterministic) model of uncertainty. Whereas exact MDP solvers produce optimal solutions, qualitative planners sacrifice optimality to achieve speed and high scalability. Our hybridized planner, HYBPLAN, is able to obtain the best of both techniques -- speed, quality and scalability. Moreover, HYBPLAN has excellent anytime properties and makes effective use of available time and memory.