Planning under Uncertainty for Robotic Tasks with Mixed Observability
暂无分享,去创建一个
David Hsu | Sylvie C. W. Ong | Wee Sun Lee | S. W. Ong | Shao Wei Png | David Hsu | S. Png
[1] Edward J. Sondik,et al. The Optimal Control of Partially Observable Markov Processes over a Finite Horizon , 1973, Oper. Res..
[2] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[3] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[4] Leslie Pack Kaelbling,et al. Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..
[5] Sebastian Thrun,et al. Coastal Navigation with Mobile Robots , 1999, NIPS.
[6] Michael L. Littman,et al. Exact Solutions to Time-Dependent MDPs , 2000, NIPS.
[7] Milos Hauskrecht,et al. Value-Function Approximations for Partially Observable Markov Decision Processes , 2000, J. Artif. Intell. Res..
[8] Zhengzhu Feng,et al. Dynamic Programming for POMDPs Using a Factored State Representation , 2000, AIPS.
[9] Ronald E. Parr,et al. Solving Factored POMDPs with Linear Value Functions , 2001 .
[10] Sebastian Thrun,et al. Probabilistic robotics , 2002, CACM.
[11] Craig Boutilier,et al. Value-Directed Compression of POMDPs , 2002, NIPS.
[12] Shobha Venkataraman,et al. Efficient Solution Algorithms for Factored MDPs , 2003, J. Artif. Intell. Res..
[13] Joelle Pineau,et al. Point-based value iteration: An anytime algorithm for POMDPs , 2003, IJCAI.
[14] Joelle Pineau,et al. Towards robotic assistants in nursing homes: Challenges and results , 2003, Robotics Auton. Syst..
[15] Milos Hauskrecht,et al. Solving Factored MDPs with Continuous and Discrete Variables , 2004, UAI.
[16] Reid G. Simmons,et al. Heuristic Search Value Iteration for POMDPs , 2004, UAI.
[17] Nikos A. Vlassis,et al. A point-based POMDP algorithm for robot planning , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.
[18] Pascal Poupart,et al. Factored partially observable Markov decision processes for dialogue management , 2005 .
[19] Geoffrey J. Gordon,et al. Finding Approximate POMDP solutions Through Belief Compression , 2011, J. Artif. Intell. Res..
[20] Reid G. Simmons,et al. Point-Based POMDP Algorithms: Improved Analysis and Implementation , 2005, UAI.
[21] Alexei Makarenko,et al. Parametric POMDPs for planning in continuous state spaces , 2006, Robotics Auton. Syst..
[22] Nan Rong,et al. What makes some POMDP problems easy to approximate? , 2007, NIPS.
[23] Jesse Hoey,et al. Assisting persons with dementia during handwashing using a partially observable Markov decision process. , 2007, ICVS 2007.
[24] Leslie Pack Kaelbling,et al. Grasping POMDPs , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.
[25] Kee-Eung Kim,et al. Symbolic Heuristic Search Value Iteration for Factored POMDPs , 2008, AAAI.
[26] Guy Shani,et al. Efficient ADD Operations for Point-Based Algorithms , 2008, ICAPS.
[27] David Hsu,et al. SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces , 2008, Robotics: Science and Systems.
[28] Nan Rong,et al. A point-based POMDP planner for target tracking , 2008, 2008 IEEE International Conference on Robotics and Automation.