Least commitment in Graphplan

DOI10.1016/S0004-3702(01)00082-0zbMath0982.68118OpenAlexW2003890836WikidataQ127391552 ScholiaQ127391552MaRDI QIDQ5958108

No author found.

Publication date: 3 March 2002

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(01)00082-0

zbMATH Keywords

planningauthorization propertyindependence propertyleast commitmentplanning graph

Mathematics Subject Classification ID

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

Related Items

Planning as satisfiability: parallel plans and algorithms for plan search ⋮ Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search

Uses Software

• STAN
• Walksat
• Graphplan

Cites Work

• Fast planning through planning graph analysis
• Analysis on the p-adic superspace. I. Generalized functions: Gaussian distribution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item