Unconstrained and Curvature-Constrained Shortest-Path Distances and Their Approximation

We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of Bernstein et al. (Graph approximations to geodesics on embedded manifolds, Tech. Rep., Department of Psychology, Stanford University, 2000). We do the same with curvature-constrained shortest paths and their distances, establishing what we believe are the first approximation bounds for them.

[1]  Peter Sanders,et al.  Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.

[2]  F. Albrecht,et al.  Geodesics in Euclidean space with analytic obstacle , 1991 .

[3]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[4]  D. Burago,et al.  A Course in Metric Geometry , 2001 .

[5]  Alireza Bayestehtashk,et al.  Nonlinear subspace clustering using curvature constrained distances , 2015, Pattern Recognit. Lett..

[6]  Ying Zhang,et al.  Localization from mere connectivity , 2003, MobiHoc '03.

[7]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[8]  Lluís Ros Giralt,et al.  Randomized kinodynamic planning for constrained systems , 2018, ICRA 2018.

[9]  Tim Hoffmann,et al.  Discrete differential geometry of curves and surfaces , 2009 .

[10]  I. Hassan.  Embedded , 2005, The Cyber Security Handbook.

[11]  Ulrich Bauer,et al.  Uniform Convergence of Discrete Curvatures from Nets of Curvature Lines , 2009, Discret. Comput. Geom..

[12]  Emilio Frazzoli,et al.  Optimal kinodynamic motion planning using incremental sampling-based methods , 2010, 49th IEEE Conference on Decision and Control (CDC).

[13]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[14]  Wheeler Ruml,et al.  Improved MDS-based localization , 2004, IEEE INFOCOM 2004.

[15]  Joshua B. Tenenbaum,et al.  Global Versus Local Methods in Nonlinear Dimensionality Reduction , 2002, NIPS.

[16]  Stephanie B. Alexander,et al.  The Riemannian obstacle problem , 1987 .

[17]  Ulrike von Luxburg,et al.  Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters , 2009, Theoretical Computer Science.

[18]  Kostas E. Bekris,et al.  Sparse Methods for Efficient Asymptotically Optimal Kinodynamic Planning , 2014, WAFR.

[19]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[20]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[21]  Marco Pavone,et al.  Optimal sampling-based motion planning under differential constraints: The drift case with linear affine dynamics , 2014, 2015 54th IEEE Conference on Decision and Control (CDC).

[22]  Amir Babaeian,et al.  Multiple Manifold Clustering Using Curvature Constrained Path , 2015, PloS one.

[23]  Jean-Daniel Boissonnat,et al.  Shortest paths of bounded curvature in the plane , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[24]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[25]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[26]  Stefan Waldmann.  Topology: An Introduction , 2014 .

[27]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[28]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[29]  John M. Lee.  Riemannian Manifolds: An Introduction to Curvature , 1997 .

[30]  Stephen Smale,et al.  Finding the Homology of Submanifolds with High Confidence from Random Samples , 2008, Discret. Comput. Geom..

[31]  Marco Pavone,et al.  Optimal sampling-based motion planning under differential constraints: The driftless case , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[32]  Jianghai Hu.  Geodesics in Riemannian Manifolds with Boundary Jianghai Hu , 2000 .

[33]  Marco Pavone,et al.  Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions , 2013, ISRR.