Planning Graph Heuristics for Belief Space Search

Abstract

Some recent works in conditional planning have proposed reachability heuristics to improve planner scalability, but many lack a formal description of the properties of their distance estimates. To place previous work in context and extend work on heuristics for conditional planning, we provide a formal basis for distance estimates between belief states. We give a definition for the distance between belief states that relies on aggregating underlying state distance measures. We give several techniques to aggregate state distances and their associated properties. Many existing heuristics exhibit a subset of the properties, but in order to provide a standardized comparison we present several generalizations of planning graph heuristics that are used in a single planner. We compliment our belief state distance estimate framework by also investigating efficient planning graph data structures that incorporate BDDs to compute the most effective heuristics. We developed two planners to serve as test-beds for our investigation. The first, CAltAlt, is a conformant regression planner that uses A* search. The second, POND, is a conditional progression planner that uses AO* search. We show the relative effectiveness of our heuristic techniques within these planners. We also compare the performance of these planners with several state of the art approaches in conditional planning.

References in corpus (2)

• The FF Planning System: Fast Plan Generation Through Heuristic Search
• The 3rd International Planning Competition: Results and Analysis

Cited by in corpus (9)

• Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection
• SAP Speaks PDDL: Exploiting a Software-Engineering Model for Planning in Business Process Management
• LTLf Synthesis under Partial Observability: From Theory to Practice
• A Dynamic Epistemic Framework for Conformant Planning
• A State-Based Regression Formulation for Domains with Sensing Actions<br> and Incomplete Information
• Temporal Planning with Incomplete Knowledge and Perceptual Information
• Phase Transitions of Plan Modification in Conformant Planning
• Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming
• Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning