The application of a hybrid algorithm to the submersible path-planning

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The premature problem is always being a hot topic in the swarm intelligence research field. PSO could easily fall into local optima because the particles could quickly get closer to the best particle. To this end, this paper proposes a new hybrid PSO named HGC-PSO to solve this problem. The mutation mainly considers the m+1 particles which have the better fitness values. Firstly, we add the Gauss mutation to the current global optimal. Secondly, we use the Cauchy mutation to change the rest of the m+1 particles. The purpose of this method is to increase the population diversity and avoid the PSO fall into local optima. Finally, HGC-PSO is applied to path planning problem in 3D space for robot in this paper. The experiment of results prove that the proposed algorithm has higher convergence speed and precision, besides a path without collision is found. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Lv, C., Yu, F., Yang, N., Feng, J., & Zou, M. (2012). The application of a hybrid algorithm to the submersible path-planning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7331 LNCS, pp. 470–478). https://doi.org/10.1007/978-3-642-30976-2_57

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