Inference and decomposition in planning using causal consistent chains

ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2009, Pages 217-224

  Lipovetzky, Nir ^a   Geffner, Hector ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CAUSAL CHAINS; CONSISTENT PATH; NO SEARCH; PATH-BASED; PLANNING ALGORITHMS; RUNNING-IN;

PLANNING;

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

References (14)

1. Blum, A., and Furst, M. 1995. Fast planning through planning graph analysis, In Proc. IJCAI-95, 1636-1642.
2. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
3. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proc. of the Fifth International Conference on AI Planning Systems (AIPS-2000), 70-82.
4. Helmert, M. 2006. The Fast Downward planning system. Journal of Artificial Intelligence Research 26:191-246.
5. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302. (Pubitemid 33738066)
6. Hoffmann, J. 2003. The metric-ff planning system: Translating "ignoring delete lists" to numeric state variables. J. Artif. Intell. Res. (JAIR) 20:291-341.
7. Keyder, E., and Geffner, H. 2008. Heuristics for planning with action costs revisited. In 18th European Conference on Artificial Intelligence (ECAI-08).
8. Koehler, J., and Hoffmann, J. 2000. On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. JAIR 12:338-386. (Pubitemid 33682100)
9. McAllester, D., and Rosenblitt, D. 1991. Systematic nonlinear planning. In Proceedings of AAAI-91, 634-639.
10. Nebel, B.; Dimopoulos, Y.; and Koehler, J. 1997. Ignoring irrelevant facts and operators in plan generation. In Proc. ECP, 338-350.
11. Nguyen, X. L., and Kambhampati, S. 2001. Reviving partial order planning. In Proc. IJCAI-01.
12. Richter, S., and Westphal, M. 2008. The LAMA planner: Using landmark counting in heuristic search. In 6th. Int. Planning Competition Booklet (ICAPS-06).
13. Tate, A. 1977. Generating project networks. In Proc. IJCAI, 888-893.
14. Vidal, V., and Geffner, H. 2005. Solving simple planning problems with more inference and no search. In Proc. CP-05,