A Geometric Path-Planning Algorithm in Cluttered Planar Environments Using Convex Hulls

The problem of finding a collision free path in an environment occupied by obstacles, known as path planning, has many applications in design of complex systems such as wire routing in automobile assemblies or motion planning for robots. Developing the visibility graph of the workspace is among the first techniques to address the path-planning problem. The visibility algorithm is efficient in finding the global optimal path. However, it is computationally expensive as it explores the entire workspace of the problem to create all non-intersecting segments of the graph. In this paper, we propose an algorithm based on the notion of convex hulls to generate the partial visibility graph from a given start point to a goal point in a 2D workspace cluttered with a number of disjoint polygonal convex or concave obstacles. The algorithm facilitates the attainment of the shortest path in a planar workspace while reducing the size of the visibility graph to explore.

[1]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[2]  Kirsten Matheus.  Automotive Ethernet , 2014 .

[3]  Yuehong Yin,et al.  A pipe route design methodology by imitating human imaginal thinking , 2010 .

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

[5]  Yoram Koren,et al.  Real-time obstacle avoidance for fact mobile robots , 1989, IEEE Trans. Syst. Man Cybern..

[6]  Wei Chen,et al.  GAPRUS—genetic algorithms based pipe routing using tessellated objects , 1999 .

[7]  Micha Sharir,et al.  On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..

[8]  Z. Zhu,et al.  A methodology to enable automatic 3D routing of aircraft Electrical Wiring Interconnection System , 2015 .

[9]  Georges M. Fadel,et al.  A Fast and Efficient Compact Packing Algorithm for Free-Form Objects , 2008, DAC 2008.

[10]  Danny Ziyi Chen.  Developing algorithms and software for geometric path planning problems , 1996, CSUR.

[11]  Kokichi Sugihara.  Approximation of Generalized Voronoi Diagrams by Ordinary Voronoi Diagrams , 1993, CVGIP Graph. Model. Image Process..

[12]  B. Harrison.  Las Vegas, Nevada , 2002 .

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

[14]  Rikk Carey.  The Virtual Reality Modeling Language Explained , 1998, IEEE Multim..

[15]  Ravi Teja Katragadda.  PREDICTING THE THERMAL PERFORMANCE FOR THE MULTI-OBJECTIVE VEHICLE UNDERHOOD PACKING OPTIMIZATION PROBLEM , 2012, DAC 2012.

[16]  Yi Miao,et al.  Multi-Objective Configuration Optimization With Vehicle Dynamics Applied to Midsize Truck Design , 2003, DAC 2003.

[17]  M. Sniedovich.  Dijkstra's algorithm revisited: the dynamic programming connexion , 2006 .

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

[19]  Georges M. Fadel,et al.  Packing Optimization by Enhanced Rubber Band Analogy , 2005, DAC 2005.

[20]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[21]  Simon Szykman,et al.  Synthesis of Optimal Nonorthogonal Routes , 1996 .

[22]  Marina L. Gavrilova,et al.  Geometric algorithms for clearance based optimal path computation , 2007, GIS.

[23]  Andrew B. Conru.  A genetic approach to the cable harness routing problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

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

[25]  Alberto Sangiovanni-Vincentelli,et al.  Electrical Architecture Optimization and Selection - Cost Minimization via Wire Routing and Wire Sizing , 2014 .

[26]  Ibrahim Zeid,et al.  Mastering CAD/CAM , 2004 .

[27]  Marina L. Gavrilova,et al.  Roadmap-Based Path Planning , 2008 .

[28]  Alberto L. Sangiovanni-Vincentelli,et al.  An efficient wire routing and wire sizing algorithm for weight minimization of automotive systems , 2014, 2014 51st ACM/EDAC/IEEE Design Automation Conference (DAC).

[29]  Steven E. Butt,et al.  An efficient algorithm for facility location in the presence of forbidden regions , 1996 .