On-line search for solving Markov decision processes via heuristic sampling

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 530-534

  Péret, Laurent ^a   Garcia, Frédérick ^a  

^a CEMAGREF   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; OPTIMIZATION; PROBLEM SOLVING;

'CURRENT; DECISION UNDER UNCERTAINTY; EXACT COMPUTATIONS; HEURISTIC SAMPLING; LINE SEARCHES; MARKOV DECISION PROCESSES; NEAR-OPTIMAL POLICIES; OPTIMAL ACTIONS; OPTIMAL POLICIES; SEQUENTIAL DECISIONS;

MARKOV PROCESSES;

EID: 85017333287     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. D. A. Berry and B. Fristedt, Bandit problems: Sequential allocation of experiments, Chapman and Hall, London, England, 1985.
2. D. P. Bertsekas and J. N. Tsitsiklis, Neuro-Dynamic Programming, Athena Scientific, Belmont (MA), 1996.
3. C. Boutilier, T. Dean, and S. Hanks, Decision theoretic planning: Structural assumptions and computational leverage, Journal of Artificial Intelligence Research, 11, 1-94, (1999).
4. V. Bulitko, L. Li, R. Greiner, and I. Levner, Lookahead pathologies for single agent search, in IJCAI 03, (2003).
5. M. Campbell, A.J. Hoane Jr., and F. Hsu, Deep blue, Artificial Intelligence, 134(1-2), 57-83, (2002).
6. H. S. Chang, M. C. Fu, and S. I. Marcus, An adaptive sampling algorithm for solving Markov Decision Processes, Operations Research, to appear, (2004).
7. H. C. Chen, C. H. Chen, and E. Yucesan, Computing efforts allocation for ordinal optimization and discrete event simulation, Journal of IEEE Transactions on Automatic Control, 45(5), 960-964, (2000).
8. T. Dean, L. P. Kaelbling, J. Kirman, and A. Nicholson, Planning under time constraints in stochastic domains, Artificial Intelligence, 76(1-2), 35-74, (1995).
9. E. A. Hansen and S. Zilberstein, LAO∗ : A heuristic search algorithm that finds solutions with loops, Artificial Intelligence, 129, 35- 62, (2001).
10. O. Hernandez and J.B. Lasserre, Error bounds for rolling horizon policies in discrete-Time Markov control processes, IEEE Transactions on Automatic Control, 35(10), 1118-1124, (1990).
11. M. J. Kearns, Y. Mansour, and A. Y. Ng, A sparse sampling algorithm for near-optimal planning in large Markov decision processes, Machine Learning, 49, 193-208, (2002).
12. R. E. Korf, Real-Time heuristic search, Artificial Intelligence, 42, 189- 211, (1990).
13. N. Meuleau and P. Bourgine, Exploration of multi-state environments: Local measures and back-propagation of uncertainty, Machine Learning, 35(2), 117-154, (1999).
14. J. Pearl, On the nature of pathology in game searching, Artificial Intelligence, 20, 427-453, (1983).
15. M. L. Puterman, Markov decision processes: discrete stochastic dynamic programming, Wiley-Interscience, New York, 1994.
16. R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction, MIT Press, Cambridge, Massachusetts, 1998.
17. R. Vanderbei, Optimal sailing strategies, statistics and operations research program, University of Princeton - http://www.sor.princeton.edu/.rvdb/sail/sail.html, (1996).
18. G. Verfaillie, F. Garcia, and L. Ṕeret, Deployment and maintenance of a constellation of satellites: A benchmark, in Proc. ICAPS 03Workshop on Planning under Uncertainty and Incomplete Information, (2003).