Please use this identifier to cite or link to this item:
標題: Multiobjective Evolution of Biped Robot Gaits Using Advanced Continuous Ant-Colony Optimized Recurrent Neural Networks
作者: Juang, Chia-Feng
Yeh, Yen-Ting
關鍵字: Legged locomotion;Optimization;Recurrent neural networks;Algorithm design and analysis;Genetic algorithms;Hip
Project: IEEE transactions on cybernetics, Volume 48, Issue 6, Page(s) 1910-1922.
This paper proposes the optimization of a fully connected recurrent neural network (FCRNN) using advanced multiobjective continuous ant colony optimization (AMO-CACO) for the multiobjective gait generation of a biped robot (the NAO). The FCRNN functions as a central pattern generator and is optimized to generate angles of the hip roll and pitch, the knee pitch, and the ankle pitch and roll. The performance of the FCRNN-generated gait is evaluated according to the walking speed, trajectory straightness, oscillations of the body in the pitch and yaw directions, and walking posture, subject to the basic constraints that the robot cannot fall down and must walk forward. This paper formulates this gait generation task as a constrained multiobjective optimization problem and solves this problem through an AMO-CACO-based evolutionary learning approach. The AMO-CACO finds Pareto optimal solutions through ant-path selection and sampling operations by introducing an accumulated rank for the solutions in each single-objective function into solution sorting to improve learning performance. Simulations are conducted to verify the AMO-CACO-based FCRNN gait generation performance through comparisons with different multiobjective optimization algorithms. Selected software-designed Pareto optimal FCRNNs are then applied to control the gait of a real NAO robot.
DOI: 10.1109/TCYB.2017.2718037
Appears in Collections:電機工程學系所

Files in This Item:
File Description SizeFormat Existing users please Login
289.pdf2.63 MBAdobe PDFThis file is only available in the university internal network    Request a copy
Show full item record

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.