Search Algorithms Under Different Kinds of Heuristics—A Comparative Study

DOI10.1145/322358.322359MaRDI QIDQ3962476zbMATH OpenOpenAlexFDO

Authors

Publication date 1983

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

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

zbMATH Keywords

heuristic searchadmissibilitybranch-and-bound algorithms

Mathematics Subject Classification ID

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

Cited in

(11)

• An upper bound on the time complexity of iterative-deepening-\(A^*\)
• Increasing search efficiency using multiple heuristics
• Heuristic search through islands
• Heuristically ordered search in state graphs
• Heuristic estimates in shortest path algorithms
• Heuristic search strategies for multiobjective state space search
• Properties of a class of trivalent network graphs and optimal routing
• Inconsistent heuristics in theory and practice
• A new variant of the \(A^*\)-algorithm which closes a node at most once.
• Utility of pathmax in partial order heuristic search
• New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.

This page was built for publication: Search Algorithms Under Different Kinds of Heuristics—A Comparative Study

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