Switch to: Citations

References in:

Task decomposition on abstract states, for planning under nondeterminism

Ugur Kuter, Dana Nau, Marco Pistore & Paolo Traverso

Artificial Intelligence 173 (5-6):669-695 (2009)

Add references

You must login to add references.

Strong planning under partial observability.Piergiorgio Bertoli, Alessandro Cimatti, Marco Roveri & Paolo Traverso - 2006 - Artificial Intelligence 170 (4-5):337-384.details Download Export citation Bookmark 6 citations
Using temporal logics to express search control knowledge for planning.Fahiem Bacchus & Froduald Kabanza - 2000 - Artificial Intelligence 116 (1-2):123-191.details Download Export citation Bookmark 24 citations
Weak, strong, and strong cyclic planning via symbolic model checking.A. Cimatti, M. Pistore, M. Roveri & P. Traverso - 2003 - Artificial Intelligence 147 (1-2):35-84.details Download Export citation Bookmark 22 citations
Planning control rules for reactive agents.F. Kabanza, M. Barbeau & R. St-Denis - 1997 - Artificial Intelligence 95 (1):67-113.details Download Export citation Bookmark 6 citations
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism.Claudio Castellini, Enrico Giunchiglia & Armando Tacchella - 2003 - Artificial Intelligence 147 (1-2):85-117.details Download Export citation Bookmark 5 citations
Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.details Download Export citation Bookmark 54 citations
Conformant planning via heuristic forward search: A new approach.Jörg Hoffmann & Ronen I. Brafman - 2006 - Artificial Intelligence 170 (6-7):507-541.details Download Export citation Bookmark 7 citations

1