On the optimality of A
From MaRDI portal
Publication:1232905
DOI10.1016/0004-3702(77)90005-4zbMath0344.68024OpenAlexW2030874472MaRDI QIDQ1232905
Publication date: 1977
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(77)90005-4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Utility of pathmax in partial order heuristic search ⋮ An upper bound on the time complexity of iterative-deepening-\(A^*\) ⋮ A new variant of the \(A^*\)-algorithm which closes a node at most once. ⋮ Heuristic tree search with nonparametric statistical inference methods ⋮ Probabilistic analysis of the complexity of A* ⋮ Knowledge versus search: a quantitative analysis using A* ⋮ Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps ⋮ Heuristic search strategies for multiobjective state space search ⋮ A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm
Cites Work
This page was built for publication: On the optimality of A
