Triangular geometry based optimal motion planning using RRT*-motion planner

RRT* is a recent and improved variant of the RRT path finding algorithm. While RRT concentrates on simply finding an initial obstacle-free path, RRT* guarantees eventual convergence to an optimum, collision-free path for any given geometrical environment. On the other hand, the main limitations of RRT* include its slow processing rate and high memory utilization due to the large number of iterations required to achieve optimal path solution. This paper presents Triangular Geometerised-RRT* (TG-RRT*) which incorporates Triangular geometrical methods in the RRT* algorithm and improves its processing time by decreasing the number of iterations required for optimal solution. Simulation results under different environments demonstrate an improved convergence rate of TG-RRT*, in comparison with RRT*.

[1]  Emilio Frazzoli,et al.  Optimal kinodynamic motion planning using incremental sampling-based methods , 2010, 49th IEEE Conference on Decision and Control (CDC).

[2]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[3]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[4]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[5]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[6]  Norman I. Badler,et al.  Real-time reach planning for animated characters using hardware acceleration , 2003, Proceedings 11th IEEE International Workshop on Program Comprehension.

[7]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[8]  J. How,et al.  Improving the Efficiency of Rapidly-exploring Random Trees Using a Potential Function Planner , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[9]  X. Yang,et al.  Neural network application in robot motion planning , 1999, 1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368).

[10]  Emilio Frazzoli,et al.  Anytime Motion Planning using the RRT* , 2011, 2011 IEEE International Conference on Robotics and Automation.

[11]  Thierry Siméon,et al.  Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[12]  Amin Mahdizadeh,et al.  Density Avoided Sampling: An Intelligent Sampling Technique for Rapidly-Exploring Random Trees , 2008, 2008 Eighth International Conference on Hybrid Intelligent Systems.

[13]  Steven M. LaValle,et al.  Incrementally reducing dispersion by increasing Voronoi bias in RRTs , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[14]  Jean-Claude Latombe,et al.  Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts , 1999, Int. J. Robotics Res..

[15]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.