Particle swarm optimization algorithm vs. genetic algorithm to solve multi-objective optimization problem in gait planning of biped robot

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

Abstract

This paper deals with multi-objective optimization problems in ascending and descending gait planning of biped robot, which has been solved using particle swarm optimization algorithm and genetic algorithm separately. In order to model this problem, two modules of adaptive neuro-fuzzy inference systems have been adopted. Two contrasting objectives, such as power consumption and dynamic balance margin have been considered, and Pareto optimal front of solutions has been obtained. © 2012 Springer-Verlag GmbH Berlin Heidelberg.

Cite

CITATION STYLE

APA

Rajendra, R., & Pratihar, D. K. (2012). Particle swarm optimization algorithm vs. genetic algorithm to solve multi-objective optimization problem in gait planning of biped robot. In Advances in Intelligent and Soft Computing (Vol. 132 AISC, pp. 563–570). Springer Verlag. https://doi.org/10.1007/978-3-642-27443-5_65

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