| Dean, T., R. Givan, and K. Kim (1998). Solving stochastic planning problems with large state and action spaces. In Proc. Fourth International Conference on Artificial Intelligence Planning Systems. |
....state probabilities like those found in P. Then, algorithms such as Policy Iteration and Value Iteration [11] are used to compute an optimal policy (i.e. mapping of actions, along with deadlines for our model, to states) For large problems, recent advances such as factoring the state space [14] and using algebraic decision diagrams to solve factored MDPs [30] have been developed. We have not yet verified whether these methods will be capable of significantly reducing complexity for our problems of interest. We have devoted this section exclusively to a discussion of MDPs, but have opted ....
T. Dean, R. Givan, and K. Kim, Solving Stochastic Planning Problems with Large State and Action Spaces, Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, Pittsburgh, Pennsylvania, (1998).
No context found.
Dean, T., R. Givan, and K. Kim (1998). Solving stochastic planning problems with large state and action spaces. In Proc. Fourth International Conference on Artificial Intelligence Planning Systems.
No context found.
Thomas Dean, Robert Givan, and KeeEung Kim. Solving stochastic planning problems with large state and action spaces. In Manuela Veloso Reid Simmons and Stephen Smith, editors, Proceedings of the Fourth International Conference on Arti cial Intelligence Planning Systems, pages 102-110, Pittsburgh, PA, June 1998. AAAI Press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC