Maximizing over multiple pattern databases speeds up heuristic search

DOI10.1016/j.artint.2006.09.002zbMath1130.68323MaRDI QIDQ2457594

Ariel Felner, Robert C. Holte, David Furcy, Jack Newton, Ram Meshulam

Publication date: 23 October 2007

Published in: Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

heuristic search; IDA*; pattern databases; admissible heuristics

Mathematics Subject Classification ID

68P15: Database theory

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

Related Items

Inconsistent heuristics in theory and practice, New methods for proving the impossibility to solve problems through reduction of problem spaces, Optimal Sokoban solving using pattern databases with specific domain knowledge, Potential-based bounded-cost search and anytime non-parametric A*, Heuristics as Markov chains, Duality in permutation state spaces and the dual search algorithm, Maximizing over multiple pattern databases speeds up heuristic search, Merge-and-Shrink Abstraction

Cites Work

• Depth-first iterative-deepening: An optimal admissible tree search
• \(\text{BIDA}^*\): An improved perimeter search algorithm
• Duality in permutation state spaces and the dual search algorithm
• Maximizing over multiple pattern databases speeds up heuristic search
• Tools and Algorithms for the Construction and Analysis of Systems
• Time complexity of iterative-deepening-\(A^{*}\)
• Disjoint pattern database heuristics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item