An improved grid-based approximation algorithm for POMDPs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 707-714

  Zhou, Rong ^a   Hansen, Eric A ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXACT ALGORITHMS; GRID-BASED; GRID-BASED APPROACH; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; PLANNING UNDER UNCERTAINTY; REGULAR GRIDS; VARIABLE RESOLUTION;

ARTIFICIAL INTELLIGENCE;

APPROXIMATION ALGORITHMS;

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

References (16)

1. Boutilier, C.; T. Dean; and S. Hanks. 1999. Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research 11: 1-94. (Pubitemid 129628760)
2. Brafman, R. 1997. A heuristic variable grid solution method for POMDPs. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), 727-733. Providence, RI.
3. Cassandra, A.; Littman, M.; and Zhang, N. 1997. Incremental pruning: A simple, fast, exact algorithm for partially observable Markov decision processes. In Proceedings of the Thirteenth Annual Conference on Uncertainty in Artificial Intelligence, 54-61.
4. Drake, A. 1962. Observation of a Markov Process Through a Noisy Channel. Ph.D. thesis, Electrical Engineering Department, M.I.T., Cambridge, MA.
5. Eckles, J. 1966. Optimum replacement of stochastically failing systems. Ph.D. thesis, Department of Engineering-Economic Systems, Stanford University.
6. Hansen, E. 1998. Solving POMDPs by searching in policy space. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98), 211-219. Madison, WI.
7. Hauskrecht, M. 1997. Incremental methods for computing bounds in partially observable Markov decision processes. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), 734-739. Providence, RI.
8. Hauskrecht, M. 2000. Value-function approximations for partially observable Markov decision processes. Journal of Artificial Intelligence Research 13:33-94. (Pubitemid 33682083)
9. Kakalik, J. 1965. Optimum policies for partially observable Markov systems. Technical report 18, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
10. Littman, M.; A. Cassandra; and L. Kaelbling. 1995. Learning policies for partially observable environments: Scaling up. In Proceedings of the Twelth International Conference on Machine Learning, 362-370.
11. Lovejoy, W. 1991. Computationally feasible bounds for partially observed Markov decision processes. Operations Research 39:162-175.
12. Lusena, C.; J. Goldsmith; and M. Mundhenk. 1998. Nonapproximability results for Markov decision processes. Technical Report, Computer Science Department, University of Kentucky.
13. Munos, R. and A. Moore. 1999. Variable resolution discretization for high accuracy solutions of optimal control problems. In Proceedings of 16th International Joint Conference on Artificial Intelligence.
14. Satia, J. and Lave, R. 1973. Markovian Decision Processes with Probabilistic Observation of States. Management Science 20(1):1-13.
15. Washington, R. 1997. BI-POMDP: Bounded, incremental partially-observable Markov-model planning. In Proceedings of the Fourth European Conference on Planning (ECP-97).
16. Zhang, N.; S. Lee; and W. Zhang. 1999. A method for speeding up value iteration in partially observable Markov decision processes. In Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence.