Research Article | Open Access
H. F. Yu, E. H. K. Fung, X. J. Jing, "An Improved ZMP-Based CPG Model of Bipedal Robot Walking Searched by SaDE", International Scholarly Research Notices, vol. 2014, Article ID 241767, 16 pages, 2014. https://doi.org/10.1155/2014/241767
An Improved ZMP-Based CPG Model of Bipedal Robot Walking Searched by SaDE
This paper proposed a method to improve the walking behavior of bipedal robot with adjustable step length. Objectives of this paper are threefold. (1) Genetic Algorithm Optimized Fourier Series Formulation (GAOFSF) is modified to improve its performance. (2) Self-adaptive Differential Evolutionary Algorithm (SaDE) is applied to search feasible walking gait. (3) An efficient method is proposed for adjusting step length based on the modified central pattern generator (CPG) model. The GAOFSF is modified to ensure that trajectories generated are continuous in angular position, velocity, and acceleration. After formulation of the modified CPG model, SaDE is chosen to optimize walking gait (CPG model) due to its superior performance. Through simulation results, dynamic balance of the robot with modified CPG model is better than the original one. In this paper, four adjustable factors (, , , and ) are added to the joint trajectories. Through adjusting these four factors, joint trajectories are changed and hence the step length achieved by the robot. Finally, the relationship between (1) the desired step length and (2) an appropriate set of , , , and searched by SaDE is learnt by Fuzzy Inference System (FIS). Desired joint angles can be found without the aid of inverse kinematic model.
Recently, many approaches have been adopted for generation of bipedal walking gait. Some researches [1–3] adopted a simplified dynamic model to generate walking gait calculated through inverse kinematic model which is complex and hence the computation load is high.
Inspired by neural science, some researchers investigated central pattern generator (CPG). The prime reason for arousing their interest is that CPG models provide several parameters for modulation of locomotion, such as step stride and rhythm, and are suitable to integrate feedback sensors. Hence, a good interaction between the robot and the environment can be achieved . According to Ijspeert , CPG becomes more and more popular in robot community. Taga et al.  integrated feedbacks with neural oscillators for unpredicted environment. Yang et al. , Shafii et al. , and Yazdi et al.  utilized TFS to formulate ZMP-based CPG model as the basic walking pattern of bipedal robot. Or  presented a hybrid CPG-ZMP control system for flexible spine humanoid robot. Aoi and Tsuchiya  proposed a locomotion control system based on CPG model for straight and curved walking. Farzenah et al.  noted that many researches on CPG model are designed for specific motion only and thus cannot generate arbitrary walking gait, such as changing step length and proposed 31 TS-Fuzzy systems for adjusting speed and step length.
Ijspeert  and Gong et al.  stated that stochastic population-based optimization algorithms have been chosen to optimize parameters of CPG model in many studies. Genetic Algorithm (GA) [6, 13], Genetic Programming (GP) , Particle Swarm Optimization (PSO) , and Bee Algorithm  are adopted in searching the parameters of CPG model. Besides the above-mentioned techniques, there are still other gradient-free optimization techniques. Storn and Price  proposed Differential Evolution (DE) and conducted comparisons with some prominent algorithms, such as Adaptive Simulated Annealing (ASA) and the Breeder Genetic Algorithm (BGA). DE outperforms the above-mentioned prominent algorithms in terms of least number of generations for finding global minimum . Similar results are reported in the following studies [16–18]. Hegery et al.  carried out comparisons between DE and GA on N-Queen and travelling salesman problem and concluded that the performance of DE is better. Tušar and Filipič  carried out comparisons between DE-based variants DEMO and basic GA on multiobjective optimization problem and their result showed that DEMO outperforms basic GA. Vesterstrøm and Thomsen  noted that DE outperforms PSO and Evolutionary Algorithms (EAs) on majority of numerical benchmark problems. DE consists of population size (NP), scaling factor (), and crossover rate (CR) which significantly affect the performance of DE [19–22]. Different problems require different parameters and strategies for effective optimization. Even in the same problem, different regions of search space may require different strategies and parameters for better performance . It is time consuming to search the most appropriate strategy and parameters by trial and error. Hence, Omran et al.  and Brest et al.  have proposed different methods to adjust CR and F. However, appropriate mechanism for choosing suitable strategies is not considered in [21, 22]. Qin et al.  proposed Self-adaptive Differential Evolution Algorithm (SaDE) which can adjust CR, and choose strategy automatically during optimization. SaDE outperforms conventional DE variants and the other adaptive DE, such as SDE  and jDE , in terms of higher successful rate.
Based on the above-mentioned findings, this paper focuses on (1) CPG model for trajectory generation and (2) providing an efficient method to adjust step length. In this paper, original CPG model proposed by Yang et al.  is adopted since it provides a good foundation for the goal stated in this paper. The angular velocity of trajectories generated by GAOFSF  is usually discontinuous which has an adverse effect on ZMP. As a result, GAOFSF is modified to ensure that the trajectory generated is continuous in angular position and its first and second derivatives. After formulation of modified CPG model, parameters of CPG model are searched based on kinematic and dynamic constraints. It shows that the problem can be formulated as a multiobjectives and multiconstraints optimization. Gradient-free optimization technique is chosen since a set of parameters is searched in a highly irregular and multidimensional space which cannot be handled by standard gradient-based search method . SaDE is chosen as the method for optimizing the walking gait of robot in this paper because (1) its performance is superior and (2) appropriate strategies and parameters are not chosen manually. Based on [6, 23], step length can be varied by simply changing several adjustable factors of GAOFSF. Look-up table proposed by Yang et al.  is not adopted in this paper because (1) a lot of memory is occupied if tremendous data is stored and (2) arbitrary step length within specific range cannot be commanded to the robot. To deal with this problem, four parameters (, , , and ) are added to the modified CPG model and searched by SaD. Four FIS systems are used to learn the relationship between (1) desired step lengths and , , , and . Then, desired joint angles can be found without the aid of inverse kinematics.
2. Kinematic Model and Dynamic Model of Bipedal Robot
In Figure 1, it shows that the bipedal robot consists of 12 DoF. Each leg has 6 DoF. RL and LL represent right and left legs respectively, while represent joint number. Figure 1 assumes that right leg is the support leg while the left leg is the swing leg. Joint number of support leg and swing leg corresponds to different joint shown in Table 1. Also, -axis of local coordinates attached on different joints acts as rotation axis and the direction of rotation is determined by right-hand rule.
Information of physical dimension of bipedal robot is measured and simplified based on a modified Kondo-3HV. The total mass of the bipedal robot is about 1.4 kg. The mass of upper trunk and lower body is about 0.4 kg and 1 kg, respectively. Since the mass of each link in lower body is almost the same, then their masses are simply obtained by . The height of each link is shown in Table 2.
Since Denavit-Hartenberg notation [24, 25] and iterative Newton-Euler dynamic algorithm [26, 27] are maturely developed and commonly used in many studies of bipedal robot, these two methods are adopted to formulate forward kinematic model and inverse dynamic model, respectively, in this paper. Since this paper focuses on bipedal walking on horizontal flat plane in sagittal plane (parallel to the plane of global coordinate), only shown in (1) is considered and acts as an indicator to evaluate the dynamic equilibrium of the bipedal robot. In Figure 2, a local coordinate is attached to the center of support foot to observe the variation of with time.
3. Formulation of Modified ZMP-Based CPG Model
Hip and knee trajectories of GAOFSF  consist of two different sections. For hip joint, two different Truncated Fourier Series (TFS) are used to formulate the upper portion () and lower portion () of trajectory. For knee joint, TFS and lock phase are joined together to formulate the whole trajectory. Based on Figure 3, the angular position is observed to be continuous. However, angular velocity of searched trajectory generated by GAOFSF is usually discontinuous (1) at the transition between and ( and or ) and (2) at the beginning ( or ) and the end of lock phase ( or ). Abrupt change in angular velocity has an adverse effect on ZMP and hence the dynamic equilibrium of bipedal robot. In this paper, the GAOFSF is modified to ensure that the trajectories generated are continuous in angular position and its first derivative and second derivative. and are regarded as the period of left support phase and right support phase, respectively. Then, and are the landing time of left support phase and right support phase, respectively . The time duration () of one step is set as 1 s to ensure a reasonable walking speed. and are set as 0.7 s and 1.7 s while and are set as 1 s and 2 s. Four different parameters (, , , and ) are added for adjustment of step length. Details of finding the values of these four parameters are discussed in Section 5. In this section, investigation is mainly focused on the formulation of modified CPG model.
3.1. Hip Trajectory in Sagittal Plane
Since the peaks of and are different, two different TFS are required to formulate the hip trajectory. Yang et al.  have proposed 5th order TFS and showed that the amplitudes of 4th and 5th orders are too small which can be neglected. 3rd order TFS is adopted. In (2)-(3), angular velocity of and at and is set as equal to ensure angular velocity is continuous. Thus, two more orders are added to to satisfy this constraint and are calculated by (4)-(5).
3.2. Knee Trajectory in Sagittal Plane
In the knee trajectory, Yang et al.  proposed a lock phase ( and ) in knee trajectory which assumes constant joint angle and zero angular velocity and acceleration. This introduces abrupt change in angular velocity. The main goals to be achieved in the modified knee trajectory are (1) continuity in angular position, velocity, and acceleration and (2) the advantage proposed in GAOFSF that can be maintained. Then, a new formulation is proposed in the following equation: In (11), lock phase is canceled to ensure continuous angular velocity. By adjusting , GAOFSF can achieve energy efficient and stable “bent knee” walking gait. This advantage is still remained in the proposed modified model. The general shape of the hip and knee trajectories generated by modified CPG model is shown in Section 6.
3.3. Ankle Trajectory in Sagittal Plane
Right and left ankle joint trajectories are simply formulated as (12) to ensure that the trunk is upright and swing foot is parallel to the horizontal flat plane.
4. Optimization of Basic Walking Pattern by SaDE
This section focuses on how to search the basic walking pattern of bipedal robot by SaDE [19, 20]. To simplify the whole process in this section, , , , and are set as 1. The following are the main objectives of basic walking pattern to be achieved through using SaDE.(1)The desired step length is set as 0.05 m.(2)Upper bound and lower bound of swing height are set as 0.02 m and 0.01 m, respectively.(3)Premature landing should not occur throughout the walking cycle.(4)ZMP is within the area of support polygon throughout the walking cycle.
The procedure of SaDE takes the following steps. Also, a flow chart of SaDE is shown in Figure 30 of the Appendix to facilitate the understanding of readers. Details of the procedure are discussed in Sections 4.1–4.7.(1)Select fitness functions () and constraints ().(2)Code the parameters to be searched to form target vector ().(3)Initialize the first generation () of population ().(4)Initialize crossover rate (), scaling factor (), and probability () for each mutation strategies () based on and .(5)Select mutation strategies () based on probability () through MATLAB function rand() and perform mutation operation to generate mutant vectors ().(6)Perform crossover operation to generate trial vectors ().(7)Perform selection operation to select next generation of target vectors ().(8)During learning period (LP), record the successful time () and failure time () of each strategy ().(9)During learning period (LP), record values of and for each strategy () that successfully help the trial vectors () enter the next generation .(10)Upon completion of LP, probability () for choosing suitable strategies () is adjusted based on successful rate of strategy () calculated through and .(11)Upon completion of LP, and are adjusted based on the mean values of stored and, respectively.(12)Repeat procedures (4)–(11) until maximum generation is completed
4.1. Fitness Functions and Constraints (Step 1)
Fitness functions () and constraints () are designed or modified based on . Since trunk occupies a large proportion of the whole body mass, abrupt change in trunk velocity can lead to abrupt change in . is formulated as follows: where is number of data.
Strike velocity during landing should be as small as possible since impact between landing foot and the ground can cause mechanical wear of parts and unstable walking. is stated as follows :
If is within the area of support polygon throughout the walking cycle, dynamic equilibrium of the robot is satisfactory. To deal with the discrepancies between simulation model and physical test bed, a safety factor (0.01 m) is added to ensure good performance during experiment. is formulated as follows: where is length (0.121 m) of foot sole/2.
The robot is assigned to walk forward along positive -axis. To ensure correct direction, and are designed as follows: where is mean trunk velocity in -direction and is mean swing foot velocity in -direction.
To achieve natural human-like walking gait, and are designed based on the modified CPG model. is designed to ensure that the robot can achieve desired step length:
To ensure reasonable swing height, is designed to ensure that the swing height is within the m. is designed to prevent the swing foot from penetrating through the ground and hence reduce the chance of premature landing while is designed to ensure swing foot lands on the ground ( m) at landing time which is and :
The total scores used for evaluating each target vector () are formulated as follows:
These weightings are set by trial and error to ensure their importance is almost the same and walking gait with satisfactory performance can be obtained: where is weighting of fitness functions and is weighting of constraints.
4.2. Initialization of Parameters of Target Vectors () (Steps 2 and 3)
The target vector () is formulated as follows: Then, the parameters of population () are initialized by MATLAB function rand() which generates randomly.
4.3. Initialization of Parameters of SaDE (Step 4)
Since the range of parameters to be searched is small, then population () of one generation () is set as 30 to balance between good diversity of population and low computation load. Four mutation strategies () are adopted. For strategy , MATLAB function (mean value, ) is used to generate and for each trial vector (). In the initial phase, the crossover rate () should not be too high to prevent premature convergence while the scaling factor () should not be too small to affect the exploration ability. Hence, a moderate value (0.5) is assigned to and (mean value) and is set as 0.1. This function can generate random numbers from the normal distribution through mean value (, ) and standard deviation (). is set as 0.25 for strategy so that each strategy has the equal chance to be chosen during the first learning period:
4.4. Mutation Operation of SaDE (Step 5)
DE/rand/1, DE/rand/2 and DE/current-to-rand/2 provide good exploration ability while DE/current-to-best/2 demonstrates good convergence speed. To balance between exploration ability and convergence speed, these four strategies are adopted. These four mutation strategies are stated in (27)–(30) as follows:(1)DE/rand/1, (2)DE/rand/2, (3)DE/rand-to-best/2, (4)DE/current-to-rand/2,
4.5. Crossover Operation of SaDE (Step 6)
Because of its popularity, binomial crossover operator  is utilized in all mutation strategies. where is the parameter number () in the target () and mutant () vector. Arbitrary parameter number is assigned to to ensure that trial vector () is different from target vector (). If values of exceed the desired range of parameters to be searched, is reset by MATLAB function rand ().
4.6. Selection Operation of SaDE (Step 7)
If score of trial vector () is lower than that of target vector (), then trial vector enters the next generation. Otherwise, target vector enters the next generation.
4.7. Adjustment of , and (Steps 8–11)
Initially, a learning period () is assigned to balance between good sample size of data and update frequency. During learning period, successful times () and failure times () of each mutation strategy () in each generation are recorded. For example, if strategy is chosen and helps one trial vector () to enter next generation, then is added by 1. Otherwise, is added by 1. Once learning period is completed, is adjusted by the successful rate (). Then, and are reset to zero for the next learning period to eliminate effect of the past data:
Similar approach is applied to adjust and . During learning period (LP = 5 generations), for strategy , and corresponding to the trial vectors () that successfully enters next generation are stored in database. Once learning period is completed, mean value ( and ) of the stored value corresponding to strategy is calculated and is used to generate a new set of and . Then, storage data of and are removed for the next learning period to eliminate the effects of past data.
5. Optimization of Factors (, , , and ) for Step Length Adjustment
5.1. Objective Functions and Constraints of SaDE
The objective functions and constraints mentioned in Section 4 are adopted to search appropriate value of , , , and corresponding to different desired step length (0.04 m, 0.03 m, 0.02 m, and 0.01 m).
5.2. Lower Bound of Maximum Desired Swing Height
It is natural that the maximum swing height becomes lower to consume less energy if step length is smaller. Lower bound of swing height is reset as lower value for different step lengths (Table 3) while the upper bound (0.02 m) remains the same.
5.3. Smooth Transition of
Values of (joint = rhs, lhs, rks, and lks) of support leg and swing leg are different. At the moment of landing time, is changed to since the support leg is changed to swing leg in the next step. In order to have a smooth transition, fifth order polynomial shown in equation (34) is utilized. The period of transition time () is set as 0.4 s which is 40% of time duration (1 s) of one step to balance between rapid transition time and good dynamic equilibrium.
The coefficients of are solved by the following constraints:
5.4. Fuzzy Inference System (FIS)
Four FISs are adopted to learn the relationship between (1) , , , and and (2) desired step length (5 cm, 4 cm, 3 cm, 2 cm, 1 cm, and 0 cm). The architecture of FIS proposed by  is shown in Figure 4. The desired step length () is the input of FIS while is the output of FIS which is obtained through the summation of . Based on , is a function of desired step and can be represented as a first order polynomial stated in (40).
In this section, the membership function () is set as Gaussian function as follows: where is degree of membership function of , is parameter that affects the width of Gaussian function of , is parameter that affects the center of Gaussian function of , is firing strength of rule , and is normalized firing strength.
This section focuses on adjusting the consequent parameters () of by least square estimation (LSE)  stated in (41). Gradient descent algorithm is not adopted to adjust premise parameters since the size of training data () is relatively small. Hence, premise parameters are fixed during the training process. In this paper, are set as 0.2, 0.4, 0.6, 0.8, and 1, respectively, while are set as 0.3. After 50 training cycles, an appropriate set of consequent parameters is found. Details of result in this section are stated in Section 6.
Considerwhere is vector of desired step length and is vector of desired output.
6. Results and Discussions
6.1. Scores and Searched Parameters of Modified CPG Model
According to Figure 5, the maximum generation is set as 200. The scores of the best target vector is −1163.5. The values of fitness functions and constraints are [0.018 ms−1, 0.0369 ms−1] and [0 m,0 ms−1,0 ms−1, 0 rad, 0 rad, 0 m, 0 m, 0 m, and 0 m], respectively. The searched parameters are [0.2290 0.0257 0.0016 −0.3161 −0.0199 −0.0001 0.2892 0.0861 0.0004 −0.1786 0.0619]. The results show that the modified CPG model can achieve a satisfactory performance.
6.2. Kinematic Aspects of Modified CPG Model
The walking gait searched by SaDE is visualized in Figure 6. Figure 7 shows that step achieved by bipedal robot is the same as the desired step length (0.05 m). In Figure 8, maximum height of swing foot is satisfactory based on Table 3. Swing foot lands on the ground at desired landing time ( s and s). The joint trajectories of modified CPG model are shown in Figure 9. Based on Figures 10 and 11, angular position and velocity of each joint trajectory is observed to be continuous and smooth. Because of the heavy trunk mass, abrupt change in should be prevented. From Figure 12, it shows that is continuous and smooth except the landing time.
6.3. Dynamic Aspects of Modified CPG Model
Figure 13 shows that dynamic equilibrium of the robot is satisfactory since is within the area of support polygon m. The length of foot sole is 0.122 m while margin is defined to be . Based on Figure 13, margin is observed to be at least 0.03 m which is large enough to allow larger step. is smooth and the only abrupt change happens at the landing time ( s and s) since shifts to the support foot of the next step at these two moments.
6.4. Observations on Mutation Strategies of SaDE
During searching parameters of modified CPG model, it shows that mutation strategy 2 and strategy 3 do not favor for searching feasible walking gait since they are suppressed completely after 60 generations (Figure 14). Figure 5 shows that scores of target vectors tend to converge in the range of generation 100 to 200. Strategy 1 can help trial vector converge faster since it involves the best trial vector in the mutation operation. Hence, from generation 100 to 200, the probability for choosing strategy 1 is always higher than that of strategy 4.
6.5. Results of Original CPG Model
Except constraint 1, the original CPG model  is searched by SaDE under the same setting. Safety factor is set as 0 m since it becomes difficult to search a feasible walking gait for original CPG model if safety factor is set as 0.01 m. Based on Figure 15, the scores of the best trial vector is −1105.9. Also, the searched parameters are [0.0519 0.0012 0.0070 −0.5237 −0.0053 −0.0068 0.3579 0.1459 0.0025 0.0891 0.1736]. The values of fitness functions and constraints are [0.0694 ms−1, 0.0484 ms−1] and [0.0002 m, 0 ms−1, 0 ms−1, 0 rad, 0 rad, 0 m, 0 m, 0 m, 0 m], respectively. Compared with the performance of modified CPG model, the original CPG model is less satisfactory. The walking gait of original CPG model searched by SaDE is visualized in Figure 16. Also, in Figure 17, desired step length (0.05 m) is successfully achieved. In Figure 18, maximum height of swing foot is satisfactory based on Table 3. Also, swing foot lands on the ground at desired landing time ( s and s).
The joint trajectories of modified CPG model are shown in Figure 19. Based on Figures 20 and 21, angular velocity of each joint trajectory is observed to be discontinuous. The standard deviation ( ms−1) of is larger than that ( ms−1) of modified CPG model. The prime reason is that, in Figure 22, is observed to be discontinuous because of discontinuity in angular velocity. In Figure 23, obvious abrupt change in is observed. Also, exceeds the area of support polygon ( m). This shows that dynamic equilibrium of bipedal robot is affected by discontinuous angular velocity. Although the area of foot sole can be made larger to tolerate the abrupt change of , the agility of the robot is sacrificed. For the original CPG model, a larger step is not allowed since has exceeded the support polygon when the robot walks with 5 cm step length.
6.6. Results of , , , and Searched by SaDE
, , , and searched by SaDE are shown in Table 4. In Figure 24, it shows that the bipedal robot can achieve desired step length (4 cm, 3 cm, 2 cm, and 1 cm). Also, in Figure 25, the maximum swing height corresponding to different desired step length reaches reasonable swing height based on Table 3 and no premature landing occurs during walking.
In Figure 26, is always within the area of support polygon . Hence, the dynamic equilibrium of the robot for different desired step length is satisfactory. Then, an attempt is made to show that when desired step length is adjusted in the next step, can still be maintained within the area of support polygon . The bipedal robot is at rest initially and is commanded to change its step length at s. In Figure 27, it shows that if change in step length is larger, then change in is larger. It also shows that, in the case of the largest change in step length (0 cm to 5 cm), is still within area of support polygon. Hence, robot can keep its dynamic balance well when desired step length is changed in the next step.
6.7. Relationship between , , , and and Desired Step Length Learnt by FIS
The parameters of FLS tuned by LSE are shown in Table 5. Arbitrary desired step lengths (0.041 cm, 0.033 cm, 0.025 cm, and 0.017 cm) within a specific range (0 cm–5 cm) are commanded to the robot. In Figure 28, it shows that the robot can achieve arbitrary desired step length successfully. In Figure 29, premature landing does not occur throughout the whole walking cycle. Hence, the relationship between (1) , , and , and (2) desired step length is learnt successfully.
In this paper, GAOFSF  is modified to ensure that trajectories generated are continuous in angular position and its first and second derivatives. Through simulations, bipedal robot with modified CPG model yields better dynamic balance. SaDE is firstly applied to search the parameters of CPG model of bipedal walking. Performance of modified CPG model searched by SaDE is found to be satisfactory. Four adjustable parameters (, , , and ) are added to modified CPG model and searched by SaDE. The robot is able to adjust its step length by simply changing these four factors. Instead of using look-up table , the relationship between (1) , , , and and (2) desired step length is successfully learnt. Simulation results show that the robot is able to walk with arbitrary desired step length within specific range (0 cm–5 cm). The desired joint angles can be obtained without the aid of inverse kinematics.
For more details see Figure 30.
|,,||Coefficients of truncated Fourier series|
|:||Mean crossover rate|
|:||Mean mutation rate|
|:||Height of swing foot|
|:||Desired height of swing foot|
|:||Height of ground|
|:||Mass of link|
|:||Velocity of trunk|
|:||Mean velocity of trunk|
|:||Velocity of swing foot at landing time|
|:||Natural frequency of hip and knee trajectory|
|:||Weighting factor of fitness functions/constraints|
|-Coordinate of CoM of link|
|-Coordinate of CoM of link|
|:||Linear acceleration in -direction at CoM of link|
|:||Linear acceleration in -direction at CoM of link|
|Scaling factor of truncated Fourier series|
|:||Hip/knee joint angle in sagittal plane|
|:||Degree of membership function|
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
The authors would like to thank the Department of Mechanical Engineering of The Hong Kong Polytechnic University for providing the research studentship.
- S. Kajita, F. Kanehiro, K. Kaneko et al., “Biped walking pattern generation by using preview control of zero-moment point,” in Proceedings of the IEEE International Conference on Robotics and Automation, pp. 1620–1626, September 2003.
- J.-Y. Kim, I.-W. Park, and J.-H. Oh, “Walking control algorithm of biped humanoid robot on uneven and inclined floor,” Journal of Intelligent and Robotic Systems, vol. 48, no. 4, pp. 457–484, 2007.
- K. Erbatur, O. Koca, E. Taşkiran, M. Yilmaz, and U. Seven, “ZMP based reference generation for biped walking robots,” World Academy of Science, Engineering and Technology, vol. 58, pp. 943–950, 2009.
- A. J. Ijspeert, “Central pattern generators for locomotion control in animals and robots: a review,” Neural Networks, vol. 21, no. 4, pp. 642–653, 2008.
- G. Taga, Y. Yamaguchi, and H. Shimizu, “Self-organized control of bipedal locomotion by neural oscillators in unpredictable environment,” Biological Cybernetics, vol. 65, no. 3, pp. 147–159, 1991.
- L. Yang, C.-M. Chew, T. Zielinska, and A.-N. Poo, “A uniform biped gait generator with offline optimization and online adjustable parameters,” Robotica, vol. 25, no. 5, pp. 549–565, 2007.
- N. Shafii, L. P. Reis, and N. Lau, “Biped walking using coronal and sagittal movements based on truncated Fourier series,” in Proceedings of 14th Annual Robo Cup International Symposium, pp. 324–335, 2010.
- E. Yazdi, V. Azizi, and A. T. Haghighat, “Evolution of biped locomotion using bees algorithm, based on truncated Fourier series,” in Proceedings of the World Congress on Engineering and Computer Science, pp. 378–382, 2010.
- J. Or, “A hybrid CPG-ZMP control system for stable walking of a simulated flexible spine humanoid robot,” Neural Networks, vol. 23, no. 3, pp. 452–460, 2010.
- S. Aoi and K. Tsuchiya, “Adaptive behavior in turning of an oscillator-driven biped robot,” Autonomous Robots, vol. 23, no. 1, pp. 37–57, 2007.
- Y. Farzaneh, A. Akbarzadeh, and A. A. Akbaria, “Online bio-inspired trajectory generation of seven-link biped robot based on T-S fuzzy system,” Applied Soft Computing, 2013.
- D. Gong, J. Yan, and G. Zuo, “A review of gait optimization based on evolutionary computation,” Applied Computational Intelligence and Soft Computing, vol. 2010, Article ID 413179, 12 pages, 2010.
- H. Inada and K. Ishii, “Bipedal walk using a central pattern generator,” in Proceedings of International Congress Series, pp. 185–188, 2004.
- K. Miyashita, S. Ok, and K. Hase, “Evolutionary generation of human-like bipedal locomotion,” Mechatronics, vol. 13, no. 8-9, pp. 791–807, 2003.
- R. Storn and K. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997.
- B. Hegery, C. C. Hung, and K. Kasprak, “A comparative study on differential evolution and genetic algorithms for some combinatorial problems,” in Proceedings of 8th Mexican International Conference on Artificial Intelligence, 2009.
- T. Tušar and B. Filipič, “Differential evolution versus genetic algorithms in multi-objective optimization,” in Proceedings of 4th International Conference on Evolutionary Multi-Criterion Optimization, 2007.
- J. Vesterstrøm and R. Thomsen, “A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), pp. 1980–1987, June 2004.
- A. K. Qin and P. N. Suganthan, “Self-adaptive differential evolution algorithm for numerical optimization,” in Proceedings of the IEEE Congress on Evolutionary Computation (IEEE CEC '05), pp. 1785–1791, September 2005.
- A. K. Qin, V. L. Huang, and P. N. Suganthan, “Differential evolution algorithm with strategy adaptation for global numerical optimization,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 2, pp. 398–417, 2009.
- M. G. H. Omran, A. Salman, and A. P. Engelbrecht, “Self-adaptive differential evolution,” in Proceedings of International Conference on Computational Intelligence and Security, pp. 192–199, 2005.
- J. Brest, S. Greiner, B. Bošković, M. Mernik, and V. Zumer, “Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 6, pp. 646–657, 2006.
- L. Yang, C.-M. Chew, and A.-N. Poo, “Real-time bipedal walking adjustment modes using truncated fourier series formulation,” in Proceedings of the 7th IEEE-RAS International Conference on Humanoid Robots (HUMANOIDS '07), pp. 379–384, December 2007.
- C. Hern ndez-Santos, E. Rodriguez-Leal, R. Soto, and J. L. Gordillo, “Kinematics and dynamics of a new 16DOF Humanoid biped robot with active toe joint,” International Journal of Advanced Robotic Systems, vol. 9, no. 190, 2012.
- K.-C. Choi, H.-J. Lee, and M. C. Lee, “Fuzzy posture control for biped walking robot based on force sensor for ZMP,” in Proceedings of the SICE-ICASE International Joint Conference, pp. 1185–1189, October 2006.
- D. Tlalolini, Y. Aoustin, and C. Chevallereau, “Design of a walking cyclic gait with single support phases and impacts for the locomotor system of a thirteen-link 3D biped using the parametric optimization,” Multibody System Dynamics, vol. 23, no. 1, pp. 33–56, 2010.
- A. P. Sudheer, R. Vijayakumar, and K. P. Mohanda, “Stable gait synthesis and analysis of a 12-degree of freedom biped robot in sagittal and frontal planes,” Journal of Automation, Mobile Robotics and Intelligent System, vol. 6, no. 4, pp. 36–44, 2012.
- J.-S. R. Jang, “ANFIS: adaptive-network-based fuzzy inference system,” IEEE Transactions on Systems, Man and Cybernetics, vol. 23, no. 3, pp. 665–685, 1993.
Copyright © 2014 H. F. Yu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.