Skip to main content
SpringerLink
Log in

Path planning algorithm for mobile robots based on clustering-obstacles and quintic trigonometric Bézier curve

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Finding a collision-free feasible path for mobile robots is very important because they are essential in many fields such as healthcare, military, and industry. In this paper, a novel Clustering Obstacles (CO)-based path planning algorithm for mobile robots is presented using a quintic trigonometric Bézier curve and its two shape parameters. The CO-based algorithm forms clusters of geometrically shaped obstacles and finds the cluster centers. Moreover, the proposed waypoint algorithm (WP) finds the waypoints of the predefined skeleton path in addition to the start and destination points in an environment. Based on all these points, the predefined quintic trigonometric Bézier path candidates, taking the skeleton path as their convex hull, are then generated using the shape parameters of this curve. Moreover, the performance of the proposed algorithm is compared with K-Means and agglomerative hierarchical algorithms to obtain the quintic trigonometric Bézier paths desired by the user. The experimental results show that the CO-based path planning algorithm achieves better cluster centers and consequently better collision-free predefined paths.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Data Availability

Not applicable

Code Availability

Not applicable

References

  1. Petrinić, B.M.T., Petrović, I.: Time-optimal velocity planning along predefined path for static formations of mobile robots. Int. J. Control Autom. Syst. 15, 293–302 (2017)

    Article  Google Scholar 

  2. Khatib, O.: Real time obstacle avoidance for manipulators and mobile robot. Int. J Robot. Res. 5(1), 90–98 (1986)

    Article  Google Scholar 

  3. Yamada, T., Sa, Y.L., Ohya, A.: Moving obstacle avoidance for mobile robot moving on designated path. In: 2013 10th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI), Jeju, pp. 509–514 (2013)

  4. Luca, A.D., Flacco, F.: Integrated Control for pHRI: Collision Avoidance, Detection, Reaction and Collaboration. In: in Proceedings 4th IEEE Ras EMBS Int. Conf. Biomed. Robot. Biomech., Rome, Italy, pp. 288–295 (2012)

  5. Haddadin, L.A.D.S., Albu-Schäffer, A.: Robot collisions: A survey on detection, isolation, and identification. IEEE Trans. Robot. 33(6), 1292–1312 (2017)

    Article  Google Scholar 

  6. Tang, L. Dian, S., Gu, G., Zhou, K., Wang, S., Feng, X.: A novel potential field method for obstacle avoidance and path planning of mobile robot. In: 2010 3rd International conference on computer science and information technology, Chengdu, pp. 633–637 (2010)

  7. Mitrovic, S.T., Djurovic, Z.M.: Fuzzy-based controller for differential drive mobile robot obstacle avoidance. IFAC Proc. 43(16), 67–72 (2010)

    Google Scholar 

  8. Zhu, Z., Schmerling, E., Pavone, M.: A convex optimization approach to smooth trajectories for motion planning with car-like robots. In: In Proceedings of the 2015 54th IEEE Conference on Decision and Control (CDC), Osaka, Japan (2015)

  9. Sakthitharan, S., Jayashri, S.: Establishing an emergency communication network and optimal path using multiple autonomous rover robots. Concurr. Comput. Pract. Exp. 31(14) (2019)

  10. Tan, S.M. P.N., Kumar, V.: Cluster analysis: Basic concepts and algorithms. Introduction to Data Mining, pp. 487–568 (2005)

  11. Mendonca, P., Goodwin, S.: \(C-Theta^{*}\): Cluster Based Path-Planning on Grids. In: 2015 International Conference on Computational Science and Computational Intelligence (CSCI), Las Vegas, NV, pp. 605–608 (2015)

  12. Suescún, C.G.P., Aragón, C.J.E., Gómez, M.A.J., Moreno, R.J.: Obstacle evasion algorithm for clustering tasks with mobile robot. In: Figueroa-García, J.C., López-Santana, E.R., Villa-Ramírez, J.L., Ferro-Escobar, R. (eds.) Applied computer sciences in engineering, Springer International Publishing, pp. 84–95 (2017)

  13. Tartaglione, G., Ariola, M.: Obstacle avoidance via landmark clustering in a path-planning algorithm. In: 2018 Annual American Control Conference (ACC), Milwaukee, WI, pp. 2776–2781 (2018)

  14. Bai, T., Yuan, S., Li, X., Yin, X., Zhou, J.: Multi-density clustering based hierarchical path planning. In: 2019 2nd International Conference on Artificial Intelligence and Big Data (ICAIBD), Chengdu, China, pp. 176–182 (2019)

  15. Szkandera, K.O.J., Kolingerová, I.: A clustering approach to path planning for big groups. International Journal of Data Warehousing and Mining (IJDWM). 15(2), 42–61 (2019)

    Article  Google Scholar 

  16. Wang, Q., Bi, S., Zhuang, W., Shen, T., Yan, X.: K-means based path optimization for smart warehouse system. In: 2021 International Conference on Advanced Mechatronic Systems (ICAMechS), IEEE (2021). https://doi.org/10.1109/icamechs54019.2021.9661551

  17. Aydemir, H., Tekerek, M., Gok, M.: Complete coverage planning with clustering method for autonomous mobile robots. Concurrency and Computation: Practice and Experience. (2023). https://doi.org/10.1002/cpe.7830

    Article  Google Scholar 

  18. Wei, Z., Liang, C., Tang, H.: A cross-regional scheduling strategy of waste collection and transportation based on an improved hierarchical agglomerative clustering algorithm. Computational Intelligence and Neuroscience. 2022, 1–17 (2022). https://doi.org/10.1155/2022/7412611

    Article  Google Scholar 

  19. Wu J., S.V.: A Bézier curve-based approach for path planning in robot soccer. In: Intelligent Systems, A., Computing (eds.) In: Abraham A., Krömer P., SnáŠel V. (eds) Innovations in bio-inspired computing and applications. Advances in intelligent systems and computing, vol. 237 (2014). Springer, Cham

  20. Liang J.J., Qu, B.Y., Lui, Z.F., Song H.: Comparison of three different curves used in path planning problems based on particle swarm optimizer. Mathematical Problems in Engineering. 2014 (2014)

  21. Schoenberg, I.: On trigonometric spline interpolation. J. Math. Mech. 13(5), 795–825 (1964)

  22. Han X., W.X., S., L.: Quadratic trigonometric polynomial Bézier curves with a shape parameter. J. Eng. Graph. 29, 82–87 (2008)

  23. Huang, X., Ma, Y., Han X: The cubic trigonometric Bézier curve with two shape parameters. Appl Math Letters. 22, 226–231 (2009)

  24. Tan, X., Zhu, Y.: Quasi-quintic trigonometric Bézier curves with two shape parameters. Computational and Applied Mathematics. 38(4) (2019)

  25. Misro, M.Y., Ramil, A., Ali, J.M.: Quintic trigonometric Bézier curve with two shape parameters. Sains. Malays. 46, 825–831 (2017)

  26. Misro, M.Y., Ramil, A., Ali, J.M.: Quintic trigonometric Bézier curve and its maximum speed estimation on highway designs. AIP Conference Proceedings. 1974(1) (2018)

  27. Bulut, V.: Path planning for autonomous ground vehicles based on quintic trigonometric bézier curve. J Braz. Soc. Mech. Sci. Eng. 43(104) (2021)

  28. Han, J., Kamber, M.: Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers (2001)

  29. Rokach, L., Maimon, O.: Clustering methods. In: Data Mining and Knowledge Discovery Handbook, Springer-Verlag, pp. 321–352 (2005). https://doi.org/10.1007/0-387-25465-x_15

  30. Frigui, H., Krishnapuram, R.: A robust competitive clustering algorithm with applications in computer vision. IEEE Trans. Pattern Anal. Mach. Intell. 21(5), 450–465 (1999)

    Article  Google Scholar 

  31. Leung, Z.J.Y., Xu, Z.: Clustering by space-space filtering. IEEE Trans. Pattern Anal. Mach. Intell. 22(12), 1396–1410 (2000)

    Article  Google Scholar 

  32. Fahad A., Tari, Z., Alamri, A., Khalil, I., Zomaya, A.Y., Foufou, S., Alshatri, N., Abdelaziz, B.: A survey of clustering algorithms for big data: Taxonomy and empirical analysis. IEEE Trans. Emerg. Top. Comput. 2(3), 267–279 (2014)

  33. Wu X, Q.J.G.J.Y.Q.M.H.e.a. Kumar V: Top 10 algorithms in data mining. Knowl. Inf. Syst. 14(1), 1–37 (2008)

  34. Song, B., Wang, Z., Sheng, L.: A new genetic algorithm approach to smooth path planning for mobile robots. Assembly Automation. 36(2), 138–145 (2016). https://doi.org/10.1108/aa-11-2015-094

    Article  Google Scholar 

  35. Song, B., Wang, Z., Zou, L., Xu, L., Alsaadi, F.E.: A new approach to smooth global path planning of mobile robots with kinematic constraints. Int. J Mach. Learn. Cybern. 10(1), 107–119 (2019). https://doi.org/10.1007/s13042-017-0703-7

    Article  Google Scholar 

  36. Song, B., Wang, Z., Zou, L.: An improved PSO algorithm for smooth path planning of mobile robots using continuous high-degree bezier curve. Appl. Soft Comput. 100, 106960 (2021). https://doi.org/10.1016/j.asoc.2020.106960

    Article  Google Scholar 

  37. Xu, L., Song, B., Cao, M.: A new approach to optimal smooth path planning of mobile robots with continuous-curvature constraint. Syst. Sci. Control Eng. 9(1), 138–149 (2021). https://doi.org/10.1080/21642583.2021.1880985

    Article  Google Scholar 

  38. Zhao, Y., Zhou, X.: K-means clustering algorithm and its improvement research. J Phys. Conf. Ser. 1873(1), 012074 (2021). https://doi.org/10.1088/1742-6596/1873/1/012074

    Article  Google Scholar 

  39. Whittingham, H., Ashenden, S.K.: Hit discovery. In: The era of artificial intelligence, machine learning, and data science in the pharmaceutical industry, pp. 81–102. Elsevier, Academic Press (2021). https://doi.org/10.1016/b978-0-12-820045-2.00006-4

Download references

Funding

Not applicable

Author information

Authors and Affiliations

  1. Department of Engineering Sciences, Izmir Katip Celebi University, Cigli, Izmir, 35620, Turkey

    Vahide Bulut

Authors
  1. Vahide Bulut
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

This article is completed all by Vahide Bulut.

Corresponding author

Correspondence to Vahide Bulut.

Ethics declarations

Ethical approval

The submitted work is original and not have been published elsewhere in any form or language.

Consent to participate

Not applicable

Consent for publication

Not applicable

Conflicts of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bulut, V. Path planning algorithm for mobile robots based on clustering-obstacles and quintic trigonometric Bézier curve. Ann Math Artif Intell 92, 235–256 (2024). https://doi.org/10.1007/s10472-023-09893-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-023-09893-8

Keywords

Search

Navigation