A* search algorithm (Q277680)
Jump to navigation
Jump to search
algorithm used for pathfinding and graph traversal
- A star search algorithm
- A-star algorithm
- A star
- A*
- A-star search algorithm
- A* algorithm
- A* search
- A-star
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A* search algorithm |
algorithm used for pathfinding and graph traversal |
|
Statements
1 reference
27 September 2024
A* is a best-first search algorithm that relies on an open list and a closed list to find a path that is both optimal and complete towards the goal. (English)
1 reference
27 September 2024
The A* algorithm is a well-known example of heuristic-based algorithms that is guaranteed to find the least-cost path to a goal state if the heuristic used is admissible, which means that it never overestimates the real cost from the current state to the goal. (English)
Astar progress animation.gif
210 × 210; 50 KB
210 × 210; 50 KB
Illustration d'une recherche A* pour trouver le chemin le plus court entre 2 nœuds (French)
Illustration of an A* search to find the shortest path between 2 nodes (English)
0 references
1968
0 references
1 reference
27 September 2024
A* is complete and optimal on graphs that are locally finite where the heuristics are admissible and monotonic. (English)
unknown value
locally finite
1 reference
27 September 2024
A* must be locally finite, because if there exist an infinite amount of nodes where the estimated path cost, f(n), is less than the actual goal path cost then the algorithm could continue to explore these nodes without end, and it will be neither complete nor optimal. (English)
unknown value
monotonic
1 reference
27 September 2024
How does monotocity affect A*'s completeness? Because A* is monotonic, the path cost increases as the node gets further from the root. Contours can be drawn to show areas where the estimated path cost, the f(n), for the nodes inside the areas are lower than or equal to the path cost for the outer bounds of the contours. These contours can be drawn as larger and larger areas that increase outwards as the f(n) for the outer bound of these contours increases. The first solution found is optimal since it is the first band where the f(n) for the contour is equal to the path cost for the goal. All the contours outside of this solution will have a higher f cost. (English)
A* Algorithm
0 references
A* search algorithm
0 references
Identifiers
1 reference
Sitelinks
Wikipedia(31 entries)
- arwiki خوارزمية البحث بأولوية الأفضل
- bgwiki Алгоритъм А*
- cawiki Algorisme de cerca A*
- cswiki A*
- dewiki A*-Algorithmus
- enwiki A* search algorithm
- eswiki Algoritmo de búsqueda A*
- fawiki الگوریتم ای استار
- fiwiki A*-algoritmi
- frwiki Algorithme A*
- hewiki אלגוריתם חיפוש A*
- huwiki A* algoritmus
- hywiki Ա*
- idwiki Algoritma a-star
- itwiki Algoritmo A*
- jawiki A*
- kowiki A* 알고리즘
- nlwiki A*-algoritme
- nowiki A*
- plwiki Algorytm A*
- ptwiki Algoritmo A*
- ruwiki A*
- simplewiki A* search algorithm
- srwiki A* algoritam
- svwiki A* Sökalgoritm
- thwiki การค้นหาแบบเอสตาร์
- trwiki A* arama algoritması
- ukwiki Алгоритм пошуку A*
- viwiki Giải thuật tìm kiếm A*
- zh_yuewiki A* 搜尋演算法
- zhwiki A*搜尋演算法
Wikibooks(0 entries)
Wikinews(0 entries)
Wikiquote(0 entries)
Wikisource(0 entries)
Wikiversity(0 entries)
Wikivoyage(0 entries)
Wiktionary(0 entries)
Multilingual sites(1 entry)
- commonswiki A* Algorithm