Robot Path Planning in 3D Space Using Binary Integer Programming

This paper presents a novel algorithm for path planning of mobile robots in known 3D environments using Binary Integer Programming (BIP). In this approach the problem of path planning is formulated as a BIP with variables taken from 3D Delaunay Triangulation of the Free Configuration Space and solved to obtain an optimal channel made of connected tetrahedrons. The 3D channel is then partitioned into convex fragments which are used to build safe and short paths within from Start to Goal. The algorithm is simple, complete, does not suffer from local minima, and is applicable to different workspaces with convex and concave polyhedral obstacles. The noticeable feature of this algorithm is that it is simply extendable to n-D Configuration spaces. Keywords—3D C-space, Binary Integer Programming (BIP), Delaunay Tessellation, Robot Motion Planning.

[1]  John F. Canny,et al.  A Voronoi method for the piano-movers problem , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

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

[3]  Franz Aurenhammer,et al.  Voronoi Diagrams , 2000, Handbook of Computational Geometry.

[4]  Olivier Toupet,et al.  Real-time path-planning using mixed-integer linear programming and global cost-to-go maps , 2006 .

[5]  Marwan Bikdash,et al.  Hybrid mixed-logical linear programming algorithm for collision-free optimal path planning , 2007 .

[6]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[7]  M. Overmars,et al.  Approximating generalized Voronoi diagrams in any dimension , 1995 .

[8]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[9]  J. Sack,et al.  Minimum Decompositions of Polygonal Objects , 1985 .

[10]  Craig Eldershaw,et al.  Heuristic algorithms for motion planning , 2001 .

[11]  Gregory S. Chirikjian,et al.  A new potential field method for robot path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[12]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[13]  Howie Choset,et al.  Sensor-Based Exploration: The Hierarchical Generalized Voronoi Graph , 2000, Int. J. Robotics Res..

[14]  S. Sitharama Iyengar,et al.  A 'retraction' method for learned navigation in unknown terrains for a circular robot , 1991, IEEE Trans. Robotics Autom..

[15]  John Canny,et al.  The complexity of robot motion planning , 1988 .