Studies in Semi-Admissible Heuristics

@article{Pearl1982StudiesIS,
  title={Studies in Semi-Admissible Heuristics},
  author={J. Pearl and J. Kim},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={1982},
  volume={PAMI-4},
  pages={392-399}
}
  • J. Pearl, J. Kim
  • Published 1982
  • Mathematics, Computer Science, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
The paper introduces three extensions of the A* search algorithm which improve the search efficiency by relaxing the admissibility condition. 1) A* employs an admissible heuristic function but invokes quicker termination conditions while still guaranteeing that the cost of the solution found will not exceed the optimal cost by a factor greater than 1 + . 2) R¿* may employ heuristic functions which occasionally violate the admissibility condition, but guarantees that at termination the risk of… Expand
151 Citations
Generalized best-first search strategies and the optimality of A*
  • 964
  • PDF
Multi-Heuristic A*
  • 101
  • PDF
A: an efficient near admissible heuristic search algorithm
  • 29
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
  • Highly Influenced
  • PDF
Quasi-exact BDD minimization using relaxed best-first search
  • R. Ebendt, R. Drechsler
  • Mathematics, Computer Science
  • IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design (ISVLSI'05)
  • 2005
  • 2
  • Highly Influenced
  • PDF
Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics
  • 25
  • PDF
Heuristic search under time and cost bounds
  • Highly Influenced
  • PDF
Faster than Weighted A*: An Optimistic Approach to Bounded Suboptimal Search
  • 69
  • PDF
Probably bounded suboptimal heuristic search
  • 5
Completeness and Admissibility for General Heuristic Search Algorithms—A Theoretical Study: Basic Concepts and Proofs
  • 16
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
The Heuristic Search under Conditions of Error
  • L. Harris
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1974
  • 84
Optimizing decision trees through heuristically guided search
  • 156
On the Complexity of Admissible Search Algorithms
  • A. Martelli
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1977
  • 157
Heuristic Search Theory: Survey of Recent Results
  • J. Pearl
  • Mathematics, Computer Science
  • IJCAI
  • 1981
  • 36
  • PDF
Probabilistic Analysis of the Complexity of A*
  • 47
  • PDF
On the Optimality of A*
  • D. Gelperin
  • Computer Science, Mathematics
  • Artif. Intell.
  • 1977
  • 158
  • PDF
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
  • 8,304
Problem-solving methods in artificial intelligence
  • N. Nilsson
  • Computer Science
  • McGraw-Hill computer science series
  • 1971
  • 1,495
...
1
2
...