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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback