Time complexity of A^**

MaRDI QIDQ5016595zbMATH OpenFDO

Authors Tibor Gregorics

Publication date 13 December 2021

Full work available at URL http://ac.inf.elte.hu/Vol_052_2021/163_52.pdf

zbMATH Keywords

heuristic algorithmheuristic graph-search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Remarks on the \(\mathrm A^{\ast\ast}\) algorithm
• The time complexity of \(A^*\) with approximate heuristics on multiple-solution search spaces
• A result on the computational complexity of heuristic estimates for the A^* algorithm
• scientific article; zbMATH DE number 67463
• New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.

Cited in

(1)

• The time complexity of \(A^*\) with approximate heuristics on multiple-solution search spaces

This page was built for publication: Time complexity of \(A^{**}\)

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