Cover
Vol. 20 No. 2 (2024)

Published: December 31, 2024

Pages: 243-258

Original Article

Efficient Path Planning in Medical Environments: Integrating Genetic Algorithm and Probabilistic Roadmap (GA-PRM) for Autonomous Robotics

Abstract

Path-planning is a crucial part of robotics, helping robots move through challenging places all by themselves. In this paper, we introduce an innovative approach to robot path-planning, a crucial aspect of robotics. This technique combines the power of Genetic Algorithm (GA) and Probabilistic Roadmap (PRM) to enhance efficiency and reliability. Our method takes into account challenges caused by moving obstacles, making it skilled at navigating complex environments. Through merging GA’s exploration abilities with PRM’s global planning strengths, our GA-PRM algorithm improves computational efficiency and finds optimal paths. To validate our approach, we conducted rigorous evaluations against well-known algorithms including A*, RRT, Genetic Algorithm, and PRM in simulated environments. The results were remarkable, with our GA-PRM algorithm outperforming existing methods, achieving an average path length of 25.6235 units and an average computational time of 0.6881 seconds, demonstrating its speed and effectiveness. Additionally, the paths generated were notably smoother, with an average value of 0.3133. These findings highlight the potential of the GA-PRM algorithm in real-world applications, especially in crucial sectors like healthcare, where efficient path-planning is essential. This research contributes significantly to the field of path-planning and offers valuable insights for the future design of autonomous robotic systems.

References

  1. S. M. LaValle and J. J. Kuffner Jr, “Randomized kinody- namic planning,” The international journal of robotics research, vol. 20, no. 5, pp. 378–400, 2001.
  2. M. Cardona, F. Cortez, A. Palacios, and K. Cerros, “Mo- bile robots application against covid-19 pandemic,” in IEEE ANDESCON, pp. 1–5, 2020.
  3. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE transac- tions on Robotics and Automation, vol. 12, no. 4, pp. 566– 580, 1996.
  4. S. LaValle, “Rapidly-exploring random trees: A new tool for path planning,” Research Report 9811, 1998.
  5. F. Duchoˇn, A. Babinec, M. Kajan, P. Beˇno, M. Florek, T. Fico, and L. Juriˇsica, “Path planning with modified a star algorithm for a mobile robot,” Procedia engineering, vol. 96, pp. 59–69, 2014.
  6. A. Stentz, The D* algorithm for real-time planning of optimal traverses. Carnegie Mellon University, the Robotics Institute, 1994.
  7. E. W. Dijkstra, “A note on two problems in connexion with graphs,” in Edsger Wybe Dijkstra: His Life, Work, and Legacy, pp. 287–290, 2022.
  8. A. Al-Jumaily and C. Leung, “Wavefront propagation and fuzzy based autonomous navigation,” International Journal of Advanced Robotic Systems, vol. 2, no. 2, p. 10, 2005.
  9. J. H. Holland, “Genetic algorithms,” Scientific american, vol. 267, no. 1, pp. 66–73, 1992.
  10. C. W. Warren, “Global path planning using artificial potential fields,” in 1989 IEEE International Conference on Robotics and Automation, pp. 316–317, 1989.
  11. M. Dorigo, M. Birattari, and T. Stutzle, “Ant colony op- timization,” IEEE computational intelligence magazine, vol. 1, no. 4, pp. 28–39, 2006.
  12. S. Garrido, L. Moreno, D. Blanco, and F. Mart´ın Monar, “Robotic motion using harmonic functions and finite elements,” Journal of intelligent and Robotic Systems, vol. 59, pp. 57–73, 2010.
  13. L. Blasi, E. D’Amato, M. Mattei, and I. Notaro, “Path planning and real-time collision avoidance based on the essential visibility graph,” Applied Sciences, vol. 10, no. 16, p. 5613, 2020.
  14. R. Gonzalez, M. Kloetzer, and C. Mahulea, “Compar- ative study of trajectories resulted from cell decompo- sition path planning approaches,” in IEEE 2017 21st International Conference on System Theory, Control and Computing (ICSTCC), pp. 49–54, 2017.
  15. J.-M. Lien, “Hybrid motion planning using minkowski sums,” in Proceedings of Robotics: Science and Systems IV, 2008.
  16. Z. D. Hussein, M. Z. Khalifa, and I. S. Kareem, “Opti- mize path planning for medical robot in iraqi hospitals,” Engineering and Technology Journal, vol. 33, no. 5, pp. 1009–1022, 2015.
  17. B. Fang, G. Mei, X. Yuan, L. Wang, Z. Wang, and J. Wang, “Visual slam for robot navigation in healthcare facility,” Pattern Recognition, vol. 113, p. 107822, 2021.
  18. M. Takahashi, T. Suzuki, H. Shitamoto, T. Moriguchi, and K. Yoshida, “Developing a mobile robot for trans- port applications in the hospital domain,” Robotics and Autonomous Systems, vol. 58, no. 7, pp. 889–899, 2010.
  19. Y. Jung, Y. Kim, W. H. Lee, M. S. Bang, Y. Kim, and S. Kim, “Path planning algorithm for an autonomous electric wheelchair in hospitals,” IEEE Access, vol. 8, pp. 208199–208213, 2020.
  20. D. P. Romero-Mart´ı, J. I. N´unez-Varela, C. Soubervielle- Montalvo, and A. Orozco-de-la Paz, “Navigation and path planning using reinforcement learning for a roomba robot,” in IEEE 2016 XVIII Congreso Mexicano de Robotica, pp. 1–5, 2016.
  21. X. Huang, Q. Cao, and X. Zhu, “Mixed path planning for multi-robots in structured hospital environment,” The Journal of Engineering, vol. 2019, no. 14, pp. 512–516, 2019.
  22. Z. Jiao, K. Ma, Y. Rong, P. Wang, H. Zhang, and S. Wang, “A path planning method using adaptive poly- morphic ant colony algorithm for smart wheelchairs,” Journal of Computational Science, vol. 25, pp. 50–57, 2018.
  23. I. T. Kurniawan and W. Adiprawita, “Autonomy design and development for an ultraviolet-c healthcare surface disinfection robot,” in IEEE International Symposium on Electronics and Smart Devices (ISESD), pp. 1–6, 2021.
  24. S. Wan, Z. Gu, and Q. Ni, “Cognitive computing and wireless communications on the edge for healthcare service robots,” Computer Communications, vol. 149, pp. 99–106, 2020. 258 | Sabeeh & Al-Furati
  25. T. K. Morimoto, J. J. Cerrolaza, M. H. Hsieh, K. Cleary, A. M. Okamura, and M. G. Linguraru, “Design of patient-specific concentric tube robots using path plan- ning from 3-d ultrasound,” in 2017 39th Annual Interna- tional Conference of the IEEE Engineering in Medicine and Biology Society (EMBC), pp. 165–168, 2017.
  26. H.-M. Gross et al., “Robot companion for domes- tic health assistance: Implementation, test and case study under everyday conditions in private apartments,” in IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 5992–5999, 2015.
  27. M. Gillham, B. McElroy, G. Howells, S. Kelly, S. Spur- geon, and M. Pepper, “Weightless neural system em- ploying simple sensor data for efficient real-time round- corner, junction and doorway detection for autonomous system path planning in smart robotic assisted healthcare wheelchairs,” in IEEE Third International Conference on Emerging Security Technologies, pp. 161–164, 2012.
  28. Y. Zhu, A. Smith, and K. Hauser, “Informative path planning for automatic robotic auscultation,” in ICRA 2021 Workshop on Impact of COVID-19 on Medical Robotics and Wearables Research, 2021.
  29. P. Manikandan, G. Ramesh, G. Likith, D. Sreekanth, and G. D. Prasad, “Smart nursing robot for covid-19 patients,” in IEEE International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE), pp. 839–842, 2021.
  30. B. Wang, Z. Liu, Q. Li, and A. Prorok, “Mobile robot path planning in dynamic environments through glob- ally guided reinforcement learning,” IEEE Robotics and Automation Letters, vol. 5, no. 4, pp. 6932–6939, 2020.
  31. K. J. O’Hara and T. R. Balch, “Distributed path planning for robots in dynamic environments using a pervasive embedded network,” in IEEE the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004, pp. 1538–1539, 2004.
  32. X. Zhong, J. Tian, H. Hu, and X. Peng, “Hybrid path planning based on safe a* algorithm and adaptive win- dow approach for mobile robot in large-scale dynamic environment,” Journal of Intelligent & Robotic Systems, vol. 99, pp. 65–77, 2020.
  33. Z. Du, D. Qu, F. Xu, and D. Xu, “A hybrid approach for mobile robot path planning in dynamic environ- ments,” in IEEE International Conference on Robotics and Biomimetics (ROBIO), pp. 1058–1063, 2007.
  34. C. Zhou, B. Huang, and P. Fr¨anti, “A review of motion planning algorithms for intelligent robots,” Journal of Intelligent Manufacturing, vol. 33, no. 2, pp. 387–424, 2022.
  35. K. Karur, N. Sharma, C. Dharmatti, and J. E. Siegel, “A survey of path planning algorithms for mobile robots,” Vehicles, vol. 3, no. 3, pp. 448–468, 2021.
  36. S. M. LaValle, Planning algorithms. Cambridge Univer- sity Press, 2006.
  37. P. Navya and R. Ranjith, “Analysis of path planning algorithms for service robots in hospital environment,” in IEEE International Conference on Computing Com- munication and Networking Technologies (ICCCNT), pp. 1–6, 2021.
  38. S. Chen, “Kalman filter for robot vision: a survey,” IEEE Transactions on Industrial Electronics, vol. 59, no. 11, pp. 4409–4420, 2011.
  39. A. Guttman, “R-trees: A dynamic index structure for spatial searching,” in Proceedings of the 1984 ACM SIGMOD international conference on Management of data, pp. 47–57, 1984.
  40. M. W. Spong, S. Hutchinson, and M. Vidyasagar, Robot modeling and control. John Wiley & Sons, 2020.
  41. H. Choset, K. M. Lynch, S. Hutchinson, G. A. Kantor, and W. Burgard, Principles of robot motion: Theory, algorithms, and implementations. MIT Press, 2005.
  42. M. Wahde, “Introduction to autonomous robots.” Lec- ture Notes from the course Autonomous Agents, Chalmers University of Technology, 2012.
  43. P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, 1968.
  44. J. R. Sampson, “Adaptation in natural and artificial sys- tems (john h. holland).” Society for Industrial and Ap- plied Mathematics, 1976.
  45. M. S. Arulampalam, S. Maskell, N. Gordon, and T. Clapp, “A tutorial on particle filters for online nonlinear/non-gaussian bayesian tracking,” IEEE Trans- actions on Signal Processing, vol. 50, no. 2, pp. 174–188, 2002.