Inconsistent heuristics in theory and practice

DOI10.1016/J.ARTINT.2011.02.001zbMATH Open1225.68244OpenAlexW2102323131MaRDI QIDQ646508FDOQ646508

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

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

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)

Cites Work

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

Cited In (12)

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

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)