Heuristics for planning with action costs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4788 LNAI, Issue , 2007, Pages 140-149

  Keyder, Emil ^a   Geffner, Hector ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; ENCODING (SYMBOLS); ONLINE SEARCHING;

ACTION COSTS; HILL CLIMBING SEARCH;

HEURISTIC METHODS;

EID: 38349006406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75271-4_15     Document Type: Conference Paper

References (14)

1. Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence 129(1-2), 5-33 (2001)
2. Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14, 253-302 (2001)
3. Sapena, O., Onaindia, E.: Handling numeric criteria in relaxed planning graphs. In: Lemaître, C., Reyes, CA., González, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol. 3315, pp. 114-123. Springer, Heidelberg (2004)
4. Fuentetaja, R., Borrajo, D., Linares, C.: Improving relaxed planning graph heuristics for metric optimization. In: Proc. 2006 AAAI Workshop on Heuristic Search, Memory Based Heuristics and its Applications, pp. 79-86 (2006)
5. Blum, A., Furst, M.: Fast planning through planning graph analysis. In: Proceedings of IJCAI 1995, pp. 1636-1642. Morgan Kaufmann, San Francisco (1995)
6. Haslum, P., Geffner, H.: Admissible heuristics for optimal planning. In: Proc. of the Fifth International Conference on AI Planning Systems (AIPS-2000), pp. 70-82 (2000)
7. Bonet, B., Loerincs, G., Geffner, H.: A robust and fast action selection mechanism for planning. In: Proceedings of AAAI 1997, pp. 714-719. MIT Press, Cambridge (1997)
8. Do, M.B., Kambhampati, S.: Sapa: A domain-independent heuristic metric temporal planner. In: Proc. ECP 2001, pp. 82-91 (2001)
9. Smith, D.E.: Choosing objectives in over-subscription planning. In: Proc. ICAPS 2004, pp. 393-401 (2004)
10. Bertsekas, D.: Linear Network Optimization: Algorithms and Codes. MIT Press, Cambridge (1991)
11. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1989)
12. Liu, Y., Koenig, S., Furcy, D.: Speeding up the calculation of heuristics for heuristic search-based planning. In: Proc AAAI 2002, pp. 484-491 (2002)
13. Blizard, W.D.: Multiset theory. Notre Dame J. Formal Logic 30(1), 36-66 (1988)
14. Hoffmann, J.: The metric-ff planning system: Translating "ignoring delete lists" to numeric state variables. J. Artif. Intell. Res (JAIR) 20, 291-341 (2003)