3 citations · 3 across the 1 of their papers we have counts for
1 paper · 1 filter
Ibrahim Ibrahim, Joris Gillis, Wilm Decré +1
This paper introduces an efficient O(n) compute and memory complexity algorithm for globally optimal path planning on 2D Cartesian grids. Unlike existing marching metho…