Hierarchical heuristic forward search in stochastic domains

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2542-2549

  Meuleau, Nicolas ^a,c   Brafman, Ronen I ^b  

^a NASA AMES RESEARCH CENTER   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c QSS Group Inc   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC SEARCH; HIERARCHICAL APPROACH; HIERARCHICAL MODEL; HIERARCHICAL STRUCTURES; OPTIMAL POLICIES; PERFORMANCE IMPROVEMENTS; SEARCH ALGORITHMS; STOCHASTIC DOMAINS;

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; HIERARCHICAL SYSTEMS;

ITERATIVE METHODS;

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

References (12)

1. Amir, E.; and Englehardt; B. 2003. Factored Planning. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, 929-935. San Francisco, Calif.: Morgan Kaufmann.
2. Andre, D.; and Russell, S. 2002. State Abstraction for Programmable Reinforcement Learning Agents. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, 119-125. Menlo Park, Calif.: AAAI Press.
3. Barto, A.G.; Bradtke, S.J.; and Singh, S.P. 1995. Learning to Act using Real-Time Dynamic Programming. Artificial Intelligence 672(1-2):81-138.
4. Bertsekas, D.P.; and Tsitsiklis, J. 1997. Neuro-Dynamic Programming. Belmont, Mass.: Athena Scientific.
5. Bonet, B.; and Geffner, H. 2003. Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming. In Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, 12-21. Menlo Park, Calif.: AAAI Press.
6. Dean, T.; and Kanazawa, K. 1993. A Model for Reasoning about Persistence and Causation. Computational Intelligence 5(3):142-150.
7. Hanks, S.; and McDermott, D.V. 1994. Modeling a Dynamic and Uncerain World I: Symbolic Probabilistic Reasoning about Change. Artificial Intelligence 66(1):1-55.
8. Hansen, E.A.; and Zilberstein, S. 2001. LAO*: A Heuristic Search Algorithm that Finds Solutions with Loops. Artificial Intelligence 129(1-2):35-62. (Pubitemid 32498415)
9. Meuleau, N.; Brafman, R.; and Benazera, E. 2006. Stochastic Oversubscription Planning using Hierarchies of MDPs. In Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 121-130. Menlo Park, Calif.: AAAI Press.
10. Nilsson, N.J. 1980. Principles of Artificial Intelligence. Palo Alto, Calif.: Tioga Publishing Company.
11. Puterman, M.L. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. New York, NY:Wiley.
12. Sutton, R.S.; Precup, D.; and Singh, S.P. 1999. Between MDPs and Semi-MDPs: A Framework for Temporal Abstraction in Reinforcement Learning. Artificial Intelligence 112(1-2):181-211.