Comparison of three different curves used in path planning problems based on particle swarm optimizer

21Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In path planning problems, the most important task is to find a suitable collision-free path which satisfies some certain criteria (the shortest path length, security, feasibility, smoothness, and so on), so defining a suitable curve to describe path is essential. Three different commonly used curves are compared and discussed based on their performance on solving a set of path planning problems. Dynamic multiswarm particle swarm optimizer is employed to optimize the necessary parameters for these curves. The results show that Bezier curve is the most suitable curve for producing path for the certain path planning problems discussed in this paper. Safety criterion is considered as a constrained condition. A new constraint handling method is proposed and compared with other two constraint handling methods. The results show that the new method has a better characteristic to improve the performance of algorithm. © 2014 J. J. Liang et al.

Cite

CITATION STYLE

APA

Liang, J. J., Song, H., Qu, B. Y., & Liu, Z. F. (2014). Comparison of three different curves used in path planning problems based on particle swarm optimizer. Mathematical Problems in Engineering, 2014. https://doi.org/10.1155/2014/623156

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free