Admissible heuristic

Known as: Inadmissible heuristic, Optimistic heuristic 
In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Recently two search algorithms, A* and breadthfirst branch and bound (BFBnB), were developed based on a simple admissible… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Admissible heuristics are critical for effective domainindependent planning when optimal solutions must be guaranteed. Two useful… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Recent algorithms like RTDP and LAO* combine the strength of Heuristic Search (HS) and Dynamic Programming (DP) methods by… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We describe a plnning algorithm that integrates two approaches to solving Markov decision processes with large state spaces… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper invents symbolic pattern databases (SPDB) to combine two influencing aspects for recent progress in domain-independent… (More)
  • figure 1
  • table 2
  • table 3
  • table 1
  • table 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
  • H Ector Geener
  • 2001
We present an algorithm for planning with metric time and certain kinds of resources, based on heuristic search. The heuristic is… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Many real world planning problems require goals with deadlines and durative actions that consume resources. In this paper, we… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
1998
1998
We analyze the asymptotic time complexity of admissible heuristic search algorithms such as A*, IDA*, and depth-first branch-and… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
1983
1983
Ahs&act. AND/OR graphs play a major role in heuristic problemsolving. Martelli and Montanari (1973) have developed an elegant… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1982
Highly Cited
1982
The paper introduces three extensions of the A* search algorithm which improve the search efficiency by relaxing the… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 8
Is this relevant?