Symbolic perimeter abstraction heuristics for cost-optimal planning

Artificial Intelligence 259 (C):1-31 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Optimal admissible composition of abstraction heuristics.Michael Katz & Carmel Domshlak - 2010 - Artificial Intelligence 174 (12-13):767-798.
Landmark-enhanced abstraction heuristics.Carmel Domshlak, Michael Katz & Sagi Lefler - 2012 - Artificial Intelligence 189 (C):48-68.
Planning as satisfiability: Heuristics.Jussi Rintanen - 2012 - Artificial Intelligence 193 (C):45-86.
Planning in a hierarchy of abstraction spaces.Earl D. Sacerdoti - 1974 - Artificial Intelligence 5 (2):115-135.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,405,108)

6 months
3 (#1,207,367)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
Automatically generating abstractions for planning.Craig A. Knoblock - 1994 - Artificial Intelligence 68 (2):243-302.
Optimal admissible composition of abstraction heuristics.Michael Katz & Carmel Domshlak - 2010 - Artificial Intelligence 174 (12-13):767-798.

View all 8 references / Add more references