Strong planning under partial observability

  • Authors:

  • Piergiorgio Bertoli;Alessandro Cimatti;Marco Roveri;Paolo Traverso

  • Affiliations:

  • ITC-IRST, Via Sommarive, Povo, Trento, Italy;ITC-IRST, Via Sommarive, Povo, Trento, Italy;ITC-IRST, Via Sommarive, Povo, Trento, Italy;ITC-IRST, Via Sommarive, Povo, Trento, Italy

  • Venue:
  • Artificial Intelligence
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Rarely planning domains are fully observable. For this reason, the ability to deal with partial observability is one of the most important challenges in planning. In this paper, we tackle the problem of strong planning under partial observability in nondeterministic domains: find a conditional plan that will result in a successful state, regardless of multiple initial states, nondeterministic action effects, and partial observability.We make the following contributions. First, we formally define the problem of strong planning within a general framework for modeling partially observable planning domains. Second, we propose an effective planning algorithm, based on and-or search in the space of beliefs. We prove that our algorithm always terminates, and is correct and complete. In order to achieve additional effectiveness, we leverage on a symbolic, BDD-based representation for the domain, and propose several search strategies. We provide a thorough experimental evaluation of our approach, based on a wide selection of benchmarks. We compare the performance of the proposed search strategies, and identify a uniform winner that combines heuristic distance measures with mechanisms that reduce runtime uncertainty. Then, we compare our planner MBP with other state-of-the art-systems. MBP is able to outperform its competitor systems, often by orders of magnitude.