SP‐search‐based path planning algorithm for mobile robots using quintic trigonometric Bézier curves. (18th July 2021)

• Record Type: Journal Article
• Authors: Bulut, Vahide
• Other Names: Topcu Ahmet E. guestEditor.; Cibikdiken Ali Osman guestEditor.
• Is Part Of: Concurrency and computation. Volume 34:Number 9(2022)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2021-07-18
• Subjects: grid‐based search -- path planning -- quintic trigonometric Bézier curve -- shape parameters; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.6493
• Languages: English
• ISSNs: 1532-0626

Abstract

Abstract: Path planning is an essential step for mobile robots. This paper presents a novel shape parameter search‐ (SP‐Search) based path planning algorithm for mobile robots using quintic trigonometric Bézier curve and its two shape parameters. The proposed search algorithm recursively divides the shape parameter space into a grid and uses a multi‐objective function to determine the shape parameter values. The multi‐objective function is expressed by the sum of four terms multiplied by coefficients: the integral of the squared jerk, the integral of the squared curvature, the mean of minimum distances between the predefined skeleton and quintic trigonometric Bézier path, and the arclength. Optimal shape parameters can be determined according to the required cases by the user using four coefficient values. Experimental results illustrate the feasibility of the proposed SP‐Search algorithm. Also, we have developed another intuitive algorithm, the Brute Force Grid Search algorithm, which is the brute force approach for shape parameter search to compare the performance of the proposed SP‐search algorithm for path planning problems as a baseline. The experimental results show that the SP‐Search algorithm finds better shape parameter values with a considerably small number of searched points.