A new result on the complexity of heuristic estimates for the \(A^*\) algorithm

DOI10.1016/0004-3702(92)90045-YzbMath0762.68030arXiv1803.06422OpenAlexW2964197916MaRDI QIDQ1193486

Othar Hansson, Andrew Mayer, Marco Valtorta

Publication date: 27 September 1992

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.06422

zbMATH Keywords

\(A^*\) searchproblem relaxationstate-space model of problem solving

Mathematics Subject Classification ID

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

Cites Work

• A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm
• A method for computing heuristics in problem solving
• Automatically generating abstractions for planning
• Generalized best-first search strategies and the optimality of A*
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new result on the complexity of heuristic estimates for the \(A^*\) algorithm