Heuristics for planning with penalties and rewards using compiled knowledge

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2006, Pages 452-462

  Bonet, Blai ^a   Geffner, Héctor ^b  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS;

AUTOMATIC DERIVATION; CLASSICAL PLANNING; FLUENTS; HEURISTIC FUNCTIONS; LARGE SPACES; PLANNING MODELS;

KNOWLEDGE REPRESENTATION;

EID: 57749207001     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (42)

1. Anger, C.; Konczak, K.; Linke, T.; and Schaub, T. 2005. A glimpse of answer set programming. Künstliche Intelligenz 19(1):12-17.
2. Apt, K. R., and Bezem, M. 1990. Acyclic programs. In Proc. 7th Int. Conf. on Logic programming, 617-633.
3. Bacchus, F. 2001. The 2000 AI Planning Systems Competition. Artificial Intelligence Magazine 22(3).
4. Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
5. Ben-Eliyahu, R., and Dechter, R. 1994. Propositional semantics for disjunctive logic programs. Ann. Math. Artif. Intell. 12(1-2):53-87.
6. Bertsekas, D. 1995. Dynamic Programming and Optimal Control, Vols 1 and 2. Athena Scientific.
7. Blum, A., and Furst, M. 1995. Fast planning through planning graph analysis. In Proceedings of IJCAI-95, 1636- 1642. Morgan Kaufmann.
8. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
9. Bonet, B.; Loerincs, G.; and Geffner, H. 1997. A robust and fast action selection mechanism for planning. In Proceedings of AAAI-97, 714-719. MIT Press.
10. Boutilier, C.; Brafman, R.; Domshlak, C.; Hoos, H.; and Poole, D. 2004. Cp-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. (JAIR) 21:135-191.
11. Brafman, R. I., and Chernyavsky, Y. 2005. Planning with goal preferences and constraints. In Proc. ICAPS-05, 182- 191.
12. Bylander, T. 1994. The computational complexity of STRIPS planning. Artificial Intelligence 69:165-204.
13. Clark, K. 1978. Negation as failure. In Gallaire, H., and Minker, J., eds., Logic and Data Bases. Plenum. 293-322.
14. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):319-333.
15. Damasio, A. 1995. Descartes'Error: Emotion, Reason, and the Human Brain. Quill.
16. Darwiche, A., and Marquis, P. 2002. A knowledge compilation map. J. of AI Research 17:229-264.
17. Darwiche, A., and Marquis, P. 2004. Compiling propositional weighted bases. Artif. Intell. 157(1-2):81-113.
18. Darwiche, A. 2001. Decomposable negation normal form. J. ACM 48(4):608-647.
19. Darwiche, A. 2002. On the tractable counting of theory models and its applications to belief revision and truth maintenance. J. of Applied Non-Classical Logics.
20. Edelkamp, S. 2001. Planning with pattern databases. In Proc. ECP 2001.
21. Evans, D., and Cruse, P., eds. 2004. Emotion, Evolution and Rationality. Oxford.
22. Geffner, H. 2004. Planning graphs and knowledge compilation. In Proc. of the Int. Conf. on Principles of Knowledge Representation and Reasoning (KR-04), 662-672.
23. Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. In Kowalski, R. A., and Bowen, K., eds., Proc. of the Fifth International Conference on Logic Programming, 1070-1080. The MIT Press.
24. Giunchiglia, E.; Kartha, N.; and Lifschitz, V. 1997. Representing action: indeterminacy and ramifications. Artificial Intelligence 95:409-443.
25. 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.
26. Haslum, P.; Bonet, B.; and Geffner, H. 2005. New admissible heuristics for optimal planning. In Proc. AAAI-05.
27. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
28. Hoffmann, J. 2003. Utilizing Problem Structure in Planning: A Local Search Approach (LNAI 2854). Springer- Verlag.
29. Kautz, H. A., and Selman, B. 1992. Planning as satisfiability. In Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI'92), 359-363.
30. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of AAAI-96, 1194-1201. AAAI Press/MIT Press.
31. Lin, F., and Zhao, Y. 2002. ASSAT: computing answer sets of a logic program by sat solvers. In Proc. AAAI-2002, 112-117.
32. Lin, F., and Zhao, J. 2003. On tight logic programs and yet another translation from normal logic programs to propositional logic. In Proc. IJCAI-03, 853-858.
33. Lloyd, J. 1987. Foundations of Logic Programming. Springer-Verlag.
34. McDermott, D. 1996. A heuristic estimator for meansends analysis in planning. In Proc. Third Int. Conf. on AI Planning Systems (AIPS-96).
35. Moskewicz, M. W.; Madigan, C. F.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an Efficient SAT Solver. In Proc. of the 38th Design Automation Conference (DAC'01).
36. Nebel, B. 2000. On the compilability and expressive power of propositional planning. Journal of Artificial Intelligence Research 12:271-315.
37. Pearl, J. 1983. Heuristics. Addison Wesley.
38. Russell, S., and Norvig, P. 1994. Artificial Intelligence: A Modern Approach. Prentice Hall.
39. Simons, P.; Niemela, I.; and Soininen, T. 2002. Extending and implementing the stable model sem antics. Artificial Intelligence 138(1-2):181-234.
40. Smith, D. E. 2004. Choosing objectives in oversubscription planning. In Proc. ICAPS-04, 393-401.
41. Thiébaux, S.; Hoffmann, J.; and Nebel, B. 2005. In defense of pddl axioms. Artif. Intell. 168(1-2):38-69.
42. van den Briel, M.; Nigenda, R. S.; Do, M. B.; and Kambhampati, S. 2004. Effective approaches for partial satisfation (over-subscription) planning. In Proc. AAAI 2004, 562-569.