2011 4th International Conference on Mechatronics (ICOM) 2011
DOI: 10.1109/icom.2011.5937169
|View full text |Cite
|
Sign up to set email alerts
|

A star path following mobile robot

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
12
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 27 publications
(12 citation statements)
references
References 9 publications
0
12
0
Order By: Relevance
“…The A* star algorithm [31], adapted in [32] tries to find all possible options to reach the destination taking into account the coordinates of the current location and of the destination into the pixels matrix, validates all the paths from the start pixel to the final pixel, thought the walkable paths already set on the first step. After this, it picks up the path that holds the lowest cost [32], which means that is also the shortest path between current location and destination. In the end, the lowest cost path is returned to Map View entity to be painted above the map floor to show the user the path that he/she needs to run on that floor to reach the destination.…”
Section: Find Me! Mobile Appmentioning
confidence: 99%
“…The A* star algorithm [31], adapted in [32] tries to find all possible options to reach the destination taking into account the coordinates of the current location and of the destination into the pixels matrix, validates all the paths from the start pixel to the final pixel, thought the walkable paths already set on the first step. After this, it picks up the path that holds the lowest cost [32], which means that is also the shortest path between current location and destination. In the end, the lowest cost path is returned to Map View entity to be painted above the map floor to show the user the path that he/she needs to run on that floor to reach the destination.…”
Section: Find Me! Mobile Appmentioning
confidence: 99%
“…The A* star algorithm [18], adapted in [17] tries to find all possible options to reach the destination taking into account the coordinates of the current location and of the destination into the pixels matrix, validates all the paths from the start pixel to the final pixel, thought the walkable paths already set on the first step. After this, it picks up the path that holds the lowest cost [19], which means that is also the shortest path between current location and destination. In the end, the lowest cost path is returned to Map View entity to be painted above the map floor to show the user the path that he/she needs to run on that floor to reach the destination.…”
Section: Find Me! Mobile Appmentioning
confidence: 99%
“…Most of these methods have certain advantages in terms of speed, but the path obtained lacks optimization. Some heuristic algorithms, such as A*, D*, are widely used in industry [34][35][36]. Xin et al [37] proposed an improved A* algorithm, which extends the neighborhood propagation of the standard A* algorithm.…”
Section: Introductionmentioning
confidence: 99%