A new variant of the \(A^*\)-algorithm which closes a node at most once.

DOI10.1007/BF01531177zbMath1034.68712OpenAlexW2026091073MaRDI QIDQ1354068

Sukhamay Kundu

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01531177

zbMATH Keywords

\(A^*\)-algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Artificial intelligence (68T99)

Related Items (2)

The complexity of searching implicit graphs ⋮ The complexity of searching succinctly represented graphs

Cites Work

• Unnamed Item
• Heuristic search through islands
• A heuristic search algorithm with modifiable estimate
• Depth-first iterative-deepening: An optimal admissible tree search
• On the complexity of admissible search algorithms
• On the optimality of A
• The heuristic search under conditions of error
• Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
• The Power of Dominance Relations in Branch-and-Bound Algorithms

This page was built for publication: A new variant of the \(A^*\)-algorithm which closes a node at most once.