An admissible heuristic for SAS+ planning obtained from the state equation

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 2268-2274

  Bonet, Blai ^a  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; NON NEGATIVES; OPTIMAL PLANNING; PLANNING PROBLEM; PLANNING TASKS; POLYNOMIAL-TIME; STATE EQUATIONS; STATE OF THE ART;

ARTIFICIAL INTELLIGENCE; HEURISTIC METHODS; PLANNING; POLYNOMIAL APPROXIMATION;

EQUATIONS OF STATE;

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

References (21)

1. B. Bonet and H. Geffner. Planning as heuristic search. AIJ, 129(1-2):5-33, 2001.
2. B. Bonet and M. Helmert. Strengthening land mark heuristics via hitting sets. In Proc. ECAI, pages 329-334, 2010.
3. A. Coles, M. Fox, D. Long, and A. Smith. Additive-disjunctive heuristics for optimal planning. In Proc. ICAPS, pages 44-51, 2008.
4. C. Domshlak, E. Karpas, and S. Markovitch. Online speedup learning for optimal planning. JAIR, 44:709-755, 2012.
5. C. Domshlak, M. Katz, and S. Lefler. Land mark-enhanced abstration heuristics. AIJ, 189:48-68, 2012.
6. S. Edelkamp. Planning with pattern databases. In Proc. ECP, pages 13-24, 2001.
7. P. Haslum and H. Geffner. Admissible heuristic for optimal planning. In Proc. AIPS, pages 140-149, 2000.
8. P. Haslum, A. Botea, M. Helmert, B. Bonet, and S. Koenig. Domain-independent construction of pattern database heuristics for cost-optimal planning. In Proc. AAAI, pages 1007-1012, 2007.
9. M. Helmert and C. Domshlak. Land marks, critical paths and abstractions: What's the difference anyway? In Proc. ICAPS, pages 162-169, 2009.
10. M. Helmert, P. Haslum, and J. Hoffmann. Flexible abstraction heuristics for optimal sequential planning. In Proc. ICAPS, pages 176-183, 2007.
11. S. L. Hickmott and S. Sardi?na. Optimality properties of planning via Petri net unfolding: A formal analysis. In Proc. ICAPS, pages 170-177, 2009.
12. S. Hickmott, J. Rintanen, S. Thiébaux, and L. White. Planning via Petri net unfolding. In Proc. IJCAI, pages 1904-1911, 2007.
13. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.
14. J. Hoffmann, J. Porteous, and L. Sebastia. Ordered land marks in planning. JAIR, 22:215-278, 2004.
15. E. Karpas and C. Domshlak. Cost-optimal planning with land marks. In Proc. IJCAI, pages 1728-1733, 2009.
16. M. Katz and C. Domshlak. Structural patterns heuristics via fork decomposition. In Proc. ICAPS, pages 182-189, 2008.
17. B. Korte and J. Vygen. Combinatorial Optimization: Theory and Algorithms (2nd Edition). Springer, Berlin, Germany, 2001.
18. T. Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4):541-580, 1989.
19. S. Richter and M. Westphal. The LAMA planner: Guiding cost-based anytime planning with land marks. JAIR, 39(1):127-177, 2010.
20. M. van den Briel, J. Benton, S. Kambhampati, and T. Vossen. An LP-based heuristic for optimal planning. In Proc. CP, pages 651-665, 2007.
21. L. Zhu and R. Givan. Land mark extraction via planning graph propagation. In ICAPS Doctoral Consortium, pages 156-160, 2003.