From conformant into classical planning: Efficient translations that may be complete too

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 264-271

  Palacios, Héctor ^a   Geffner, Héctor ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PLANNING; CLASSICAL PROBLEMS; CONDITION; DETERMINISTICS; EXPONENTIALS; INITIAL SITUATION; INTERNATIONAL PLANNING COMPETITIONS; LITERALS; TRANSLATION SCHEMES;

SCHEDULING;

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

References (17)

1. Baral, C., and Son, T. C. 1997. Approximate reasoning about actions in presence of sensing and incomplete information. In Proc. ILPS I997, 387-401.
2. Bonet, B., and Geffner, H. 2000. Planning with incomplete information as heuristic search in belief space. In Proc. of AIPS-2000, 52-61. AAAI Press.
3. Bonet, B., and Givan, B. 2006. Results of the conformant track of the 5th int. planning competition. At http://www.ldc.usb.ve/bonet/ipc5/docs/ resultsconformant.pdf.
4. Brafman, R., and Hoffmann, J. 2004. Conformant planning via heuristic forward search: A new approach. In Proc. ICAPS-04.
5. Bryce, D.; Kambhampati, S.; and Smith, D. E. 2006. Planning graph heuristics for belief space search. Journal of AI Research 26:35-99.
6. Cimatti, A.; Roveri, M.; and Bertoli, P. 2004. Conformant planning via symbolic model checking and heuristic search. Artificial Intelligence 159:127-206.
7. Goldman, R. P., and Boddy, M. S. 1996. Expressive planning and explicit knowledge. In Proc. AIPS-1996.
8. Haslum, P., and Jonsson, P. 1999. Some results on the complexity of planning with incomplete information. In Proc. ECP-99, Lect. Notes in AI Vol 1809, 308-318. Springer.
9. Hoffmann, J., and Brafman, R. 2005. Contingent planning via heuristic forward search with implicit belief states. In Proc. 15th Int. Conf. on Automated Planning and Scheduling (ICAPS 2005), 71-80. AAAI.
10. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
11. Marquis, P. 2000. Consequence finding algorithms. In Gabbay, D., and Smets, P., eds., Handbook on Defeasible Reasoning and Uncertainty Management Systems, volume 5. Kluwer. 41-145.
12. Palacios, H., and Geffner, H. 2006. Compiling uncertainty away: Solving conformant planning problems using a classical planner (sometimes). In Proc. AAAI-06.
13. Petrick, R., and Bacchus, F. 2002. A knowledge-based approach to planning with incomplete information and sensing. In Proc. AIPS'02, 212-221.
14. Rintanen, J. 2004. Complexity of planning with partial observability. In Proc. ICAPS-2004, 345-354.
15. Smith, D., and Weld, D. 1998. Conformant graphplan. In Proceedings AAAI-98, 889-896. AAAI Press.
16. Son, T. C., and Tu, P. H. 2006. On the completeness of approximation based reasoning and planning in action theories with incomplete information. In Proc. 10th Int. Conf. on Principles of KR and Reasoning (Kr-06), 481-491.
17. Son, T. C.; Tu, P. H.; Gelfond, M.; and Morales, A. 2005. Conformant planning for domains with constraints: A new approach. In Proc. AAAI-05, 1211-1216.