Abstract:
© Springer Nature Switzerland AG 2020. Potential function based methods play significant role in both global and local path planning. While these methods are characterized with good reactive behaviour and implementation simplicity, they suffer from a well-known problem of getting stuck in local minima of a navigation function. In this paper we propose a modification of our original spline-based path planning algorithm for a mobile robot navigation, which succeeds to solve local minima problem and considers additional criteria of start and target points visibility to help optimizing the path selection. We apply a Voronoi graph based path as an input for iterative multi criteria optimization algorithm and present a path finding strategy within different homotopies that uses the new method. The algorithm was implemented in Matlab environment and demonstrated significantly better results than the original approach. The comparison was based on success rate, number of iterations and running time of the algorithms. In total, several thousands tests were performed in 18 different simulated environments.
