Research Information System
Kybernetika, vol.60, no.3, pp.293-316, 2024 (SCI-Expanded)
Due to the widespread use of mobile robots in various applications, the path planning problem has emerged as one of the important research topics. Path planning is defined as finding the shortest path starting from the initial point to the destination in such a way as to get rid of the obstacles it encounters. In this study, we propose a path planning algorithm based on a teaching-learning-based optimization (TLBO) algorithm with Bezier curves in a static environment with obstacles. The proposed algorithm changes the initially randomly selected control points step by step to obtain shorter Bezier curves that do not hit obstacles. We also improve the genetic algorithm-based path planning algorithm. Experimental results show that they provide better paths than other existing algorithms.