Planning with goal utility dependencies

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1872-1878

  Do, Minh B ^a   Benton, J ^b   Van Den Briel, Menkes ^b   Kambhampati, Subbarao ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DOMAINS; GOAL UTILITY DEPENDENCIES; HEURISTIC SEARCH PLANNING; INDEPENDENCE MODELS; OPTIMALITY; REAL-WORLD PROBLEM; UTILITY VALUES;

HEURISTIC ALGORITHMS; INTEGER PROGRAMMING;

ARTIFICIAL INTELLIGENCE;

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

References (16)

1. F. Bacchus and A. Grove. Graphical models for preference and utility. In Proc. of UAI-95, 1995.
2. A. Blum and M. Furst. Planning through planning graph analysis. Artificial Intelligence Journal, 90:281-330, 1997.
3. B. Bonet, Loerincs G., and H. Geffner. A robust and fast action selection mechanism for planning. In Proceedings of AAAI-97, 1997.
4. C. Boutilier, T. Dean, and S. Hanks. Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research (JAIR), 11:1-91, 1999.
5. C. Boutilier, R. Brafman, H. Hoos, and D. Poole. Reasoning with conditional ceteris paribus preference statements. In Proc. of UAI-2001, 2001.
6. R.I. Brafman and Y. Chernyavsky. Planning with goal preferences and constraints. In Proceeding of ICAPS-05, 2005.
7. T. Bylander. The computational complexity of propositional strips planning. Artificial Intelligence Journal, 69:165-204, 1994.
8. M.B. Do and S. Kambhampati. Partial satisfaction (over-subscription) planning as heuristic search. In Proceedings of KBCS-04, 2004.
9. A. Gerevini, B. Bonet, and R. Givan. Fifth international planning competition. In IPC06 Booklet, 2006.
10. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.
11. D. Long and M. Fox. Exploiting a graphplan framework in temporal planning. In Proceedings of ICAPS-2003, 2003.
12. R.S. Nigenda and S. Kambhampati. Planning graph heuristics for selecting objectives in over-subscription planning problems. In Proceedings of ICAPS-05, 2005.
13. D.E. Smith. Choosing objectives in oversubscription planning. In Proceedings of ICAPS-04, 2004.
14. M.H.L. van den Briel, R.S. Nigenda, M.B. Do, and Subbarao Kambhampati. Effective approaches for partial satisfaction (over-subscription) planning. In Proceedings of AAAI-04, 2004.
15. M.H.L. van den Briel, T. Vossen, and S. Kambhampati. Reviving integer programming approaches for ai planning: A branch-and-cut framework. In Proceedings of ICAPS-05, 2005.
16. S. Wolfman and D.S. Weld. The LPSAT engine and its applicationto resource planning. In Proceedings of IJCAI-99, pages 310-317, 1999.