Topological order planner for POMDPs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 1684-1689

  Dibangoye, Jilles S ^a   Shani, Guy ^b   Chaib draa, Brahim ^a   Mouaddib, Abdel Illah ^c  

^a UNIVERSITÉ LAVAL   (Canada)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SPACE FLIGHT;

APPROXIMATE SOLUTION; BELIEF SPACE; POINT-BASED; POINT-BASED ALGORITHM; QUALITY POLICY; REAL-WORLD PROBLEM; TOPOLOGICAL ORDER; TOPOLOGICAL STRUCTURE;

TOPOLOGY;

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

References (14)

1. Mohammed Abbad and Hatim Boustique. A decomposition algorithm for limiting average markov decision problems. Oper. Res. Lett., 31(3):473-476, 2003.
2. Blai Bonet and Hector Geffner. Faster heuristic search algorithms for planning with uncertainty and full feedback. In Proceedings of IJCAI, pages 1233-1238, 2003.
3. Anthony Cassandra, Michael L. Littman, and Nevin L. Zhang. Incremental Pruning: A simple, fast, exact method for partially observable Markov decision processes. In Proceedings of UAI, pages 54-61, 1997.
4. Peng Dai and Judy Goldsmith. Topological value iteration algorithm for Markov Decision Processes. In Proceedings of IJCAI, pages 1860-1865, 2007.
5. W. S. Lovejoy. Computationally feasible bounds for partially observable markov decison processes. Operations Research, 39:175-192, 1991.
6. Joelle Pineau, Geoffrey J. Gordon, and Sebastian Thrun. Point-based value iteration: An anytime algorithm for pomdps. In Proceedings of IJCAI, pages 1025-1032, 2003.
7. Joelle Pineau, Geoffrey J. Gordon, and Sebastian Thrun. Policy-contingent abstraction for robust robot control. In Proceedings of UAI, pages 477-484, 2003.
8. Guy Shani, Ronen I. Brafman, and Solomon Eyal Shimony. Prioritizing point-based pomdp solvers. In Proceedings of ECML, pages 389-400, 2006.
9. Guy Shani, Ronen I. Brafman, and Solomon Eyal Shimony. Forward search value iteration for pomdps. In Proceedings of IJCAI, pages 2619-2624, 2007.
10. Guy Shani, Pascal Poupart, Ronen I. Brafman, and Solomon Eyal Shimony. Efficient add operations for pointbased algorithms. In Proceedings of ICAPS, pages 330-337, 2008.
11. Trey Smith and Reid G. Simmons. Point-based POMDP algorithms: Improved analysis and implementation. In Proceedings of UAI, pages 542-547, 2005.
12. Matthijs T. J. Spaan and Nikos Vlassis. Perseus: Randomized point-based value iteration for POMDPs. Journal of Artificial Intelligence Research, 24:195-220, 2005.
13. Yan Virin, Guy Shani, Solomon Eyal Shimony, and Ronen I. Brafman. Scaling up: Solving pomdps through value based clustering. In Proceedings of AAAI, pages 1290-1295, 2007.
14. David Wingate and Kevin D. Seppi. Prioritization methods for accelerating mdp solvers. J. Mach. Learn. Res., 6:851-881, 2005.