Solving POMDPs using quadratically constrained linear programs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2418-2424

  Amato, Christopher ^a   Bernstein, Daniel S ^a   Zilberstein, Shlomo ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE-STATE CONTROLLERS; MEMORY REQUIREMENTS; NONLINEAR PROGRAMMING ALGORITHM; NONLINEAR PROGRAMMING METHODS; OPTIMIZATION TECHNIQUES; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; SCALABLE ALGORITHMS; STATE-OF-THE-ART TECHNIQUES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; NONLINEAR PROGRAMMING; OPTIMIZATION;

LINEAR PROGRAMMING;

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

References (19)

1. Christopher Amato, Daniel S. Bernstein, and Shlomo Zilberstein. Optimal fixed-size controllers for decentralized POMDPs. In Proceedings of the Workshop on Multi-Agent Sequential Decision Making in Uncertain Domains (MSDM) at AAMAS, Hakodate, Japan, 2006.
2. Daniel S. Bernstein, Eric Hansen, and Shlomo Zilberstein. Bounded policy iteration for decentralized POMDPs. In Proc. of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, 2005.
3. Dimitri P. Bertsekas. Nonlinear Programming. Athena Scientific, 2004.
4. Anthony R. Cassandra. Exact and Approximate Algorithms for Partially Observable Markov Decision Processes. PhD thesis, Brown University, Providence, RI, 1998.
5. Anthony R. Cassandra. A survey of POMDP applications. In AAAI Fall Symposium: Planning with POMDPs, Orlando, FL, 1998.
6. James E. Eckles. Optimum maintenance with incomplete information. Operations Research, 16:1058-1067, 1968.
7. Zhengzhu Feng and Eric A. Hansen. Symbolic heuristic search for factored Markov decision processes. In Proc. of the Eighteenth National Conference on Artificial Intelligence, pages 455-460, 2002.
8. Zhengzhu Feng and Shlomo Zilberstein. Efficient maximization in solving POMDPs. In Proc. of the Twentieth National Conference on Artificial Intelligence, Pittsburgh, PA, 2005.
9. Philip E. Gill,Walter Murray, and Michael Saunders. Snopt: An SQP algorithm for large-scale constrained optimization. SIAM Review, 47:99-131, 2005.
10. Eric A. Hansen. Solving POMDPs by searching in policy space. In Proc. of the Fourteenth Conference on Uncertainty in Artificial Intelligence, pages 211-219, Madison, WI, 1998.
11. Milos Hauskrecht and Hamish Fraser. Modeling treatment of ischemic heart disease with partially observable Markov decision processes. In Proc. of American Medical Informatics Association annual symposium on Computer Applications in Health Care, pages 538-542, 1998.
12. Michael L. Littman, Anthony R. Cassandra, and Leslie Pack Kaelbling. Learning policies for partially observable environments: Scaling up. Technical Report CS-95-11, Brown University, Department of Computer Science, Providence, RI, 1995.
13. Nicolas Meuleau, Kee-Eung Kim, Leslie Pack Kaelbling, and Anthony R. Cassandra. Solving POMDPs by searching the space of finite policies. In Proc. of the Fifteenth Conference on Uncertainty in Artificial Intelligence, pages 417-426, Stockholm, Sweden, 1999.
14. Jolle Pineau, Geoffrey Gordon, and Sebastian Thrun. Point-based approximations for fast POMDP solving. Technical Report SOCS-TR-2005.4, McGill University. School of Computer Science, Montreal, QC, 2005.
15. Pascal Poupart and Craig Boutilier. Bounded finite state controllers. In Advances in Neural Information Processing Systems, 16, Vancouver, BC, 2003.
16. Pascal Poupart and Craig Boutilier. VDCBPI: an approximate scalable algorithm for large scale POMDPs. In Advances in Neural Information Processing Systems, 17, pages 1081-1088, Vancouver, BC, 2004.
17. Reid Simmons and Sven Koenig. Probabilistic navigation in partially observable environments. In Proc. of the 14th International Joint Conference on Artificial Intelligence, pages 1080-1087, 1995.
18. Satinder Singh, Tommi Jaakkola, and Michael Jordan. Learning without state-estimation in partially observable Markovian decision processes. In Machine Learning: Proceedings of the Eleventh International Conference, pages 284-292, 1994.
19. Matthijs T. J. Spaan and Nikos Vlassis. Perseus: Randomized point-based value iteration for POMDPs. Journal of AI Research, 24:195-220, 2005.