Remarks on the \(\mathrm A^{\ast\ast}\) algorithm

DOI10.1515/AUSI-2015-0003zbMath1319.68204OpenAlexW2204472266MaRDI QIDQ2254543

Tibor Gregorics

Publication date: 5 February 2015

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/ausi-2015-0003

zbMATH Keywords

heuristic functionpath-finding problemgraph-search algorithms\(\mathrm A^{\ast\ast}\) algorithm

Mathematics Subject Classification ID

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

Cites Work

• On the complexity of admissible search algorithms
• Generalized best-first search strategies and the optimality of A*
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Remarks on the \(\mathrm A^{\ast\ast}\) algorithm