Soft goals can be compiled away

Journal of Artificial Intelligence Research

Volumn 36, Issue , 2009, Pages 547-556

  Keyder, Emil ^a   Geffner, Hector ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

PLANNING;

CLASSICAL MODEL; EXPRESSIVE POWER; INTERNATIONAL PLANNING COMPETITIONS; LEAST COST; SATISFICING; SEARCH ALGORITHMS; SIMPLE MODELING; SOFT GOALS;

OPTIMIZATION;

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

References (18)

1. Baier, J. A., Bacchus, F., & McIlraith, S. A. (2007). A heuristic search approach to planning with temporally extended preferences. In Proc. IJCAI-07, pp. 1808–1815.
2. Benton, J., Do, M., & Kambhampati, S. (2009). Anytime heuristic search for partial satisfaction planning. Artificial Intelligence, 173(5-6), 562–592.
3. Bonet, B., & Geffner, H. (2008). Heuristics for planning with penalties and rewards formulated in logic and computed through circuits. Artificial Intelligence, 172(12-13), 1579–1604.
4. Edelkamp, S. (2006). On the compilation of plan constraints and preferences. In Proc. ICAPS-06, pp. 374–377.
5. Edelkamp, S., & Jabbar, S. (2008). MIPS-XXL: Featuring external shortest path search for sequential optimal plans and external branch-and-bound for optimal net benefit. In 6th. Int. Planning Competition Booklet (ICAPS-08).
6. Edelkamp, S., & Kissmann, P. (2008). Gamer: Bridging planning and general game playing with symbolic search. In 6th. Int. Planning Competition Booklet (ICAPS-08).
7. Gazen, B., & Knoblock, C. (1997). Combining the expressiveness of UCPOP with the efficiency of Graphplan. In Steel, S., & Alami, R. (Eds.), Proc. 4th European Conf. on Planning, pp. 221–233. Springer.
8. Gerevini, A., & Long, D. (2006). Preferences and soft constraints in PDDL3. In Proc. ICAPS-06 Workshop on Preferences and Soft Constraints in Planning, pp. 46–53.
9. Haslum, P. (2008). Additive and reversed relaxed reachability heuristics revisited. In 6th. Int. Planning Competition Booklet (ICAPS-08).
10. Helmert, M., Do, M., & Refanidis, I. (2008). IPC 2008 deterministic competition. In 6th. Int. Planning Competition Booklet (ICAPS-08).
11. Howey, R., & Long, D. (2003). VAL’s progress: The automatic validation tool for PDDL2.1 used in the international planning competition. In Proc. 2003 ICAPS Workshop on The Competition: Impact, Organization, Evaluation, Benchmarks.
12. Hsu, C.-W., & Wah, B. W. (2008). The SGPlan planning system in IPC6. In 6th. Int. Planning Competition Booklet (ICAPS-08).
13. Keyder, E., & Geffner, H. (2007). Set-additive and TSP heuristics for planning with action costs and soft goals. In Proc. ICAPS-06 Workshop on Heuristics for Domain-Independent Planning.
14. Keyder, E., & Geffner, H. (2008). Heuristics for planning with action costs revisited. In Proc. 18th European Conference on Artificial Intelligence, pp. 588–592.
15. Nebel, B. (1999). Compilation schemes: A theoretical tool for assessing the expressive power of planning formalisms. In Proc. KI-99: Advances in Artificial Intelligence, pp. 183–194. Springer-Verlag.
16. Nebel, B. (2000). On the compilability and expressive power of propositional planning. Journal of Artificial Intelligence Research, 12, 271–315.
17. Sanchez, R., & Kambhampati, S. (2005). Planning graph heuristics for selecting objectives in over-subscription planning problems. In Proc. ICAPS-05, pp. 192–201.
18. Smith, D. E. (2004). Choosing objectives in over-subscription planning. In Proc. ICAPS-04, pp. 393–401.