Maximizing over multiple pattern databases speeds up heuristic search

DOI10.1016/J.ARTINT.2006.09.002MaRDI QIDQ2457594zbMATH OpenOpenAlexFDO

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

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

admissible heuristicsheuristic searchIDA*pattern databases

Mathematics Subject Classification ID

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

Recommendations

• Automated Creation of Pattern Database Search Heuristics
• Disjoint pattern database heuristics
• Heuristic search in restricted memory
• Compressed pattern databases
• scientific article; zbMATH DE number 1784975

Cites work

• \(\text{BIDA}^*\): An improved perimeter search algorithm
• 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
• scientific article; zbMATH DE number 1759719 (Why is no real title available?)
• scientific article; zbMATH DE number 2159167 (Why is no real title available?)
• scientific article; zbMATH DE number 2243373 (Why is no real title available?)
• Maximizing over multiple pattern databases speeds up heuristic search
• Time complexity of iterative-deepening-\(A^{*}\)
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(14)

• Increasing search efficiency using multiple heuristics
• 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
• A formal analysis of why heuristic functions work
• Merge-and-Shrink Abstraction
• Automated Creation of Pattern Database Search Heuristics
• Solving the Watchman Route Problem with Heuristic Search
• Knowledge Discovery in Inductive Databases
• Inconsistent heuristics in theory and practice
• Maximisation of admissible multi-objective heuristics
• New methods for proving the impossibility to solve problems through reduction of problem spaces
• Optimal Sokoban solving using pattern databases with specific domain knowledge

This page was built for publication: Maximizing over multiple pattern databases speeds up heuristic search

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