Skip to main content

Abstract

Many algorithms have been proposed to tackle the path planning problem in mobile robots. Among the well-known and established algorithms are the Probabilistic Road Map (PRM) algorithm, A* algorithm, Genetic algorithm (GA), Rapidly-exploring random tree (RRT), and dual Rapidly-exploring random trees (RRT-connect). Hence, this paper will focus on the performance comparison between the aforementioned algorithms concerning computation time, path length, and fail and success rate for producing a path. For the sake of fair and conclusive results, simulation is conducted in two phases with four different environments, namely, free space environment, low cluttered environment, medium cluttered environment, and high cluttered environment. The results show that RRT-connect has a high success rate in producing a feasible path with the least computation time. Hence, RRTs-based sampling algorithms, in general, and RRT-connect, in specific, will be explored in-depth for possible optimization.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Siegwart, R., Nourbakhsh, I.R.: Introduction to autonomous mobile robots. Cambridge, MIT Press, Cambridge (2011)

    Google Scholar 

  2. Tsardoulias, E.G., Iliakopoulou, A., Kargakos, A., Petrou, L.: A review of global path planning methods for occupancy grid maps regardless of obstacle density. J. Intell. Rob. Syst. 84(1–4), 829–858 (2016). https://doi.org/10.1007/s10846-016-0362-z

    Article  Google Scholar 

  3. Guruji, A.K., et al.: Time-efficient A* Algorithm for robot path planning. Procedia Technol. 23, 144–149 (2016)

    Article  Google Scholar 

  4. Ziaei, Z., et al.: Global path planning with obstacle avoidance for omnidirectional mobile robot using overhead camera. In: 2014 IEEE International Conference on Mechatronics and Automation, IEEE ICMA 2014 (2014)

    Google Scholar 

  5. Gunasekaran, K.U., et al.: Map generation and path planning for autonomous mobile robot in static environments using GA. In: 2018 8th International Conference on Computer Science and Information Technology (CSIT), IEEE (2018)

    Google Scholar 

  6. Hart, P.E., et al.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)

    Article  Google Scholar 

  7. Davidor, Y.: A genetic algorithm applied to robot trajectory generation. Handhook of Genetic Algorithms (1991)

    Google Scholar 

  8. LaValle, S.M.: Rapidly-exploring random trees: a new tool for path planning (1998)

    Google Scholar 

  9. Kuffner Jr, J.J., La Valle, S.M.: RRT-connect: an efficient approach to single-query path planning. In: Proceedings - IEEE International Conference on Robotics and Automation (2000)

    Google Scholar 

  10. Kavraki, L., Latombe, J.: Randomized preprocessing of configuration for fast path planning. In: Proceedings of the 1994 IEEE International Conference on Robotics and Automation (1994)

    Google Scholar 

  11. Amato, N.M., Wu, Y.: Randomized roadmap method for path and manipulation planning. In: Proceedings - IEEE International Conference on Robotics and Automation (1996)

    Google Scholar 

  12. Kavraki, L.E., et al.: Probabilistic roadmaps for path planning in high- dimensional configuration spaces. IEEE Trans. Robot. Autom. 12(4), 566–580 (1996)

    Article  Google Scholar 

  13. Ahmed, S.A.A., Safar, M.J.A.: Shortest path planning for noncircular omnidirectional mobile robot, pp. 209–217 (2018)

    Google Scholar 

  14. Ozkan, M. F., et al.: Rescue Boat Path Planning in Flooded Urban Environments. In: 2019 22nd IEEE International Symposium on Measurement and Control in Robotics: Robotics for the Benefit of Humanity, ISMCR 2019 (2019)

    Google Scholar 

  15. Omar, R.B., et al.: Performance comparison of path planning methods. ARPN J. Eng. Appl. Sci. 10(19), 8866–8872 (2015)

    Google Scholar 

  16. Gammell, J.D., et al.: Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. In: 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, IEEE (2014)

    Google Scholar 

  17. Safar, M.J.A., et al.: Tip-over stability control for a holonomic omnidirectional mobile robot with active dual-wheel caster assemblies using SGCMG. In: IEEE International Conference on Intelligent Robots and Systems (2013)

    Google Scholar 

Download references

Acknowledgment

This work was financed by the Ministry of Higher Education, Malaysia, through the Fundamental Research Scheme Grant (Ref: FRGS/1/2019/TK03/UNIMAP/02/6).

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Aljamali, Y.S. et al. (2022). Holonomic Mobile Robot Planners: Performance Analysis. In: Mahyuddin, N.M., Mat Noor, N.R., Mat Sakim, H.A. (eds) Proceedings of the 11th International Conference on Robotics, Vision, Signal Processing and Power Applications. Lecture Notes in Electrical Engineering, vol 829. Springer, Singapore. https://doi.org/10.1007/978-981-16-8129-5_143

Download citation

Publish with us

Policies and ethics