Inconsistent heuristics in theory and practice

DOI10.1016/J.ARTINT.2011.02.001MaRDI QIDQ646508zbMATH OpenOpenAlexFDO

Authors Ariel Felner, Uzi Zahavi, Jonathan Schaeffer, Zhifu Zhang, Robert C. Holte, Nathan R. Sturtevant

Publication date 17 November 2011

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2011.02.001

zbMATH Keywords

heuristic search\(A^{*}admissible heuristicsIDA^{*}\)inconsistent heuristics

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Heuristics as Markov chains
• Generalized best-first search strategies and the optimality of A*
• Utility of pathmax in partial order heuristic search
• Increasing search efficiency using multiple heuristics
• Three approaches to heuristic search in networks

Cites work

• scientific article; zbMATH DE number 2243373 (Why is no real title available?)
• A general theory of additive state space abstractions
• A heuristic search algorithm with modifiable estimate
• Artificial intelligence. A new synthesis
• Breadth-first heuristic search
• Compressed pattern databases
• Depth-first iterative-deepening: An optimal admissible tree search
• Disjoint pattern database heuristics
• Duality in permutation state spaces and the dual search algorithm
• Frontier search
• Generalized best-first search strategies and the optimality of A*
• Maximizing over multiple pattern databases speeds up heuristic search
• On the asymptotic performance of IDA
• On the complexity of admissible search algorithms
• Predicting the performance of IDA\(^*\) using conditional distributions
• Real-time heuristic search
• Relative-order abstractions for the pancake problem
• Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
• Sorting with fixed-length reversals
• Time complexity of iterative-deepening-\(A^{*}\)

Cited in

(12)

• A framework for analysing state-abstraction methods
• Heuristics as Markov chains
• scientific article; zbMATH DE number 1696544 (Why is no real title available?)
• Probably bounded suboptimal heuristic search
• Predicting the performance of IDA\(^*\) using conditional distributions
• Heuristic search for one-to-many shortest path queries
• Lower bound sets for biobjective shortest path problems
• Rational deployment of multiple heuristics in optimal state-space search
• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• Utility of pathmax in partial order heuristic search
• Compatibility effects in the prescriptive application of psychological heuristics: inhibition, integration and selection
• The compressed differential heuristic

This page was built for publication: Inconsistent heuristics in theory and practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646508)