Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Algoritmo de Busca A*× | Algoritmo de Dijkstra× | |
|---|---|---|
| Área | Pesquisa operacional | Pesquisa operacional |
| Família | Machine learning | Machine learning |
| Ano de origem≠ | 1968 | 1956 |
| Autor original≠ | Peter E. Hart, Nils J. Nilsson, and Bertram Raphael | Edsger W. Dijkstra |
| Tipo | algorithm | algorithm |
| Fonte seminal≠ | 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 ↗ |
| Outros nomes≠ | A* algorithm, A-star algorithm, A* search | Dijkstra's algorithm, shortest path algorithm |
| Relacionados≠ | 2 | 3 |
| Resumo≠ | 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. |
| ScholarGateConjunto de dados ↗ |
|
|