93 citations · 407 across the 82 of their papers we have counts for
3 papers · 2 filters
Asymptotically Optimal Sampling-based Kinodynamic Planning
Yanbo Li, Zakary Littlefield, Kostas E. Bekris
Sampling-based algorithms are viewed as practical solutions for high-dimensional motion planning. Recent progress has taken advantage of random geometric graph theory to show how a…
Similar Part Rearrangement With Pebble Graphs
Athanasios Krontiris, Rahul Shome, Andrew Dobson +3
This work proposes a method for effectively computing manipulation paths to rearrange similar objects in a cluttered space. The solution can be used to place similar products in a…
Sampling-based Roadmap Planners are Probably Near-Optimal after Finite Computation
Andrew Dobson, George V. Moustakides, Kostas E. Bekris
Sampling-based motion planners have proven to be efficient solutions to a variety of high-dimensional, geometrically complex motion planning problems with applications in several d…