Stochastic over-subscription planning using hierarchies of MDPs

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 121-130

  Meuleau, Nicolas ^a,b   Brafman, Ronen ^c   Benazera, Emmanuel ^c  

^a NASA AMES RESEARCH CENTER   (United States)

^b QSS GROUP INC   (United States)

^c Research Institute for Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OVER-SUBSCRIPTION PLANNING (OSP); PLANETARY EXPLORATION DOMAINS; STOCHASTIC INSTANCES; TWOTIERED HIERARCHIES;

ALGORITHMS; HIERARCHICAL SYSTEMS; INFORMATION DISSEMINATION; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; STRATEGIC PLANNING;

STOCHASTIC PROGRAMMING;

EID: 33746100681     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. E. Amir and B. Engelhardt, Factored planning. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pages 929-935, 2003.
2. D. Andre and S. Russell. State abstraction for programmable reinforcement learning agents. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, pages 119-225, 2002.
3. D. Andre. Programmable Reinforcement Learning. PhD thesis, University of California, Berkeley, 2003.
4. D.P. Bertsekas and J. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, 1997.
5. R. I. Brafman and Y. Chernyavsky. Planning with goal preferences and constraints. In Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling, 2005.
6. J. Bresina, R. Dearden, N. Meuleau, S. Ramakrishnan, D. Smith, and R. Washington. Planning under continuous time and resource uncertainty: A challenge for AI. In Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence, pages 77-84, 2002.
7. T. Dean and K. Kanazawa. A model for reasoning about persistence and causation. Computational Intelligence, 5(3):142-150, 1993.
8. T. Dean and S.H. Lin. Decomposition techniques for planning in stochastic domains. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1121-1129, 1995.
9. T. Dietterich. Hierarchical reinforcement learning with the maxq value function decomposition. Journal of AI Research, 13:227-303, 2000.
10. C. Guestrin and G. Gordon. Distributed planning in hierarchical factored MDPs. In Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence, pages 197-506, 2002.
11. S. Hanks and D. V. McDermott. Modeling a dynamic and uncerain world i: Symbolic probabilistic reasoning about change. Artificial Intelligence, 66(1): 1-55, 1994.
12. M. Hauskrecht, N. Meuleau, L.P. Kaelbling, T. Dean, and C. Boutilier. Hierarchical solution of markov decision processes using macro-actions. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, pages 220-229, 1998.
13. J.G. Kemeny and J.L. Snell. Finite Markov Chains. Springer-Verlag, New York, NY, 1976.
14. M.L. Littman, T.L. Dean, and L.P. Kaelbling. On the complexity of solving Markov decision problems. In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, pages 394-402, 1995.
15. N. Meuleau, M. Hauskrecht, K.E. Kim, L. Peshkin, L.P. Kaelbling, T. Dean, and C. Boutilier. Solving very large weakly coupled markov decision processes. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pages 165-172, 1998.
16. M.L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York, NY, 1994.
17. R. Sanchez and S. Kambhampati. Planning graph heuristics for selecting objectives in over-subscription planning problems. In Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling, 2005.
18. D. Smith. Choosing objectives in over-subscription planning. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, pages 393-401, 2004.
19. R.S. Sutton, D. Precup, and S. Singh. Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence, 112:181-211, 1999.