Switch to: Citations

Add references

You must login to add references.
  1. Complexity, decidability and undecidability results for domain-independent planning.Kutluhan Erol, Dana S. Nau & V. S. Subrahmanian - 1995 - Artificial Intelligence 76 (1-2):75-88.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Task decomposition on abstract states, for planning under nondeterminism.Ugur Kuter, Dana Nau, Marco Pistore & Paolo Traverso - 2009 - Artificial Intelligence 173 (5-6):669-695.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Handling uncertainty by interleaving cost-aware classical planning with execution.Per Nyblom - forthcoming - Swedish Ai Society Workshop.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Planning control rules for reactive agents.F. Kabanza, M. Barbeau & R. St-Denis - 1997 - Artificial Intelligence 95 (1):67-113.
    Download  
     
    Export citation  
     
    Bookmark   6 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.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • LAO∗: A heuristic search algorithm that finds solutions with loops.Eric A. Hansen & Shlomo Zilberstein - 2001 - Artificial Intelligence 129 (1-2):35-62.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Strong planning under partial observability.Piergiorgio Bertoli, Alessandro Cimatti, Marco Roveri & Paolo Traverso - 2006 - Artificial Intelligence 170 (4-5):337-384.
    Download  
     
    Export citation  
     
    Bookmark   6 citations