Continuous planning with winding constraints using optimal heuristic-driven front propagation

Recent work has produced methods to solve the winding-constrained optimal feedback navigation problem. Given the start and the goal positions and the winding constraints, the solution to this problem is a feedback vector field such that, when integrated from the start, the trajectory is the shortest path connecting the start and the goal which satisfies given constraints. Such constraints intuitively restrict the direction and the number of times the path winds around given planar regions. We formulate a continuous version of this problem that contrasts with the discrete treatments previously presented. This leads to a geometrical characterization of the problem for which simplicial complex approximation is particularly useful. Thus, it yields theoretical insight as well as a practical algorithm for approximating the continuous problem using an efficient and high-accuracy heuristic-driven front propagation method on simplicial meshes. Experimental results are given evaluating the solution quality and efficiency of the method versus methods based on the discrete formulation and without using heuristics.

[1]  Stephen G. Kobourov,et al.  Computing homotopic shortest paths efficiently , 2006, Comput. Geom..

[2]  Steven M. LaValle,et al.  Simplicial dijkstra and A* algorithms for optimal feedback planning , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  James R. Munkres,et al.  Topology; a first course , 1974 .

[4]  Ron Kimmel,et al.  Computing geodesic paths on , 1998 .

[5]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[7]  Sergey Bereg,et al.  Computing homotopic shortest paths in the plane , 2003, SODA.

[8]  Nicholas Roy,et al.  Efficiently Finding Optimal Winding-Constrained Loops in the Plane , 2013 .

[9]  Subhrajit Bhattacharya,et al.  Search-Based Path Planning with Homotopy Class Constraints in 3D , 2010, AAAI.

[10]  Alexander Vladimirsky,et al.  Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms , 2003, SIAM J. Numer. Anal..

[11]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[12]  Takeo Igarashi,et al.  Homotopic Path Planning on Manifolds for Cabled Mobile Robots , 2010, WAFR.

[13]  Steven M. LaValle,et al.  Simplicial Dijkstra and A∗ Algorithms: From Graphs to Continuous Spaces , 2012, Adv. Robotics.

[14]  Anthony Stentz,et al.  Field D*: An Interpolation-Based Path Planner and Replanner , 2005, ISRR.

[15]  Jianbo Shi,et al.  Multi-hypothesis motion planning for visual object tracking , 2011, 2011 International Conference on Computer Vision.

[16]  John Hershberger,et al.  Computing Minimum Length Paths of a Given Homotopy Class , 1994, Comput. Geom..

[17]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[18]  R. Ho.  Algebraic Topology , 2022 .

[19]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[20]  P. Abbeel,et al.  Identification and Representation of Homotopy Classes of Trajectories for Search-Based Path Planning in 3D , 2012 .

[21]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.