A point-based POMDP planner for target tracking

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2008, Pages 2644-2650

  Hsu, David ^a   Lee, Wee Sun ^a   Rong, Nan ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; ENERGY CONSERVATION; INDUSTRIAL ENGINEERING; ROBOTICS; ROBOTS; TARGET TRACKING;

INTERNATIONAL CONFERENCES; POINT-BASED;

TARGETS;

EID: 51649106250     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2008.4543611     Document Type: Conference Paper

References (22)

1. T. Bandyopadhyay, Y.P. Li, M.H. Ang Jr., and D. Hsu. A greedy strategy for tracking a locally predictable target among obstacles. In Proc. IEEE Int. Conf. on Robotics & Automation, pages 2342-2347, 2006.
2. M. Bennewitz, W. Burgard, G. Cielniak, and S. Thrun. Learning motion patterns of people for compliant robot motion. Int. J. Robotics Research, 24(1):31-48, 2005.
3. B.P. Gerkey, S. Thrun, and G. Gordon. Visibility-based pursuit-evasion with limited field of view. Int. J. Robotics Research, 25(4):299-315, 2006.
4. H.H. González-Baños, C.Y. Lee, and J.C. Latombe. Real-time combinatorial tracking of a target moving unpredictably among obstacles. In Proc. IEEE Int. Conf. on Robotics & Automation, pages 1683-1690, 2002.
5. L.J. Guibas, J.C. Latombe, S.M. LaValle, D. Lin, and R. Motwani. Visibility-based pursuit-evasion problem. Int. J. Computational Geometry & Applications, 9(5):471-494, 1999.
6. M. Hauskrecht. Value-function approximations for partially observable Markov decision processes. J. Artificial Intelligence Research, 13:33-94, 2000.
7. J. Hoey, A. von Bertoldi, P. Poupart, and A. Mihailidis. Assisting persons with dementia during handwashing using a partially observable Markov decision process. In Proc. Int. Conf. on Vision Systems, 2007.
8. K. Hsiao, L.P. Kaelbling, and T. Lozano-Pérez. Grasping POMDPs. In Proc. IEEE Int. Conf. on Robotics & Automation, pages 4485-4692, 2007.
9. D. Hsu, W.S. Lee, and N. Rong. Accelerating point-based POMDP algorithms through successive approximations of the optimal reachable space. Technical Report TRA4/07, National University of Singapore. School of Computing, April 2007.
10. D. Hsu, W.S. Lee, and N. Rong. What makes some POMDP problems easy to approximate? In Advances in Neural Information Processing Systems (NIPS), 2007. To appear.
11. L.P. Kaelbling, M.L. Littman, and A.R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(1-2):99-134, 1998.
12. S.M. LaValle, H.H. González-Baños, C. Becker, and J.C. Latombe. Motion strategies for maintaining visibility of a moving target. In Proc. IEEE Int. Conf. on Robotics & Automation, pages 731-736, 1997.
13. R. Murrieta-Cid, H.H. González-Baños, and B. Tovar. A reactive motion planner to maintain visibility of unpredictable targets. In Proc. IEEE Int. Conf. on Robotics & Automation, pages 4242-4248, 2002.
14. R. Murrieta-Cid, A. Sarmiento, and S. Hutchinson. A motion planning strategy to maintain visibility of a moving target at a fixed distance in a polygon. In Proc. IEEE Int. Conf. on Advanced Robotics, 2003.
15. C. Papadimitriou and J.N. Tsisiklis. The complexity of Markov decision processes. Mathematics of Operations Research, 12(3):441-450, 1987.
16. J. Pineau, G. Gordon, and S. Thrun. Point-based value iteration: An anytime algorithm for POMDPs. In Proc. Int. Jnt. Conf. on Artificial Intelligence, pages 477-484, 2003.
17. G. Shani, R. Brafman, and S. Shimony. Adaptation for Changing Stochastic Environments through Online POMDP Policy Learning. In Proc. Eur. Conf. on Machine Learning, pages 61-70, 2005.
18. R.D. Smallwood and E.J. Sondik. The optimal control of partially observable Markov processes over a finite horizon. Operations Research, 21:1071-1088, 1973.
19. T. Smith and R. Simmons. Point-based POMDP algorithms: Improved analysis and implementation. In Proc. Uncertainty in Artificial Intelligence, 2005.
20. M.T.J. Spaan and N. Vlassis. Perseus: Randomized point-based value iteration for POMDPs. J. Artificial Intelligence Research, 24:195-220, 2005.
21. I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863-888, 1992.
22. R. Vidal, O. Shakernia, H.J. Kim, D.H. Shim, and S Sastry. Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation. IEEE Trans. on Robotics & Automation, 18(5):662-669, 2002.