An approximate algorithm for solving shortest path problems for mobile robots or driver assistance

Finding a shortest path between two given locations is of importance for mobile robots, but also (e.g.) for identifying unique paths in a given surrounding region Π when (e.g.) evaluating vision software in test vehicles, or for calculating the free-space boundary in vision-based driver assistance. We assume that Π is given as a triangulated surface which is not necessary simply connected.

[1]  Kenneth L. Clarkson,et al.  Approximation algorithms for shortest path motion planning , 1987, STOC.

[2]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[3]  Reinhard Klette,et al.  Exact and approximate algorithms for the calculation of shortest paths , 2006 .

[4]  Sariel Har-Peled,et al.  Constructing approximate shortest path maps in three dimensions , 1998, SCG '98.

[5]  Reinhard Klette,et al.  Moving Object Segmentation Using Optical Flow and Depth Information , 2009, PSIVT.

[6]  Christos H. Papadimitriou,et al.  An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[7]  Reinhard Klette,et al.  Approximate ESPs on Surfaces of Polytopes Using a Rubberband Algorithm , 2007, PSIVT.

[8]  U. Franke,et al.  B-spline modeling of road surfaces for freespace estimation , 2008, 2008 IEEE Intelligent Vehicles Symposium.

[9]  Reinhard Klette,et al.  Approximate Shortest Path Calculations in Simple Polyhedra , 2008 .

[10]  Ernesto de Queirós Vieira Martins,et al.  A new improvement for a K shortest paths algorithm , 2001 .

[11]  Massimo Bertozzi,et al.  GOLD: a parallel real-time stereo vision system for generic obstacle and lane detection , 1998, IEEE Trans. Image Process..

[12]  Thomas Bülow,et al.  Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Daniel Cremers,et al.  B-Spline Modeling of Road Surfaces With an Application to Free-Space Estimation , 2009, IEEE Transactions on Intelligent Transportation Systems.

[14]  R. Klette,et al.  Euclidean Shortest Paths in Simple Polygons , 2007 .

[15]  M. Migliore,et al.  An algorithm to find all paths between two nodes in a graph , 1990 .

[16]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[17]  Sanjiv Kapoor,et al.  Efficient computation of geodesic shortest paths , 1999, STOC '99.

[18]  C. Bajaj.  The Algebraic Complexity of Shortest Paths in Polyhedral Spaces , 1985 .

[19]  Reinhard Klette,et al.  Approximate Algorithms for Touring a Sequence of Polygons , 2008 .

[20]  Yanhong A. Liu,et al.  Optimizing Ackermann's function by incrementalization , 2003, PEPM.