PPCP: Efficient probabilistic planning with clear preferences in partially-known environments

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 860-867

  Likhachev, Maxim ^a   Stentz, Anthony ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MISSING INFORMATION; PROBABILISTIC PLANNING; ROBOT NAVIGATION;

INFORMATION RETRIEVAL; OPTIMAL CONTROL SYSTEMS; PROBABILISTIC LOGICS; PROBLEM SOLVING; ROBOT APPLICATIONS; SET THEORY;

PLANNING;

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

References (13)

1. Barto, A.; Bradtke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. Artificial Intelligence 72:81-138.
2. Bonet, B., and Geffner, H. 2003. Faster heuristic search algorithms for planning with uncertainty and full feedback. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, 1233-1238.
3. Ferguson, D.; Stentz, A.; and Thrun, S. 2004. PAO* for planning with hidden state. In Proceedings of the 2004 IEEE International Conference on Robotics and Automation.
4. Hansen, E., and Zilberstein, S. 2001. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129:35-62.
5. Koenig, S., and Smirnov, Y. 1996. Sensor-based planning with the freespace assumption. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA).
6. Likhachev, M., and Stentz, A. 2003. PPCP algorithm with formal analysis. Tech. Rep., Carnegie Mellon University, Pittsburgh, PA.
7. Likhachev, M.; Gordon, G.; and Thrun, S. 2004. Planning for markov decision processes with sparse stochasticity. In Advances in Neural Information Processing Systems (NIPS) 17. Cambridge, MA: MIT Press.
8. Nilsson, N. 1971. Problem-Solving Methods in Artificial Intelligence. McGraw-Hill.
9. Papadimitriou, C. H., and Tsitsiklis, J. N. 1987. The complexity of Markov decision processses. Mathematics of Operations Research 12(3):441-450.
10. Pineau, J.; Gordon, G.; and Thrun, S. 2003. Point-based value iteration: An anytime algorithm for pomdps. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI).
11. Roy, N., and Gordon, G. 2002. Exponential family pea for belief compression in pomdps. In Advances in Neural Information Processing Systems.
12. Spaan, M., and Vlassis, N. 2004. A point-based POMDP algorithm for robot planning. In Proceedings of the IEEE International Conference on Robotics and Automation, 2399-2404.
13. Stentz, A. 1996. Map-based strategies for robot navigation in unknown environments. In AAAI Spring Symposium on Planning with Incomplete Information for Robot Problems.