On the optimality of A

DOI10.1016/0004-3702(77)90005-4MaRDI QIDQ1232905zbMATH OpenOpenAlexFDO

Authors David Gelperin

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

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3351222 (Why is no real title available?)
• scientific article; zbMATH DE number 3407200 (Why is no real title available?)
• Heuristic search viewed as path finding in a graph
• The heuristic search under conditions of error

Cited in

(9)

• Knowledge versus search: a quantitative analysis using A*
• An upper bound on the time complexity of iterative-deepening-\(A^*\)
• Heuristic tree search with nonparametric statistical inference methods
• Acceleration of the A\(^*\)-algorithm for the shortest path problem in digital road maps
• Probabilistic analysis of the complexity of A*
• Heuristic search strategies for multiobjective state space search
• A result on the computational complexity of heuristic estimates for the A^* algorithm
• A new variant of the \(A^*\)-algorithm which closes a node at most once.
• Utility of pathmax in partial order heuristic search

This page was built for publication: On the optimality of A

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