An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector w...An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals＇ feature vector.Additionally,a local search（LS） process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms.展开更多
An advanced Gauss pseudospectral method(AGPM) was proposed to estimate the parameters of the continuous-time(CT)Hammerstein model.The nonlinear part of the Hammerstein system is approximated with pseudospectral approx...An advanced Gauss pseudospectral method(AGPM) was proposed to estimate the parameters of the continuous-time(CT)Hammerstein model.The nonlinear part of the Hammerstein system is approximated with pseudospectral approximation method.The linear part was written as a controllable canonical form to circumvent the high order time-derivative of the input and output(I/O) signals,which could multiply the measurement noise in the identification procession.Furthermore,an output error minimization was constructed for the CT Hammerstein model identification,which was then transcribed into a nonlinear programming(NLP) problem by AGPM.AGPM could converge to the true values of the CT Hammerstein model with few interpolated Legendre-Gauss(LG) nodes.Lastly,two illustrative examples were proposed to verify the accuracy and efficiency of the method.展开更多
In this paper we study optimal control problems with the control variable appearing linearly. A novel method for optimization with respect to the switching times of controls containing both bang-bang and singular arcs...In this paper we study optimal control problems with the control variable appearing linearly. A novel method for optimization with respect to the switching times of controls containing both bang-bang and singular arcs is presented. This method transforms the control problem into a finite-dimensional optimization problem by reformulating the control problem as a multi-stage optimization problem. The optimal control problem is partitioned as several stages, with each stage corresponding to a particular control arc. A control vector parameterization approach is applied to convert the control problem to a static nonlinear programming （NLP） problem. The control profiles and stage lengths act as decision variables. Based on the Pontryagin maximal principle, a multi-stage adjoint system is constructed to calculate the gradients required by the NLP solvers. Two examples are studied to demonstrate the effectiveness of this strategy.展开更多
基金supported by the National Natural Science Foundation of China (60632050)National Basic Research Program of Jiangsu Province University (08KJB520003)
文摘An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals＇ feature vector.Additionally,a local search（LS） process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms.
文摘An advanced Gauss pseudospectral method(AGPM) was proposed to estimate the parameters of the continuous-time(CT)Hammerstein model.The nonlinear part of the Hammerstein system is approximated with pseudospectral approximation method.The linear part was written as a controllable canonical form to circumvent the high order time-derivative of the input and output(I/O) signals,which could multiply the measurement noise in the identification procession.Furthermore,an output error minimization was constructed for the CT Hammerstein model identification,which was then transcribed into a nonlinear programming(NLP) problem by AGPM.AGPM could converge to the true values of the CT Hammerstein model with few interpolated Legendre-Gauss(LG) nodes.Lastly,two illustrative examples were proposed to verify the accuracy and efficiency of the method.
基金supported by the Natural Science Foundation of China(No.60974039)the National Science and Technology Major Project(No. 2008ZX05011)
文摘In this paper we study optimal control problems with the control variable appearing linearly. A novel method for optimization with respect to the switching times of controls containing both bang-bang and singular arcs is presented. This method transforms the control problem into a finite-dimensional optimization problem by reformulating the control problem as a multi-stage optimization problem. The optimal control problem is partitioned as several stages, with each stage corresponding to a particular control arc. A control vector parameterization approach is applied to convert the control problem to a static nonlinear programming （NLP） problem. The control profiles and stage lengths act as decision variables. Based on the Pontryagin maximal principle, a multi-stage adjoint system is constructed to calculate the gradients required by the NLP solvers. Two examples are studied to demonstrate the effectiveness of this strategy.
