Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search

DOI10.1016/S0004-3702(01)00158-8zbMath0984.68140MaRDI QIDQ5958540

XuanLong Nguyen, Subbarao Kambhampati, Romeo S. Nigenda

Publication date: 3 March 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

heuristicsplanningCSPplanning graphGraphplan

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Learning from planner performance ⋮ Anytime heuristic search for partial satisfaction planning ⋮ State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning ⋮ Set-structured and cost-sharing heuristics for classical planning

Uses Software

• STAN
• Walksat
• Graphplan
• SAPA
• AltAlt

Cites Work

• Linear-space best-first search
• Using regression-match graphs to control search in planning
• Fast planning through planning graph analysis
• Planning as heuristic search
• Least commitment in Graphplan
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search