Loading...
Please wait, while we are loading the content...
Similar Documents
A Comparison of BFS , Dijkstra ’ s and A * Algorithm for Grid-Based PathFinding in Mobile Robots
| Content Provider | Semantic Scholar |
|---|---|
| Author | Fahleraz, Faza |
| Copyright Year | 2018 |
| Abstract | Path-finding plays a very significant role in many applications such as mobile robot navigation. A grid-based environment can be used to represent the navigation space for robots on the real world, to avoid obstacles, or to navigate to a desired position. Unlike many other path-finding problems, gridbased path finding poses some unique challenges. A grid-based search environment can be represented by a graph with a twodimensional grid of nodes with each nodes having a connecting edge to it's neighboring edge. We can also represent some kind of obstacles on the grid-based environment by deleting several nodes. In this paper, I will do some analysis for three different path-finding algorithms namely Breadth-First Search, Dijkstra's, and A* in the context of a grid-based path-finding that is frequently used in mobile robot navigation. I will also present a performance comparison for each of those algorithms. Keywords—path-finding; grid-based search; heuristic; BFS; Dijkstra; A*. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://informatika.stei.itb.ac.id/~rinaldi.munir/Stmik/2017-2018/Makalah2018/Makalah-IF2211-2018-016.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
