Genetic algorithm-based compliant robot path planning: an improved Bi-RRT-based initialization method

Purpose The purpose of this paper is to improve the performance of the genetic algorithm-based compliant robot path planning (GACRPP) in complex dynamic environment by proposing an improved bidirectional rapidly exploring random tree (Bi-RRT)-based population initialization method. Design/methodology/approach To achieve GACRPP in complex dynamic environment with high performance, an improved Bi-RRT-based population initialization method is proposed. First, the grid model is adopted to preprocess the working space of mobile robot. Second, an improved Bi-RRT is proposed to create multi-cluster connections between the starting point and the goal point. Third, the backtracking method is used to generate the initial population based on the multi-cluster connections generated by the improved Bi-RRT. Subsequently, some comparative experiments are implemented where the performances of the improved Bi-RRT-based population initialization method are compared with other population initialization methods, and the comparison results of the improved genetic algorithm (IGA) combining with the different population initialization methods are shown. Finally, the optimal path is further smoothed with the help of the technique of quadratic B-spline curves. Findings It is shown in the experiment results that the improved Bi-RRT-based population initialization method is capable of deriving a more diversified initial population with less execution time and the IGA combining with the proposed population initialization method outperforms the one with other population initialization methods in terms of the length of optimal path and the execution time. Originality/value In this paper, the Bi-RRT is introduced as a population initialization method into the GACRPP problem. An improved Bi-RRT is proposed for the purpose of increasing the diversity of initial population. To characterize the diversity of initial population, a new notion of breadth is defined in terms of Hausdorff distance between different paths.

[1]  Hong Zhang,et al.  Path planning for intelligent robot based on switching local evolutionary PSO algorithm , 2016 .

[2]  Jie Zhao,et al.  A modified genetic algorithm for global path planning of searching robot in mine disasters , 2009, 2009 International Conference on Mechatronics and Automation.

[3]  Alma Y. Alanis,et al.  Smooth global and local path planning for mobile robot using particle swarm optimization, radial basis functions, splines and Bézier curves , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[4]  Sunglok Choi,et al.  Fast any-angle path planning on grid maps with non-collision pruning , 2010, 2010 IEEE International Conference on Robotics and Biomimetics.

[5]  Adem Tuncer,et al.  Dynamic path planning of mobile robots with improved genetic algorithm , 2012, Comput. Electr. Eng..

[6]  Yurong Liu,et al.  Exponential stability of Markovian jumping Cohen-Grossberg neural networks with mixed mode-dependent time-delays , 2016, Neurocomputing.

[7]  Wei Zhang,et al.  An Improved Genetic Algorithm of Optimum Path Planning for Mobile Robots , 2006, Sixth International Conference on Intelligent Systems Design and Applications.

[8]  Hui Cheng,et al.  Multi-population Genetic Algorithms with Immigrants Scheme for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks , 2010, EvoApplications.

[9]  Zidong Wang,et al.  A new genetic algorithm approach to smooth path planning for mobile robots , 2016 .

[10]  Zidong Wang,et al.  Improved GA and Pareto optimization-based facial expression recognition , 2016 .

[11]  Fengfu Li,et al.  Biologically Inspired Model for Visual Cognition Achieving Unsupervised Episodic and Semantic Feature Learning , 2016, IEEE Transactions on Cybernetics.

[12]  S.X. Yang,et al.  An efficient dynamic system for real-time robot-path planning , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[13]  Soh Chin Yun,et al.  Improved genetic algorithms based optimum path planning for mobile robot , 2010, 2010 11th International Conference on Control Automation Robotics & Vision.

[14]  Michael Barbehenn,et al.  A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices , 1998, IEEE Trans. Computers.

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

[16]  David Furcy,et al.  Lifelong Planning A , 2004, Artif. Intell..

[17]  Fuad E. Alsaadi,et al.  Event-triggered H ∞ state estimation for discrete-time stochastic genetic regulatory networks with Markovian jumping parameters and time-varying delays , 2016, Neurocomputing.

[18]  Mahmood Naderan-Tahan,et al.  Efficient and safe path planning for a Mobile Robot using genetic algorithm , 2009, 2009 IEEE Congress on Evolutionary Computation.

[19]  Lianyang Ma,et al.  A Static Environment-Based Path Planning Method by Using Genetic Algorithm , 2010, 2010 International Conference on Computing, Control and Industrial Engineering.

[20]  Stefano Carpin,et al.  A genetic algorithm for nonholonomic motion planning , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[21]  Xin Chen,et al.  Collision-free single-step motion planning of biped pole-climbing robots in spatial trusses , 2013, 2013 IEEE International Conference on Robotics and Biomimetics (ROBIO).

[22]  Roland Siegwart,et al.  Introduction to Autonomous Mobile Robots , 2004 .

[23]  Mansoor Davoodi Monfared,et al.  Multi-objective path planning in discrete space , 2013, Appl. Soft Comput..

[24]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..

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

[26]  Hong Qiao,et al.  The Concept of “Attractive Region in Environment” and its Application in High-Precision Tasks With Low-Precision Systems , 2015, IEEE/ASME Transactions on Mechatronics.

[27]  Huijun Gao,et al.  On H-infinity Estimation of Randomly Occurring Faults for A Class of Nonlinear Time-Varying Systems With Fading Channels , 2016, IEEE Transactions on Automatic Control.

[28]  Dae-Won Kim,et al.  An effective initialization method for genetic algorithm-based robot path planning using a directed acyclic graph , 2016, Inf. Sci..

[29]  Hsien-I Lin,et al.  2D-Span Resampling of Bi-RRT in Dynamic Path Planning , 2015 .

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

[31]  José Antonio Cruz-Ledesma,et al.  Modelling, Design and Robust Control of a Remotely Operated Underwater Vehicle , 2014 .

[32]  Amir Hossein Karami,et al.  An adaptive genetic algorithm for robot motion planning in 2D complex environments , 2015, Comput. Electr. Eng..

[33]  Sean R. Martin,et al.  Offline and Online Evolutionary Bi-Directional RRT Algorithms for Efficient Re-Planning in Dynamic Environments , 2007, 2007 IEEE International Conference on Automation Science and Engineering.

[34]  Simon X. Yang,et al.  A knowledge based genetic algorithm for path planning of a mobile robot , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[35]  Siddhartha S. Srinivasa,et al.  Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).