nips nips2000 nips2000-48 nips2000-48-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Justin A. Boyan, Michael L. Littman
Abstract: We describe an extension of the Markov decision process model in which a continuous time dimension is included in the state space. This allows for the representation and exact solution of a wide range of problems in which transitions or rewards vary over time. We examine problems based on route planning with public transportation and telescope observation scheduling. 1
[1] John Bresina, Mark Drummond, and Keith Swanson. Managing action duration uncertainty with just-in-case scheduling. In Decision- Theoretic Planning: Papers from the 1994 Spring AAAI Symposium, pages 19-26, Stanford, CA, 1994. AAAI Press, Menlo Park, California. ISBN 0-929280-70-9. URL http://ic-www.arc.nasa.gov/ic/projects/xfr/jic/jic.html.
[2] Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990.
[3] Sven Koenig and Reid G. Simmons. How to make reactive planners risksensitive. In Proceedings of the 2nd International Conference on Artificial Intelligence Planning Systems, pages 293- 304, 1994.
[4] Harold J. Kushner and Paul G. Dupuis. Numerical Methods for Stochastic Control Problems in Continuous Time. Springer-Verlag, New York, 1992.
[5] Martin L. Puterman. Markov Decision Processes- Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, NY, 1994.
[6] Michael P. Wellman, Kenneth Larson, Matthew Ford, and Peter R. Wurman. Path planning under time-dependent uncertainty. In Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, pages 532- 539, 1995.