Abstract: This letter introduces an efficient $\mathcal {O}(n)$ compute and memory complexity algorithm for globally optimal path planning on 2D Cartesian grids. Unlike existing marching methods that ...
Abstract: Safe path planning is critical for bipedal robots to operate in safety-critical environments. Common path planning algorithms, such as RRT or RRT*, typically use geometric or kinematic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback