Cost-optimal planning with landmarks

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 1728-1733

  Karpas, Erez ^a   Domshlak, Carmel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COST BENEFIT ANALYSIS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; PLANNING;

BEST FIRST SEARCH; EMPIRICAL EVALUATIONS; HEURISTIC SEARCH; MULTIPATHS; OPTIMAL PLANNING; SATISFICING; STATE OF THE ART;

OPTIMIZATION;

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

References (12)

1. C. Bäckström and B. Nebel. Complexity results for SAS+ planning. Comp. Intell., 11(4):625-655, 1995.
2. B. Bonet and H. Geffner. Planning as heuristic search. AIJ, 129(1-2):5-33, 2001.
3. Rina Dechter and Judea Pearl. Generalized best-first search strategies and the optimality of A*. J. ACM, 32(3):505-536, 1985.
4. M. Helmert, P. Haslum, and J. Hoffmann. Flexible abstraction heuristics for optimal sequential planning. In ICAPS, pages 176-183, 2007.
5. M. Helmert. The Fast Downward planning system. JAIR, 26:191-246, 2006.
6. Malte Helmert. Concise finite-domain representations for pddl planning tasks. AIJ, 173(5-6):503-535, 2009.
7. J. Hoffmann, J. Porteous, and L. Sebastia. Ordered landmarks in planning. JAIR, 22:215-278, 2004.
8. J. Porteous and S. Cresswell. Extending landmarks analysis to reason about resources and repetition. In PLANSIG, 2002.
9. J. Porteous, L. Sebastia, and J. Hoffmann. On the extraction, ordering, and usage of landmarks in planning. In ECP, 2001.
10. S. Richter, M. Helmert, and M. Westphal. Landmarks revisited. In AAAI, pages 975-982, 2008.
11. V. Vidal and H. Geffner. Branching and pruning: An optimal temporal POCL planner based on constraint programming. AIJ, 170(3):298-335, 2006.
12. L. Zhu and R. Givan. Heuristic planning via roadmap deduction. In IPC-4, pages 64-66, 2004.