POMDPs for robotic tasks with mixed observability

Robotics: Science and Systems

Volumn 5, Issue , 2010, Pages 201-208

  Ong, Sylvie C W ^a   Png, Shao Wei ^a   Hsu, David ^a   Lee, Wee Sun ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84959574091     PISSN: 23307668     EISSN: 2330765X     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. C. Guestrin, D. Koller, and R. Parr. Solving factored POMDPs with linear value functions. In Int. Jnt. Conf. on Artificial Intelligence Workshop on Planning under Uncertainty & Incomplete Information, pp. 67-75, 2001.
2. C. Guestrin, D. Koller, R. Parr, and S. Venkataraman. Efficient solution algorithms for factored MDPs. J. Artificial Intelligence Research, 19:399-468, 2003.
3. M. Hauskrecht. Value-function approximations for partially observable Markov decision processes. J. Artificial Intelligence Research, 13:33-94, 2000.
4. M. Hauskrecht and H. Fraser. Planning medical therapy using partially observable Markov decision processes. In Proc. Int. Workshop on Principles of Diagnosis, pp. 182-189, 1998.
5. K. Hsiao, L. Kaelbling, and T. Lozano-Pérez. Grasping POMDPs. In Proc. IEEE Int. Conf. on Robotics & Automation, pp. 4485-4692,2007.
6. D. Hsu, W. Lee, and N. Rong. What makes some POMDP problems easy to approximate? In Advances in Neural Information Processing Systems (NIPS), 2007.
7. D. Hsu. A point-based POMDP planner for target tracking. In Proc. IEEE Int. Conf. on Robotics & Automation, pp. 2644-2650, 2008.
8. L. Kaelbling, M. Littman, and A. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(1-2):99-134, 1998.
9. H. Kurniawati, D. Hsu, and W. Lee. SARSOP: Efficient point-based POMDP planning by approximating optimally reachable belief spaces. In Proc. Robotics: Science and Systems, 2008.
10. C. Papadimitriou and J. Tsisiklis. The complexity of Markov decision processes. Mathematics of Operations Research, 12(3):441-450, 1987.
11. J. Pineau, G. Gordon, and S. Thrun. Point-based value iteration: An anytime algorithm for POMDPs. In Proc. Int. Jnt. Conf. on Artificial Intelligence, pp. 477-484, 2003.
12. J. Pineau, M. Montemerlo, M. Pollack, N. Roy, and S. Thrun. Towards robotic assistants in nursing homes: Challenges and results. Robotics & Autonomous Systems, 42(3-4):271-281, 2003.
13. P. Poupart and C. Boutilier. Value-directed compression of POMDPs. In Advances in Neural Information Processing Systems (NIPS), 15:1547-1554. The MIT Press, 2003.
14. N. Roy, G. Gordon, and S. Thrun. Finding aproximate POMDP solutions through belief compression. J. Artificial Intelligence Research, 23:1-40, 2005.
15. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 2003.
16. G. Shani, R. Brafman, and S. Shimony. Forward search value iteration for POMDPs. In Proc. Int. Jnt. Conf. on Artificial Intelligence, 2007.
17. R. Smallwood and E. Sondik. The optimal control of partially observable Markov processes over a finite horizon. Operations Research, 21:1071-1088, 1973.
18. T.Smith and R.Simmons. Heuristic search value iteration for POMDPs. In Proc. Uncertainty in Artificial Intelligence, pp. 520-527, 2004.
19. T.Smith. Point-based POMDP algorithms: Improved analysis and implementation. In Proc. Uncertainty in Artificial Intelligence, 2005.
20. M. Spaan and N. Vlassis. A point-based POMDP algorithm for robot planning. In Proc. IEEE Int. Conf. on Robotics & Automation, 2004.