A multi-path compilation approach to contingent planning

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2012, Pages 1868-1874

  Brafman, Ronen I ^a   Shani, Guy ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PLANNING; CONDITIONAL PLANS; DEAD-ENDS; PLANNING PROBLEM;

ARTIFICIAL INTELLIGENCE;

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

References (8)

1. Albore, A.; Palacios, H.; and Geffner, H. 2009. A translation-based approach to contingent planning. In IJCAI, 1623-1628.
2. Bonet, B., and Geffner, H. 2011. Planning under partial observability by classical replanning: Theory and experiments. In IJCAI'11.
3. Bonet, B.; Palacios, H.; and Geffner, H. 2009. Automatic derivation of memoryless policies and finite-state controllers using classical planners. In ICAPS.
4. Fagin, R.; Halpern, J. Y.; Moses, Y.; and Vardi, M. Y. 1995. Reasoning about Knowledge. MIT Press.
5. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
6. Palacios, H., and Geffner, H. 2009. Compiling uncertainty away in conformant planning problems with bounded width. JAIR 35:623-675.
7. Shani, G., and Brafman, R. I. 2011. Replanning in domains with partial information and sensing actions. In IJCAI, 2021-2026.
8. Yoon, S. W.; Fern, A.; and Givan, R. 2007. Ff-replan: A baseline for probabilistic planning. In ICAPS.