Phototropism rapidly exploring random tree: An efficient rapidly exploring random tree approach based on the phototropism of plants

Inspired by the phototropism of plants, a novel variant of the rapidly exploring random tree algorithm as called phototropism rapidly exploring random tree is proposed. The phototropism rapidly exploring random tree algorithm expands less tree nodes during the exploration period and has shorter path length than the original rapidly exploring random tree algorithm. In the algorithm, a virtual light source is set up at the goal point, and a light beam propagation method is adopted on the map to generate a map of light intensity distribution. The phototropism rapidly exploring random tree expands its node toward the space where the light intensity is higher, while the original rapidly exploring random tree expands its node based on the uniform sampling strategy. The performance of the phototropism rapidly exploring random tree is tested in three scenarios which include the simulation environment and the real-world environment. The experimental results show that the proposed phototropism rapidly exploring random tree algorithm has a higher sampling efficiency than the original rapidly exploring random tree, and the path length is close to the optimal solution of the rapidly exploring random tree* algorithm without considering the non-holonomic constraint.

[1]  Danica Kragic,et al.  Artificial potential biased probabilistic roadmap method , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[2]  Yasar Ayaz,et al.  RRT*-SMART: A Rapid Convergence Implementation of RRT* , 2013 .

[3]  Gianpaolo Conte,et al.  Hierarchical path planning in a multi-robot environment with a simple navigation function , 1995, IEEE Trans. Syst. Man Cybern..

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

[5]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[6]  Tomás Martínez-Marín,et al.  Integration of Cell-Mapping and Reinforcement-Learning Techniques for Motion Planning of Car-Like Robots , 2009, IEEE Transactions on Instrumentation and Measurement.

[7]  Devin Connell,et al.  Extended rapidly exploring random tree–based dynamic path planning and replanning for mobile robots , 2018 .

[8]  Ashraf Elnagar,et al.  A comparative study between visibility-based roadmap path planning algorithms , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  Yasar Ayaz,et al.  Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments , 2015, Robotics Auton. Syst..

[10]  Dino Živojević,et al.  Path Planning for Mobile Robot using Dubins-curve based RRT Algorithm with Differential Constraints , 2019, 2019 International Symposium ELMAR.

[11]  S. Sedighi,et al.  Implementing Voronoi-based Guided Hybrid A* in Global Path Planning for Autonomous Vehicles* , 2019, 2019 IEEE Intelligent Transportation Systems Conference (ITSC).

[12]  Argel A. Bandala,et al.  Path planning for mobile robots using genetic algorithm and probabilistic roadmap , 2017, 2017IEEE 9th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management (HNICEM).

[13]  Mohammed Hawa.  Light-assisted A⁎ path planning , 2013, Eng. Appl. Artif. Intell..

[14]  Xin Xu,et al.  A hierarchical path planning approach based on A⁎ and least-squares policy iteration for mobile robots , 2015, Neurocomputing.

[15]  Luiz Gdo Véras,et al.  Rapidly exploring Random Tree* with a sampling method based on Sukharev grids and convex vertices of safety hulls of obstacles , 2019, International Journal of Advanced Robotic Systems.

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

[17]  Valentyn N. Sichkar.  Reinforcement Learning Algorithms in Global Path Planning for Mobile Robot , 2019, 2019 International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM).

[18]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[19]  Daniel D. Lee,et al.  Learning high-dimensional Mixture Models for fast collision detection in Rapidly-Exploring Random Trees , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[20]  Bin Wang,et al.  Path Planning for Mobile Robot's Continuous Action Space Based on Deep Reinforcement Learning , 2018, 2018 International Conference on Big Data and Artificial Intelligence (BDAI).

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

[22]  Xiong Chen,et al.  A hybrid two-dimensional path planning model based on frothing construction algorithm and local fast marching method , 2013, Comput. Electr. Eng..