Distance-Based Goal-Ordering Heuristics for Graphplan

We will discuss the shortcomings of known variable and value ordering strategies for Graphplan's backward search phase, and propose a novel strategy that is based on a notion of the difficulty of achieving the corresponding subgoal. The difficulty of achievement is quantified in terms of the structure of the planning graph itself

• Type: Conference
• Year: 2000
• Where: AIPS
• Authors: Subbarao Kambhampati, Romeo Sanchez Nigenda
• Keywords: AIPS 2000, Artificial Intelligence, Corresponding Subgoal, Value Ordering Strategies, Way Distance-based Heuristics