PAO* for planning with hidden state

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2004, Issue 3, 2004, Pages 2840-2847

  Ferguson, Dave ^a   Stentz, Anthony ^a   Thrun, Sebastian ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTATIONAL METHODS; DECISION THEORY; GRAPH THEORY; HEURISTIC METHODS; OPTIMAL CONTROL SYSTEMS; PROBABILITY DENSITY FUNCTION; PROBLEM SOLVING;

COST FUNCTIONS; DECISION PROBLEMS WITH HIDDEN STATES (DPHS); DETERMINISTIC DECISION PROBLEMS (DDP); STATE TRANSITIONS;

MOTION PLANNING;

EID: 3042632210     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/robot.2004.1307491     Document Type: Conference Paper

References (12)

1. A. Stentz, "The focussed D* algorithm for real-time replanning," in Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1995.
2. S. Koenig and M. Likhachev, "Incremental A*," in Advances in Neural Information Processing Systems. MIT Press, 2002.
3. I. Nourbakhsh and M. Genesereth, "Assumptive planning and execution: a simple, working robot architecture," Autonomous Robots Journal, vol. 3, no. 1, pp, 49-67, 1996.
4. A. Bar-Noy and B. Schieber, "The Canadian Traveller Problem," in Proceedings of the second annual ACM-SIAM Symposium on Discrete Algorithms, 1991. pp. 261-270.
5. C. Chang and J. Slagle, "An admissible and optimal algorithm for searching AND-OR graphs," Artificial Intelligence, vol. 2, pp. 117-128, 1971.
6. N. Nilsson, Principles of Artificial Intelligence. Tioga Publishing, 1980.
7. L. Kaebling, M. Littman, and A. Cassandra, "Planning and acting in partially observable stochastic domains," Artificial Intelligence, vol. 101, 1998.
8. J. Pineau, G. Gordon, and S. Thrun, "Point-based value iteration: An anytime algorithm for POMDPs," in Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2003.
9. A. Moore and C. Atkeson, "Prioritized sweeping: reinforcement learning with less data and less time," Machine Learning, vol. 13, pp. 103-130, 1993.
10. C. Boutilier, R. Brafman, and C. Geib, "Structured reachability analysis for Markov Decision Processes," in Uncertainty in Artificial Intelligence, 1998.
11. A. Slum and M. Furst, "Fast planning through graph analysis," in Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Montreal. 1995, pp. 1636-1642.
12. E. Rich and K. Knight, Artificial Intelligence. McGraw-Hill, 1992.