Bi-RRT path extraction and curve fitting smooth with visual based configuration space mapping

Path planning is the one of the most basic research areas in robotics. It simply concern about acquiring a safe path with admissible cost. In this study, we adapt bidirectional rapidly random exploring tree (Bi-RRT) path extraction to visual based configuration space map hosting obstacles and smooth result path with curve fitting models. Firstly, a map of the configuration space is created and robot, target positions are detected with threshold based object detection. There are two positions where two distinct RRT are launched on this map. These positions are robot initial position and target position. Both RRT try to reach target with random branches in each iterations. When one of these RRT branch intersect with other RRT branch, the algorithm is stopped. The acquired trajectory is the path between initial position and target position. But acquired path is generally close to the obstacles and unnecessary branches or jagged parts can be formed. Therefore, to provide safety object dilation over obstacles are used. Finally, the path is smoothed with curve fitting models. We conduct several experiments to evaluate Bi-RRT performance.

[1]  Hyungpil Moon,et al.  An RRT* path planning for kinematically constrained hyper-redundant inpipe robot , 2015, 2015 12th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI).

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

[3]  C. Y. Lee An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[4]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[5]  Klaus Schilling,et al.  RRTCAP∗ - RRT∗ Controller and Planner - Simultaneous Motion and Planning , 2015 .

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

[7]  Reid G. Simmons,et al.  Particle RRT for Path Planning with Uncertainty , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

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

[9]  Lucas Molina,et al.  Compact RRT: A New Approach for Guided Sampling Applied to Environment Representation and Path Planning in Mobile Robotics , 2015, 2015 12th Latin American Robotics Symposium and 2015 3rd Brazilian Symposium on Robotics (LARS-SBR).

[10]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[11]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[12]  María Dolores Rodríguez-Moreno,et al.  3Dana: A path planning algorithm for surface robotics , 2017, Eng. Appl. Artif. Intell..

[13]  Roland Siegwart,et al.  A Toolbox for Easily Calibrating Omnidirectional Cameras , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

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

[16]  John B. Anderson,et al.  Sequential Coding Algorithms: A Survey and Cost Analysis , 1984, IEEE Trans. Commun..

[17]  Bin Dai,et al.  A Dynamic RRT Path Planning Algorithm Based on B-Spline , 2009, 2009 Second International Symposium on Computational Intelligence and Design.

[18]  Adnan Fatih Kocamaz,et al.  Robot control with graph based edge measure in real time image frames , 2016, 2016 24th Signal Processing and Communication Application Conference (SIU).

[19]  Adnan Fatih Kocamaz,et al.  Vision-based decision tree controller design method sensorless application by using angle knowledge , 2016, 2016 24th Signal Processing and Communication Application Conference (SIU).