File:Astar progress animation.gif
From Wikimedia Commons, the free media repository
Jump to navigation
Jump to search
Astar_progress_animation.gif (210 × 210 pixels, file size: 50 KB, MIME type: image/gif, looped, 195 frames, 24 s)
File information
Structured data
Captions
DescriptionAstar progress animation.gif |
English: Illustration of A* search algorithm. The graph is created by uniform square discretization of a 2-dimensional planar region, placing a node in each discretized cell, and connecting each node with its 8 neighbors using bidirectional edges. Cost of edges are same as their Euclidean lengths. The gray shape represents an obstacle. The filled circles in red & green represent expanded nodes (nodes in closed set). The color indicate the g-value (red:lower g-value, green: higher g-value). The empty nodes with blue boundary are the ones in open set. The nodes of the graph are generated on the fly, and nodes falling inside the obstacle are discarded as inaccessible. The objective is to find the least cost path (restricted to the graph) from a given start to a given goal coordinate. The heuristic (consistent) used by a node is its Euclidean distance to goal. That is, ha(n) = |g - n|2, where n represents the Euclidean coordinate of the node n, g is the goal node, and | . |2 is the 2-norm. This is a typical example of motion planning in robotics using A* search algorithm.
Created using YGSBPL graph-search library and OpenCV. |
Date | |
Source | Own work |
Author | Subh83 |
Permission (Reusing this file) |
This file is licensed under the Creative Commons Attribution 3.0 Unported license.
|
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 23:00, 14 April 2011 | 210 × 210 (50 KB) | Subh83 (talk | contribs) | {{Information |Description ={{en|1=Illustration of [http://en.wikipedia.org/wiki/A*_search_algorithm A* search algorithm]. The [http://en.wikipedia.org/wiki/Graph_(mathematics) graph] is created by uniform square discretization of a 2-dimensional plana |
You cannot overwrite this file.
File usage on Commons
The following page uses this file:
File usage on other wikis
The following other wikis use this file:
- Usage on ar.wikipedia.org
- Usage on bg.wikipedia.org
- Usage on ca.wikipedia.org
- Usage on de.wikipedia.org
- Usage on en.wikipedia.org
- Usage on fr.wikipedia.org
- Usage on hu.wikipedia.org
- Usage on hy.wikipedia.org
- Usage on it.wikipedia.org
- Usage on ja.wikipedia.org
- Usage on meta.wikimedia.org
- Usage on no.wikipedia.org
- Usage on pt.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on ru.wikiquote.org
- Usage on sr.wikipedia.org
- Usage on sv.wikipedia.org
- Usage on th.wikipedia.org
- Usage on tr.wikipedia.org
- Usage on uk.wikipedia.org
- Usage on vi.wikipedia.org
- Usage on www.wikidata.org
- Usage on zh-yue.wikipedia.org
- Usage on zh.wikipedia.org