期刊文献+

一种求解Riccati矩阵代数方程的改进遗传算法 被引量:1

Solving Riccati Matrix Algebraic Equation with a Improved Genetic Algorithm
在线阅读 下载PDF
导出
摘要 本文针对目前求解Riccati矩阵代数方程时存在鲁棒性差,对高维问题求解结果耗时多,结果差的缺点,提出了一种改进型遗传算法来匹配Riccati矩阵代数方程最佳解阵P*的新方法。改进型遗传算法通过检测种群熵S值的变化可以及时发现早熟现象,并定义基因熵G有导向地对种群进行变异操作,使当前搜索跳出早熟,不断向全局最优解收敛。对单级倒立摆控制系统最优控制问题的求解实例表明,改进型遗传算法比基本遗传算法具有更好的寻优性能,求解结果P对应得最优指标J与Matlab中LQR函数所求结果的误差仅为0.3%,但其耗时更少。这表明改进型遗传算法为Riccati矩阵代数方程的求解提供了一种高效鲁棒的方法,尤其是对高维P*的求解更具有工程意义。 This paper proposes an improved genetic algorithm to match the optimal solution P" of the Riccati matrix algebraic equation. This new method overcomes the shortcomings such as lack of robustness, high time-consuming and imprecise, which generally exist in many solution methods at present. The improved genetic algorithm have the ability to discover and handle the premature successfully and converge to the global optimal solution continually through detecting the value change of population entropy S and mutating the population oriented by the new defined gene entropy G. The application to solve the optimal control on single-stage inverted pendulum indicate that the improved genetic algorithm has better optimization performance than the basic genetic algorithm, and the optimal index J deduced from P compared with that given by LQR function in Madab only have O. 3 percent error, but have less tlme-consuruing. This shows that the improved genetic algorithm offers a robust and efficient method to solve Riccati matrix algebraic equation, especially have more engineering significance for solving the high-dimension P.
作者 李瑾 张常力
出处 《现代机械》 2011年第5期36-39,51,共5页 Modern Machinery
关键词 遗传算法 均匀设计 种群熵S 基因熵G Riccati矩阵方程 genetic algorithm uniform design population entropy S gene entropy G Riccati matrix equation
  • 相关文献

参考文献5

二级参考文献22

  • 1钟万勰.矩阵黎卡提方程的精细积分法[J].计算结构力学及其应用,1994,11(2):113-119. 被引量:29
  • 2钟万勰,弹性力学求解新体系,1995年,263页
  • 3Zhong Wanxie,Proc WCCM 3 Vol I,1994年,131页
  • 4钟万勰,计算结构力学与最优控制,1993年,269页
  • 5郑大钟,线性系统理论,1990年,180页
  • 6Chang Wook Ahn, R.S.Ramakrishna. A genetic algorithm for shortest path routing problem and the sizing of populations[J].IEEE Transactions on Evolutionary Computation, 2002,6 (6):566-579.
  • 7Chien-ying Lu, Jos6 G. Delgado-frias, Wei Lin. A clustering and genetic scheme for large TSP optimization problems[J].Cybernetics and Systems, 1998,29(2):137-157.
  • 8Salomon. R. Evolutionary algorithms and gradient search: similarities and differences [J]. IEEE Transactions on Evolutionary Computation, 1998,2 (2):45 - 55.
  • 9Jiao Licheng, Wang Lei. A novel genetic algorithm based on immunity[J]. IEEE Transactions on Systems, Man, and Cybernetics-Part A : Systems and Humans, 2000,30 (5):552 - 561.
  • 10Ignacio Rojas, Jesus Gonzalez, Hector Pomares, et al. Statistical analysis of the main parameters involved in the design of a genetic algorithm [J]. IEEE Transactions on Systems, Man, and Cybernetics-Part C: Application and Reviews,2002,32(1):31-37.

共引文献37

同被引文献14

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部