Machine learningGraph Algorithms
A*搜索算法
A*搜索算法由Peter E. Hart、Nils J. Nilsson和Bertram Raphael于1968年提出，是一种结合了Dijkstra算法优势和启发式引导的最优路径查找算法。它通过平衡从起点到当前节点的实际距离与到目标节点的估计距离，有效地找到最短路径。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107. DOI: 10.1109/TSSC.1968.300136 ↗
- Russell, S. J., & Norvig, P. (2009). Artificial Intelligence: A Modern Approach (3rd ed.). Pearson. ISBN: 978-0-13-604259-4
如何引用本页
ScholarGate. (2026, June 3). A* Search Algorithm. ScholarGate. https://scholargate.app/zh/operations-research/a-star-search-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →