Scaling up: Solving POMDPs through value based clustering

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1290-1295

  Virin, Yan ^a   Shani, Guy ^a   Shimony, Solomon Eyal ^a   Brafman, Ronen ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; MATHEMATICAL MODELS; PUBLIC POLICY;

BACKUP OPERATIONS; BELIEF STATES; PRIORITIZATION;

MARKOV PROCESSES;

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

References (14)

1. Bonet, B., and H.Gefner. 1998. Solving large POMDPs using real time dynamic programming. In Fall AAAI Symposium on POMDPs, 61-68.
2. Cassandra, A.; Kaelbling, L.; and Kurien, J. 1996. Acting under uncertainty: Discrete Bayesian models for mobile-robot navigation. In IROS, 963-972.
3. Cassandra, A. R.; Kaelbling, L. P.; and Littman, M. L. 1994. Acting optimally in partially observable stochastic domains. In AAAI'94, 1023-1028.
4. Cassandra, A.; Littman, M. L.; and Zhang, N. L. 1997. Incremental Pruning: A simple, fast, exact method for partially observable Markov decision processes. In UAI-97, 54-61.
5. Littman, M. L.; Cassandra, A. R.; and Kaelbling, L. P. 1995. Efficient dynamic-programming updates in partially observable Markov decision processes. Technical Report CS-95-19, Brown University.
6. Lovejoy, W. S. 1991. Computationally feasible bounds for partially observable markov decison processes. OR 39:175-192.
7. Paquet, S.; Tobin, L.; and Chaib-draa, B. 2005. Real-time decision making for large POMDPs. In AI'2005.
8. Pineau, J.; Gordon, G.; and Thrun, S. 2003. Point-based value iteration: An anytime algorithm for POMDPs. In IJCAI-2003.
9. Shani, G.; Brafman, I.; and Shimony, E. 2006. Prioritizing point-based POMDP solvers. In ECML-2006, 389-400.
10. Smallwood, R. D., and Sondik, E. J. 1973. The optimal control of partially observable processes over a finite horizon. OR 21:1071-1088.
11. Smith, T., and Simmons, R. 2004. Heuristic search value iteration for POMDPs. In UAI-2004, 520 - 527.
12. Spaan, M. T. J., and Vlassis, N. 2005. Persus: Randomized point-based value iteration for POMDPs. In JAIR, volume 24, 195-220.
13. Wingate, D., and Seppi, K. D. 2005. Prioritization methods for accelerating mdp solvers. JMLR 6:851-881.
14. Zhou, R., and Hansen, E. A. 2001. An improved grid-based approximation algorithm for POMDPs. In IJCAI, 707-716.