Planning with goal preferences and constraints

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 182-191

  Bralman, Ronen I ^a   Chernyavsky, Yuri ^b  

^a Stanford University   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION MODELING; ALGORITHM FOR SOLVING; CLASSICAL PLANNING; CONFIGURATION PLANNING; EXPERIMENTAL ANALYSIS;

ALGORITHMS;

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

References (20)

1. Bistarelli, S.; Frhwirth, T.; Marte, M. and Rossi, F. 2001. Soft constraint propagation and solving in constraint handling rules.
2. Blum, A. and Furst, M. L. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90:281- 300.
3. Boutilier, C.; Brafman, R.; Geib, C.; and Poole, D. 1997. A constraint-based approach to preference elicitation and decision making. In Proc. AAAI'97, 19-28.
4. Boutilier, C.; Brafman, R. I.; Domshlak, C.; Hoos, H. and Pool, D. 2004. Preference-Based Constrained Optimization with CP-Nets. Computational Intelligence, Special Issue on Preferences, to appear.
5. Brafman, R. and Domshlak, C. 2002. Introducing Variable Importance Tradeoffs into CP-Nets. In Proc. UAI'02.
6. Briel, M.; Sanchez, R.; Do, M. and Kambhampati, S. 2004. Effective Approaches for Partial Satisfaction (Over- Subscription) Planning. In Proc. ofAAAI'04.
7. Chernyavsky, Y. 2004. Planning with goal preferences and constraints. Master's thesis, CS Dept., Ben-Gurion University.
8. Do, M. B. and Kambhampati, S. 2001. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. Artificial Intelligence 132(2): 151-182.
9. Eiter, T.; Faber, W.; Leone, N.; Pfeifer, G. and Polleres, A. 2002. Answer set planning under action costs.
10. Estlin, T. and Gaines, D. 2002. An Optimization Framework for Interdependent Planning Goals. In Proc. AIPS'02, 21-28.
11. Haddawy and Hanks, S. 1993. Utility models for goal- directed decision theoretic planners. Technical Report TR- 93-06-04, University of Washington, Department of Computer Science and Engineering.
12. Kautz, H. and Selman, B. 1999. Unifying SAT-based and graph-based planning. In Proc. IJCAI'99.
13. Lopez, A. and Bacchus, F. 2003. Generalizing graphplan by formulating planning as a CSP. In Proc. IJCAl'03.
14. Miguel, I.; Jarvis, P. and Shen, Q. 2001. Efficient flexible planning via dynamic flexible constraint satisfaction. Engineering Applications of Artificial Intelligence 14(3):301- 327.
15. Rabideau, G.; Engelhardt, B. and Chien, S. 2000. Using Generic Preferences to Incrementally Improve Plan Quality. In Proc. AIPS'00.
16. Refanidis, I. and Vlahavas, I. 2001. Multiobjective heuristic state-space planning.
17. Smith, D. 2004. Choosing Objectives in Over-Subscription Planning. In Proc. ofICAPS'04.
18. Son, T. C. and Pontelli, E. 2004. Planning with Preferences using Logic Programming. In Proc. LPNMR'04, 247-260.
19. Tsang, C. 1993. Foundations of Constraint Satisfaction. Academic Press, New York.
20. Williamson, M. and Hanks, S. 1994. Utility-directed planning. In Proc. AIPS'94.