Optimal admissible composition of abstraction heuristics

&
Artificial Intelligence 174 (12-13):767-798 (2010)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2010.04.021

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,174

External links

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

Through your library

My notes

Similar books and articles

Symbolic perimeter abstraction heuristics for cost-optimal planning.Álvaro Torralba, Carlos Linares López & Daniel Borrajo - 2018 - Artificial Intelligence 259 (C):1-31.
Quantitatively relating abstractness to the accuracy of admissible heuristics.Armand Prieditis & Robert Davis - 1995 - Artificial Intelligence 74 (1):165-175.
An admissible and optimal algorithm for searching AND/OR graphs.C. L. Chang & J. R. Slagle - 1971 - Artificial Intelligence 2 (2):117-128.
Landmark-enhanced abstraction heuristics.Carmel Domshlak, Michael Katz & Sagi Lefler - 2012 - Artificial Intelligence 189 (C):48-68.
Boosting optimal symbolic planning: Operator-potential heuristics.Daniel Fišer, Álvaro Torralba & Jörg Hoffmann - 2024 - Artificial Intelligence 334 (C):104174.
Rational deployment of multiple heuristics in optimal state-space search.Erez Karpas, Oded Betzalel, Solomon Eyal Shimony, David Tolpin & Ariel Felner - 2018 - Artificial Intelligence 256 (C):181-210.
The effects of order on learning classifications by example: Heuristics for finding the optimal order.James N. MacGregor - 1988 - Artificial Intelligence 34 (3):361-370.
Optimal composition of real-time systems.Shlomo Zilberstein & Stuart Russell - 1996 - Artificial Intelligence 82 (1-2):181-213.
On the complexity of admissible search algorithms.Alberto Martelli - 1977 - Artificial Intelligence 8 (1):1-13.
The nature of heuristics.Douglas B. Lenat - 1982 - Artificial Intelligence 19 (2):189-249.

Analytics

Added to PP
2020-12-22

Downloads
11 (#1,422,077)

6 months
5 (#1,050,400)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Landmark-enhanced abstraction heuristics.Carmel Domshlak, Michael Katz & Sagi Lefler - 2012 - Artificial Intelligence 189 (C):48-68.
Backdoors to planning.Martin Kronegger, Sebastian Ordyniak & Andreas Pfandler - 2019 - Artificial Intelligence 269 (C):49-75.

Add more citations

References found in this work

The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.

Add more references