Reachability analysis for uncertain SSPs

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 2005, Issue , 2005, Pages 515-522

  Buffet, Olivier ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; REAL TIME SYSTEMS; STATE SPACE METHODS;

REAL-TIME DYNAMIC PROGRAMMING ALGORITHM (RTDP); STOCHASTIC SHORTEST PATH PROBLEMS (SSP); TRANSITION PROBABILITY;

UNCERTAIN SYSTEMS;

EID: 33845909258     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2005.106     Document Type: Conference Paper

References (18)

1. J. Bagnell, A. Y. Ng, and J. Schneider. Solving uncertain markov decision problems. Technical Report CMU-RI-TR-01-25, Robotics Institute, Carnegie Mellon U., 2001.
2. A. Barto, S. Bradtke, and S. Singh. Learning to act using real-time dynamic programming. Artificial Intelligence, 72, 1995.
3. R. Bellman. Dynamic Programming. Princeton U. Press, Princeton, New-Jersey, 1957.
4. D. Bertsekas and J. Tsitsiklis. Neurodynamic Programming. Athena Scientifi c, 1996.
5. B. Bonet and H. Geffner. Labeled rtdp: Improving the convergence of real time dynamic programming. In Proc. of the 23th Int. Conf. on Automated Planning and Scheduling (ICAPS'03), 2003.
6. C. Boutilier, R. I. Brafman, and C. Geib. Structured reach-ability analysis for markov decision processes. In Proc. of the 14th Conf. on Uncertainty in Artificial Intelligence (UAI-98), 1998.
7. R. Bryant. Symbolic manipulation of boolean functions using a graphical representation. In ACM/IEEE Design Automation, pages 688-694, 1985.
8. O. Buffet. Robust (l)rtdp: Reachability analysis. Technical report, National ICT Australia, 2004.
9. O. Buffet. Fast reachability analysis for uncertain ssps. In Proc. of the IJCAl 2005 Workshop on Planning and Learning in A Priori Unknown or Dynamic Domains, 2005.
10. O. Buffet and D. Aberdeen. Planning with robust (l)rtdp. Technical report, National ICT Australia, 2004.
11. O. Buffet and D. Aberdeen. Robust planning with (l)rtdp. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI'05), 2005.
12. O. Coudert, J.-C. Madre, and C. Berthet. Verifying temporal properties of sequential machines without building their state diagrams. In Proc. of the Workshop on Computer-Aided Verification, 1990.
13. R. Givan, S. Leach, and T. Dean. Bounded parameter markov decision processes. Artificial Intelligence, 122(1-2):71-109, 2000.
14. M. Hosaka, M. Horiguchi, and M. Kurano. Controlled markov set-chains under average criteria. Applied Mathematics and Computation, 120(1-3): 195-209, 2001.
15. R. Munos. Efficient resources allocation for markov decision processes. In Advances in Neural Information Processing Systems 13 (NIPS'01), 2001.
16. A. Nilim and L. E. Ghaoui. Robustness in markov decision problems with uncertain transition matrices. In Advances in Neural Information Processing Systems 16 (NIPS'03), 2004.
17. A. L. Strehl and M. L. Littman. An empirical evaluation of interval estimation for markov decision processes. In Proc. of the 16th Int. Conf. on Tools with Artificial Intelligence (ICTAI'04), 2004.
18. R. Sutton and G. Barto. Reinforcement Learning: an introduction. Bradford Book, MIT Press, Cambridge, MA, 1998.