Frontier search

DOI10.1145/1089023.1089024MaRDI QIDQ3546304zbMATH OpenOpenAlexFDO

Authors Richard E. Korf, Weixiong Zhang, Ignacio Thayer, Heath Hohwald

Publication date 21 December 2008

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1089023.1089024

zbMATH Keywords

\(A^\ast\) algorithmbest-first searchbidirectional searchbreadth-first searchDijkstra's algorithmheuristic searchsequence alignmentsliding-tile puzzlesTowers of Hanoi

Mathematics Subject Classification ID

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

Recommendations

• Linear-space best-first search
• scientific article; zbMATH DE number 1882050
• Breadth-first heuristic search
• Space complexity of combinatorial search
• Heuristic search in restricted memory

Cited in

(12)

• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• Iterative-deepening search with on-line tree size prediction
• Breadth-first heuristic search
• Space complexity of combinatorial search
• Linear-time disk-based implicit graph search
• Survey on Directed Model Checking
• Hierarchical Adaptive State Space Caching Based on Level Sampling
• scientific article; zbMATH DE number 1882050 (Why is no real title available?)
• Inconsistent heuristics in theory and practice
• Decision making with multiple objectives using GAI networks
• Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects
• Weighted A^* search - unifying view and application

This page was built for publication: Frontier search

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