Abstract
SummaryPath planning under 2D map is a key issue in robot applications. However, most related algorithms rely on point-by-point traversal. This causes them usually cannot find the strict shortest path, and their time cost increases dramatically as the map scale increases. So we proposed RimJump to solve the above problem, and it is a new path planning method that generates the strict shortest path for a 2D map. RimJump selects points on the edge of barriers to form the strict shortest path. Simulation and experimentation prove that RimJump meets the expected requirements.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,General Mathematics,Software,Control and Systems Engineering
Reference44 articles.
1. Sampling-based A* algorithm for robot path-planning
2. Sampling-Based Path Planning on Configuration-Space Costmaps
3. An Efficient Snell's Law Method for Optimal-Path Planning across Multiple Two-Dimensional, Irregular, Homogeneous-Cost Regions
4. 7. A. Nash , S. Koenig and C. A. Tovey , “Lazy Theta*: Any-angle path planning and path length analysis in 3D,” Symposium on Combinatorial Search, SOCS, Stone Mountain, Atlanta, Georgia, USA, July DBLP (2010) pp. 299–307.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献