Name
Abstract | ||
|---|---|---|
Path planning is one of the most studied problems in the field of robotics, unmanned aerial vehicles (uavs), vehicle navigation and fields like these. The majority algorithms of path planning produce possible paths of grid graph, and then apply in problems such as classical graph route searching. Astar algorithm, Hierarchical Path-Finding A-star (HPA∗) and Jump Point Search (JPS) algorithms are studied in this paper to compare the maze searching capacity and different search maps' efficiency. We also propose an improved JPS algorithm in symmetric grid graph. In this paper, we compare their search time and efficiency. Conducted experiment shows that by adopting the same benchmarks our algorithm not only tackles the congestion problem, but also solves the problem more efficiently. Experiments validated the improved JPS algorithm and results show it outperforms the other algorithms. © 2015 IEEE. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/RVSP.2015.56 | Proceedings - 2015 3rd International Conference on Robot, Vision and Signal Processing, RVSP 2015 |
Keywords | Field | DocType |
A-star,algorithms,JPS,path planning,shortest | Any-angle path planning,Search algorithm,Shortest path problem,Algorithm,Yen's algorithm,Lattice graph,Jump point search,Widest path problem,A* search algorithm,Mathematics | Conference |
ISBN | Citations | PageRank |
9781467396462 | 0 | 0.34 |
References | Authors | |
4 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jie Jia | 1 | 356 | 38.26 |
| Pan Jeng-Shyang | 2 | 2466 | 269.74 |
| Huarong Xu | 3 | 17 | 4.17 |
| Wang Chen | 4 | 2 | 1.11 |
| Meng Zhen-Yu | 5 | 2 | 0.77 |