Robot path planning using rapidly-exploring random trees: A membrane computing approach

Methods based on Rapidly-exploring Random Trees (RRTs) have been in use in robotics to solve motion planning problems for nearly two decades. On the other hand, in the membrane computing framework, models based on Enzymatic Numerical P systems (ENPS) have been applied to robot controllers. These controllers handle the power of motors according to motion commands usually generated by planning algorithms, but today there is a lack of planning algorithms based on membrane computing for robotics. With this motivation, we provide a new variant of ENPS called Random Enzymatic Numerical P systems with Proteins and Shared Memory (RENPSM) addressed to implement RRT algorithms and we illustrate it by presenting a model for path planning of mobile robots based on the bidirectional RRT algorithm. A software for RENPSM has been developed within the Robot Operating System (ROS) and simulation experiments have been conducted by means of the Pioneer 3-DX robot simulation platform.

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

[2]  R. C. Coulter,et al.  Implementation of the Pure Pursuit Path Tracking Algorithm , 1992 .

[3]  Marian Gheorghe,et al.  Real-life Applications with Membrane Computing , 2017 .

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

[5]  Gheorghe Paun,et al.  Membrane Computing and Economics: Numerical P Systems , 2006, Fundam. Informaticae.

[6]  Ariel Felner,et al.  Theta*: Any-Angle Path Planning on Grids , 2007, AAAI.

[7]  Ioan Dumitrache,et al.  Robot Localization Implemented with Enzymatic Numerical P Systems , 2012, Living Machines.

[8]  Huijuan Wang,et al.  Application of Dijkstra algorithm in robot path-planning , 2011, 2011 Second International Conference on Mechanic Automation and Control Engineering.

[9]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[10]  Gamini Dissanayake,et al.  Robot Localization: An Introduction , 2016 .

[11]  Mario J. Pérez-Jiménez.  The P versus NP Problem from the Membrane Computing View , 2014 .

[12]  Catalin Buiu,et al.  Enzymatic numerical P systems - a new class of membrane computing systems , 2010, 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA).

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

[14]  Emilio Frazzoli,et al.  Incremental Sampling-based Algorithms for Optimal Motion Planning , 2010, Robotics: Science and Systems.

[15]  Mario J. Pérez-Jiménez,et al.  A bio-inspired computing model as a new tool for modeling ecosystems: The avian scavengers as a case study , 2011 .

[16]  Mario J. Pérez-Jiménez,et al.  A Model of the Quorum Sensing System in Vibrio fischeri Using P Systems , 2008, Artificial Life.

[17]  Zhengyou He,et al.  Fault Diagnosis of Electric Power Systems Based on Fuzzy Reasoning Spiking Neural P Systems , 2015, IEEE Transactions on Power Systems.

[18]  Anthony Stentz,et al.  The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.

[19]  Karl Johan Åström,et al.  PID Controllers: Theory, Design, and Tuning , 1995 .

[20]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[21]  Catalin Buiu,et al.  Using enzymatic numerical P systems for modeling mobile robot controllers , 2011, Natural Computing.

[22]  Wolfram Burgard,et al.  The dynamic window approach to collision avoidance , 1997, IEEE Robotics Autom. Mag..