Dynamic non-uniform abstractions for approximate planning in large structured stochastic domains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1531, Issue , 1998, Pages 587-598

  Baum, J ^a   Nicholson, A E ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECISION THEORY; MARKOV PROCESSES; STOCHASTIC SYSTEMS;

APPROXIMATE SOLUTION; AUTOMATICALLY GENERATED; DOMAIN STRUCTURE; LEVEL OF ABSTRACTION; MARKOV DECISION PROCESSES; OPTIMAL POLICIES; POLICY GENERATION; STOCHASTIC DOMAINS;

ABSTRACTING;

EID: 84862678670     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. J. Baum and A. E. Nicholson. Dynamic non-uniform abstractions for approximate planning in large structured stochastic domains. Technical Report TR 98/18, Department of Computer Science, Monash Uni., 1998.
2. R. Bellman. Dynamic Programming. Princeton Uni. Press, 1957.
3. D. P. Bertsekas. Dynamic Programming. Prentice-Hall, Englewood Cliffs, N.J., 1987.
4. C. Boutilier. Correlated action effects in decision theoretic regression. In Proc. of UAI, pages 30-37, 1997.
5. C. Boutilier and R. Dearden. Approximating value trees in structured dynamic programming. In Proc. of 13th Int’l Conf. on Machine Learning, pages 54-62, Bari, Italy, 1996.
6. C. Boutilier, R. Dearden, and M. Goldszmidt. Exploiting structure in policy construction, In Proc. of IJCAI, pages 104-1111, Montreal, 1995.
7. T. Dean, L. P. Kaelbling, J. Kirman, and A. E. Nicholson. Planning under time constraints in stochastic domains. Artificial Intelligence, 76(1-2):35-74, 1995.
8. R. Dearden and C. Boutilier. Abstraction and approximate decision theoretic planning. Artificial Intelligence, 89(1):219-283, 1997.
9. M. Drummond and J. Bresina. Anytime synthetic projection: Maximizing the probability of goal satisfaction. In Proc. of AAAI-90, pages 138-144. AAAI, 1990.
10. R. P. Goldman, D. J. Musliner, K. D. Krebsbach, and M. S. Boddy. Dynamic abstraction planning. In Proc. of AAAI 97, 1997.
11. R. A. Howard. Dynamic Programming and Markov Processes. MIT Press, Cambridge, Massachusetts, 1960.
12. J. Kirman. Predicting real-time planner performance by domain characterization. PhD thesis, Brown Uni., 1994.
13. D. J. Musliner, E. H. Durfee, and K. G. Shin. World modeling for the dynamic construction of real-time plans. Artificial Intelligence, 74:83-127, 1995.
14. A. E. Nicholson and L. P. Kaelbling. Toward approximate planning in very large stochastic domains. In Proc. of Spring Symposium on Decision Theoretic Planning, 1994.
15. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, California, 1993.