Switch to: References

Add citations

You must login to add citations.
  1. Discovering hidden structure in factored MDPs.Andrey Kolobov, Mausam & Daniel S. Weld - 2012 - Artificial Intelligence 189 (C):19-47.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Depth-based short-sighted stochastic shortest path problems.Felipe W. Trevizan & Manuela M. Veloso - 2014 - Artificial Intelligence 216 (C):179-205.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Probabilistic planning with clear preferences on missing information.Maxim Likhachev & Anthony Stentz - 2009 - Artificial Intelligence 173 (5-6):696-721.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Deliberation for autonomous robots: A survey.Félix Ingrand & Malik Ghallab - 2017 - Artificial Intelligence 247 (C):10-44.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • An anytime algorithm for constrained stochastic shortest path problems with deterministic policies.Sungkweon Hong & Brian C. Williams - 2023 - Artificial Intelligence 316 (C):103846.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • GUBS criterion: Arbitrary trade-offs between cost and probability-to-goal in stochastic planning based on Expected Utility Theory.Gabriel Nunes Crispino, Valdinei Freire & Karina Valdivia Delgado - 2023 - Artificial Intelligence 316 (C):103848.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • The factored policy-gradient planner.Olivier Buffet & Douglas Aberdeen - 2009 - Artificial Intelligence 173 (5-6):722-747.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Conformant plans and beyond: Principles and complexity.Blai Bonet - 2010 - Artificial Intelligence 174 (3-4):245-269.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Strong planning under partial observability.Piergiorgio Bertoli, Alessandro Cimatti, Marco Roveri & Paolo Traverso - 2006 - Artificial Intelligence 170 (4-5):337-384.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Plan aggregation for strong cyclic planning in nondeterministic domains.Ron Alford, Ugur Kuter, Dana Nau & Robert P. Goldman - 2014 - Artificial Intelligence 216 (C):206-232.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation