Name
Abstract | ||
|---|---|---|
The problem of optimal feedback planning among obstacles in d-dimensional configuration spaces is considered. We present a sampling-based, asymptotically optimal feedback planning method. Our method combines an incremental construction of the Delaunay triangulation, volumetric collision-detection module, and a modified Fast Marching Method to compute a converging sequence of feedback functions. The convergence and asymptotic runtime are proven theoretically and investigated during numerical experiments, in which the proposed method is compared with the state-of-the-art asymptotically optimal path planners. The results show that our method is competitive with the previous algorithms. Unlike the shortest trajectory computed by many path planning algorithms, the resulting feedback functions can be used directly for robot navigation in our case. Finally, we present a straightforward extension of our method that handles dynamic environments where obstacles can appear, disappear, or move. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Convergence (routing),Motion planning,Mathematical optimization,Simulation,Control theory,Fast marching method,Free space,Robot,Asymptotically optimal algorithm,Trajectory,Mathematics,Delaunay triangulation |
DocType | Volume | Citations |
Journal | abs/1504.07940 | 0 |
PageRank | References | Authors |
0.34 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dmitry S. Yershov | 1 | 0 | 0.34 |
| Michael W. Otte | 2 | 105 | 15.06 |
| Emilio Frazzoli | 3 | 3286 | 229.95 |