Shortest paths with arbitrary clearance from navigation meshes

This paper addresses the problem of efficiently computing optimal paths of arbitrary clearance from a polygonal representation of a given virtual environment. Key to the proposed method is a new type of triangulated navigation mesh, called a Local Clearance Triangulation, which enables the efficient and correct determination if a disc of arbitrary size can pass through any narrow passages of the mesh. The proposed approach uniquely balances speed of computation and optimality of paths by first computing high-quality locally shortest paths efficiently in optimal time. Only in case global optimality is needed, an extended search will gradually improve the current path (if not already the global optimal) until the globally shortest one is determined. The presented method represents the first solution correctly extracting shortest paths of arbitrary clearance directly from a triangulated environment.

[1]  D. Thalmann,et al.  Fully Dynamic Constrained Delaunay Triangulations , 2004 .

[2]  Mark H. Overmars,et al.  New methods for computing visibility graphs , 1988, SCG '88.

[3]  Yunhui Liu,et al.  Finding the shortest path of a disc among polygonal obstacles using a radius-independent graph , 1995, IEEE Trans. Robotics Autom..

[4]  Paolo Fiorini,et al.  Motion Planning in Dynamic Environments Using Velocity Obstacles , 1998, Int. J. Robotics Res..

[5]  Mark H. Overmars,et al.  The corridor map method: a general framework for real-time high-quality path planning: Research Articles , 2007 .

[6]  Daniel Thalmann,et al.  Synthetic Vision and Audition for Digital Actors , 1995, Comput. Graph. Forum.

[7]  Joseph S. B. Mitchell,et al.  Shortest paths among obstacles in the plane , 1993, SCG '93.

[8]  Stéphane Donikian,et al.  Crowd of Virtual Humans: a New Approach for Real Time Navigation in Complex and Structured Environments , 2004, Comput. Graph. Forum.

[9]  Demetri Terzopoulos,et al.  Autonomous pedestrians , 2007, Graph. Model..

[10]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[11]  Jessica K. Hodgins,et al.  Reactive pedestrian path following from examples , 2004, The Visual Computer.

[12]  Dinesh Manocha,et al.  Reciprocal Velocity Obstacles for real-time multi-agent navigation , 2008, 2008 IEEE International Conference on Robotics and Automation.

[13]  Joseph S. B. Mitchell.  Shortest paths among obstacles in the plane , 1996, Int. J. Comput. Geom. Appl..

[14]  John Hershberger,et al.  Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.

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

[16]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

[17]  Craig W. Reynolds.  Steering Behaviors For Autonomous Characters , 1999 .

[18]  Dinesh Manocha,et al.  Interactive Navigation of Heterogeneous Agents Using Adaptive Roadmaps , 2009, IEEE Transactions on Visualization and Computer Graphics.

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

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

[21]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[22]  Roland Geraerts,et al.  Planning short paths with clearance using explicit corridors , 2010, 2010 IEEE International Conference on Robotics and Automation.

[23]  James A. Storer,et al.  Shortest paths in the plane with polygonal obstacles , 1994, JACM.

[24]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[25]  L. Paul Chew,et al.  Planning the shortest path for a disc in O(n2log n) time , 1985, SCG '85.

[26]  Dinesh Manocha,et al.  Real-Time Path Planning in Dynamic Virtual Environments Using Multiagent Navigation Graphs , 2008, IEEE Transactions on Visualization and Computer Graphics.

[27]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[28]  Jean-Claude Latombe,et al.  Fast synthetic vision, memory, and learning models for virtual humans , 1999, Proceedings Computer Animation 1999.

[29]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).