Heuristics for Planning with Action Costs Revisited

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 588-592

  Keyder, Emil ^a   Geffner, Héctor ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SETS; COST-SENSITIVE; HILL CLIMBING SEARCH; MATHEMATICAL FORMULATION; NON-UNIFORM; OVERALL COSTS; RELAXED PLANNING GRAPHS; SIMPLE++;

COSTS;

EID: 84879223199     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-588     Document Type: Conference Paper

References (17)

1. A. Blum and M. Furst, ‘Fast planning through planning graph analysis’, in Proc. IJCAI-95, pp. 1636–1642, (1995).
2. B. Bonet and H. Geffner, ‘Planning as heuristic search’, Artificial Intelligence, 129(1–2), 5–33, (2001).
3. R. Brafman and C. Domshlak, ‘Structure and complexity of planning with unary operators’, JAIR, 18, 315–349, (2003).
4. R. Brafman and C. Domshlak, ‘Factored planning: How, when, and when not’, in Proc. AAAI-06, (2006).
5. Y. Chen, B. W. Wah, and C. Hsu, ‘Temporal planning using subgoal partitioning and resolution in SGPlan’, JAIR, 26, 323–369, (2006).
6. M. Do and S. Kambhampati, ‘Sapa: A domain-independent heuristic metric temporal planner’, in Proc. ECP 2001, pp. 82–91, (2001).
7. R. Fuentetaja, D. Borrajo, and C. Linares, ‘Improving relaxed planning graph heuristics for metric optimization’, in Proc. 2006 AAAI Workshop on Heuristic Search, (2006).
8. A. Gerevini, A. Saetti, and Ivan Serina, ‘Planning through stochastic local search and temporal action graphs in LPG’, JAIR, 20, 239–290, (2003).
9. M. Helmert, ‘A planning heuristic based on causal graph analysis’, in Proc. ICAPS-04, pp. 161–170, (2004).
10. J. Hoffmann, ‘The Metric-FF planning system: Translating”ignoring delete lists” to numeric state variables’, JAIR, 20, 291–341, (2003).
11. J. Hoffmann and B. Nebel, ‘The FF planning system: Fast plan generation through heuristic search’, JAIR, 14, 253–302, (2001).
12. E. Keyder and H. Geffner, ‘Heuristics for planning with action costs’, in Proc. Spanish AI Conference (CAEPIA 2007), volume 4788 of Lecture Notes in Computer Science, pp. 140–149. Springer, (2007).
13. E. Keyder and H. Geffner, ‘Set-additive and TSP heuristics for planning with action costs and soft goals’, in ICAPS-07 Workshop on Heuristics for Domain Independent Planning, (2007).
14. S. Lin and B. W. Kernighan, ‘An effective heuristic algorithm for the TSP’, Operations Research, 21, 498–516, (1973).
15. Derek Long and Maria Fox, ‘Automatic synthesis and use of generic types in planning.’, in Proc. AIPS-2000, pp. 196–205, (2000).
16. O. Sapena and E. Onaindia, ‘Handling numeric criteria in relaxed planning graphs’, in Advances in Artificial Intelligence: Proc. IBERAMIA 2004, LNAI 3315, pp. 114–123. Springer, (2004).
17. D. E. Smith, ‘Choosing objectives in over-subscription planning’, in Proc. ICAPS-04, pp. 393–401, (2004).