Simulation of Rapidly-Exploring Random Trees in Membrane Computing with P-Lingua and Automatic Programming
Abstract
Methods based on Rapidly-exploring Random Trees (RRTs) have been widely used in robotics to solve motion planning problems. On the other hand, in the membrane computing framework, models based on Enzymatic Numerical P systems (ENPS) have been applied to robot controllers, but today there is a lack of planning algorithms based on membrane computing for robotics. With this motivation, we provide a 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 simulating the bidirectional RRT algorithm. This paper is an extension of [21]a. The software presented in [21] was an ad-hoc simulator, i.e, a tool for simulating computations of one and only one model that has been hard-coded. The main contribution of this paper with respect to [21] is the introduction of a novel solution for membrane computing simulators based on automatic programming. First, we have extended the P-Lingua syntax —a language to define membrane computing models— to write RENPSM models. Second, we have implemented a new parser based on Flex and Bison to read RENPSM models and produce source code in C language for multicore processors with OpenMP. Finally, additional experiments are presented.References
Astrom, K.J.; Hagglund, T. (1995). PID Controllers: Theory, Design, and Tuning, 1995
Colomer, M.A.; Margalida, A.; D. Sanuy,D.; Pérez-Jiménez, M.J. (2011). A bio-inspired computing model as a new tool for modeling ecosystems: The avian scavengers as a case study. Ecological Modelling, 222 (1), 33-47, 2011. https://doi.org/10.1016/j.ecolmodel.2010.09.012
DÃaz-Pernil, D.; Pérez-Hurtado, I.; Pérez-Jiménez, M.J.; Riscos-Nú-ez, A. (2009). A PLingua Programming Environment for Membrane Computing. Lecture Notes in Computer Science, 5391, 187-203, 2009. https://doi.org/10.1007/978-3-540-95885-7_14
Coulter, C. (1992). Implementation of the Pure Pursuit Path Tracking Algorithm, Tech. Report, CMU-RI-TR-92-01, Robotics Institute, Carnegie Mellon University, 1992.
Fox, D.; Burgard, W.; Thrun, S. (1997). The dynamic window approach to collision avoidance, Robotics and Automation Magazine, 4 (1), 23-33, 1997. https://doi.org/10.1109/100.580977
Gao, Y.; Wu, X.; Liu, Y.; Li, J.M.; Liu J.H.(2017). A Rapid Recognition of Impassable Terrain for Mobile Robots with Low Cost Range Finder Based on Hypotheses Testing Theory, International Journal of Computers Communications & Control, 12(6), 813-823, 2017. https://doi.org/10.15837/ijccc.2017.6.2981
GarcÃa-Quismondo, M.; Gutiérrez-Escudero, R.; MartÃnez-del-Amor, M.A.; Orejuela-Pinedo, E.; Pérez-Hurtado, I. (2009). P-Lingua 2.0: A software framework for cell-like P systems. International Journal of Computers Communications & Control, 4(3), 234-243, 2009. https://doi.org/10.15837/ijccc.2009.3.2431
Huang, S.; Dissanayake, G. (2016). Robot Localization: An Introduction, Wiley Encyclopedia of Electrical and Electronics Engineering, 2016
Karaman, S.; Frazzoli, E. (2010). Incremental Sampling-based Algorithms for Optimal Motion Planning, Robotics Science and Systems VI, 1-9, 2010 https://doi.org/10.15607/RSS.2010.VI.034
Khatib, O. (1986). Real-time obstacle avoidance for manipulators and mobile robots, Int J Robot Res, 5(1), 90-98, 1986. https://doi.org/10.1177/027836498600500106
Latombe, J.C. (1991). Robot Motion Planning, Kluwer Academic Publishers, Boston, MA, 1991. https://doi.org/10.1007/978-1-4615-4022-9
LaValle, S.M. (1998). Rapidly-Exploring Random Trees: A New Tool for Path Planning, Computer Science Dept., Iowa State University, October 1998.
LaValle, S.M.; Kuffner, J.J. (1999). Randomized kinodynamic planning, Proceedings IEEE International Conference on Robotics and Automation, 473-479, 1999.
MartÃnez-del-Amor, M.A.; Pérez-Hurtado, I.; Pérez-Jiménez, M.J.; Riscos-Nú-ez, A. (2010). A P-Lingua based simulator for Tissue P Systems, Journal of Logic and Algebraic Programming, 79 (6), 374-382, 2010. https://doi.org/10.1016/j.jlap.2010.03.009
Nash, A.; K. Daniel, Koenig,S.; Felner, A. (2010). Theta: Any-Angle Path Planning on Grids, Journal of Artificial Intelligence Research, 39, 533-579, 2010. https://doi.org/10.1613/jair.2994
Paun, G. (2010). Computing with membranes, Journal of Computer and System Sciences, 61 (1), 108-143, 2000.
Paun, G., Paun R. (2006). Membrane Computing and Economics: Numerical P Systems, Fundamenta Informaticae, 73(1,2), 213-227, 2006.
Pavel, A.; Arsene, O.; Buiu, C. (2010). Enzymatic Numerical P Systems - A New Class of Membrane Computing Systems, Proceedings of IEEE fifth international conferenced on bio-inspired computing: Theories and applications (BIC-TA), 1331-1336, 2010.
Pavel, A.; Vasile, C.; Dumitrache, I. (2012). Robot localization implemented with enzymatic numerical P systems, Proceedings of the international conference on biomimetic and biohybrid systems, 204-215, 2012. https://doi.org/10.1007/978-3-642-31525-1_18
Pavel, A.; Buiu, C. (2012). Using enzymatic numerical P systems for modeling mobile robot controllers, Natural Computing, 11(3), 387-393, 2012. https://doi.org/10.1007/s11047-011-9286-5
Pérez, I.; Pérez-Jiménez, M.J.; Zhang, G.; Orellana-MartÃn D. (2018). Robot path planning using rapidly-exporing random trees: A membrane computing approach, 2018 IEEE 7th International Conference on Computers Communications and Control, Proc. of (ICCCC2018), Oradea, Romania, May 08-12, 37-46, 2018.
Pérez-Jiménez, M.J.(2014); The P versus NP problem from Membrane Computing view, European Review, 22 (1), 18-33, 2014. https://doi.org/10.1017/S1062798713000598
Pérez-Hurtado, I. Pérez-Jiménez, M.J. (2017). Generation of rapidly-exploring random tree by using a new class of membrane systems. Pre-proceedings of Asian Conference on Membrane Computing (ACMC2017), Chengdu, China, September 21-25, 534-546, 2017.
Romero-Campero, F.J.; Pérez-Jiménez, M.J. (2008). A Model of the Quorum Sensing System in Vibrio fischeri Using P Systems. Artificial Life, 14 (1), 95-109, 2008. https://doi.org/10.1162/artl.2008.14.1.95
Stentz, A. (1995). The Focussed D* Algorithm for Real-time Replanning, Proceedings of the 14th International Joint Conference on Artificial Intelligence, 2, 1652-1659, 1995.
Wang, H.; Yu, Y.; Q. Yuan, Q. (2011). Application of Dijkstra algorithm in robot pathplanning, Proceedings of the 2nd International Conference on Mechanic Automation and Control Engineering, 1067-1069, 2011.
Wang, T.; Zhang, G.; Zhao, J.; He, Z.; Wang, J.; Pérez-Jiménez, M.J. (2015). Fault diagnosis of electric power systems based on fuzzy reasoning spiking neural P systems. IEEE Transactions on Power Systems, 30(3), 1182 - 1194, 2015. https://doi.org/10.1109/TPWRS.2014.2347699
Widyotriatmo, A.; Joelianto, E.; Prasdianto, A.; Bahtiar, H.; Nazaruddin, Y.Y. (2017). Implementation of Leader-Follower Formation Control of a Team of Nonholonomic Mobile Robots, International Journal of Computers Communications & Control, 12(6), 871-885, 2017. https://doi.org/10.15837/ijccc.2017.6.2774
Zhang, G.; Perez-Jimenez, M.J.; Gheorghe, M. (2017). Real-life Applications with Membrane Computing, Series: Emergence, Complexity and Computation, Volume 25. Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-55989-6
http://www.mobilerobots.com/Software/MobileSim.aspx
http://www.p-lingua.org/wiki/index.php/Main_Page
https://developer.nvidia.com/cuda-zone
https://github.com/westes/flexl
https://www.gnu.org/software/bison/
Published
Issue
Section
License
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.
