Compiling uncertainty away in conformant planning problems with bounded width

Journal of Artificial Intelligence Research

Volumn 35, Issue , 2009, Pages 623-675

  Palacios, Hector ^a   Geffner, Hector ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONICS ENGINEERING;

CONFORMANT PLANNING; GENERAL TRANSLATION; INITIAL SITUATION; INITIAL STATE; INTERNATIONAL PLANNING COMPETITIONS; PATH FINDING PROBLEMS; SEQUENCE OF ACTIONS; TRANSLATION MAPS;

ARTIFICIAL INTELLIGENCE;

EID: 77956048571     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.2708     Document Type: Article

References (30)

1. Albore, A., Palacios, H., & Geffner, H. (2009). A translation-based approach to contingent planning. In Proc. 21st Int. Joint Conference on AI (IJCAI-09), pp. 1623–1628.
2. Baral, C., Kreinovich, V., & Trejo, R. (2000). Computational complexity of planning and approximate planning in the presence of incompleteness. Artificial Intelligence, 122(1-2), 241–267.
3. Baral, C., & Son, T. C. (1997). Approximate reasoning about actions in presence of sensing and incomplete information. In Proc. ILPS 1997, pp. 387–401.
4. Bayardo Jr., R., & Schrag, R. (1997). Using CSP look-back techniques to solve real-world sat instances. In Proc. AAAI, pp. 203–208.
5. Bertoli, P., & Cimatti, A. (2002). Improving heuristics for planning as search in belief space. In Ghallab, M., Hertzberg, J., & Traverso, P. (Eds.), Proc. AIPS-2002, pp. 143–152. AAAI Press.
6. Bonet, B., & Geffner, H. (1999). Planning as heuristic search: New results. In Proceedings of ECP-99, pp. 359–371. Springer.
7. Bonet, B., & Geffner, H. (2000). Planning with incomplete information as heuristic search in belief space. In Proc. of AIPS-2000, pp. 52–61. AAAI Press.
8. Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 129(1–2), 5–33.
9. Bonet, B., & Givan, B. (2006). Results of the conformant track of the 5th int. planning competition. At http://www.ldc.usb.ve/∼bonet/ipc5/docs/results-conformant.pdf.
10. Bryce, D., & Buffet, O. (2008). International planning competition uncertainty part: Benchmarks and results. At http://ippc-2008.loria.fr/wiki/images/0/03/Results.pdf.
11. Bryce, D., Kambhampati, S., & Smith, D. E. (2006). Planning graph heuristics for belief space search. Journal of Artificial Intelligence Research, 26, 35–99.
12. Cimatti, A., Roveri, M., & Bertoli, P. (2004). Conformant planning via symbolic model checking and heuristic search. Artificial Intelligence, 159, 127–206.
13. Dechter, R. (2003). Constraint Processing. Morgan Kaufmann.
14. Goldman, R. P., & Boddy, M. S. (1996). Expressive planning and explicit knowledge. In Proc. AIPS-1996, pp. 110–117.
15. Haslum, P., & Jonsson, P. (1999). Some results on the complexity of planning with incomplete information. In Proc. ECP-99, Lect. Notes in AI Vol 1809, pp. 308–318. Springer.
16. Hoffmann, J., & 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), pp. 71–80. AAAI.
17. Hoffmann, J., & Brafman, R. (2006). Conformant planning via heuristic forward search: A new approach. Artificial Intelligence, 170(6-7), 507–541.
18. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253–302.
19. Marquis, P. (2000). Consequence finding algorithms. In Gabbay, D., & Smets, P. (Eds.), Handbook on Defeasible Reasoning and Uncertainty Management Systems, Vol. 5, pp. 41–145. Kluwer.
20. Palacios, H., & Geffner, H. (2006). Compiling uncertainty away: Solving conformant planning problems using a classical planner (sometimes). In Proc. AAAI-06, pp. 900–905.
21. Palacios, H., & Geffner, H. (2007). From conformant into classical planning: Efficient translations that may be complete too. In Proc. ICAPS-07, pp. 264–271.
22. Petrick, R., & Bacchus, F. (2002). A knowledge-based approach to planning with incomplete information and sensing. In Proc. AIPS-02, pp. 212–221.
23. Rintanen, J. (2004). Complexity of planning with partial observability. In Proc. ICAPS-2004, pp. 345–354.
24. Smith, D., & Weld, D. (1998). Conformant graphplan. In Proceedings AAAI-98, pp. 889–896. AAAI Press.
25. Son, T. C., Tu, P. H., Gelfond, M., & Morales, A. (2005). Conformant planning for domains with constraints: A new approach. In Proc. AAAI-05, pp. 1211–1216.
26. Son, T. C., & 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), pp. 481–491.
27. Tison, P. (1967). Generalized consensus theory and applications to the minimization of boolean circuits. IEEE Transactions on Computers, EC-16(4), 446–456.
28. Tran, D., Nguyen, H., Pontelli, E., & Son, T. C. (2008). CPA(C)/(H): Two approximation-based conformant planners. At http://ippc-2008.loria.fr/wiki/images/5/57/Team2CPA.pdf.
29. Tran, D., Nguyen, H., Pontelli, E., & Son, T. C. (2009). Improving performance of conformant planners: Static analysis of declarative planning domain specifications. In Practical Aspects of Declarative Languages, 11th International Symposium, PADL 2009,Pro-ceedings, Vol. 5418 of Lecture Notes in Computer Science, pp. 239–253. Springer.
30. Turner, H. (2002). Polynomial-length planning spans the polynomial hierarchy. In JELIA ’02: Proc. of the European Conference on Logics in AI, pp. 111–124. Springer-Verlag.