방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| A* 탐색 알고리즘× | 다익스트라 알고리즘× | |
|---|---|---|
| 분야 | 경영과학 | 경영과학 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1968 | 1956 |
| 창시자≠ | Peter E. Hart, Nils J. Nilsson, and Bertram Raphael | Edsger W. Dijkstra |
| 유형 | algorithm | algorithm |
| 원전≠ | 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 ↗ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271. DOI ↗ |
| 별칭≠ | A* algorithm, A-star algorithm, A* search | Dijkstra's algorithm, shortest path algorithm |
| 관련≠ | 2 | 3 |
| 요약≠ | The A* Search Algorithm, developed by Peter E. Hart, Nils J. Nilsson, and Bertram Raphael in 1968, is an optimal path-finding algorithm that combines the benefits of Dijkstra's algorithm with heuristic guidance. It efficiently finds the shortest path by balancing actual distance from the start with estimated distance to the goal. | Dijkstra's Algorithm, introduced by Edsger W. Dijkstra in 1956, is one of the most fundamental algorithms in computer science for solving the single-source shortest path problem. It finds the shortest path from a starting vertex to all other vertices in a weighted graph with non-negative edge weights. |
| ScholarGate데이터셋 ↗ |
|
|