首页 | 本学科首页   官方微博 | 高级检索  
     检索      

分段线性微分包含系统的最优控制设计
引用本文:张建雄,唐万生.分段线性微分包含系统的最优控制设计[J].系统工程学报,2006,21(4):341-346.
作者姓名:张建雄  唐万生
作者单位:天津大学系统工程研究所,天津,300072
基金项目:国家自然科学基金资助项目(70471049)
摘    要:针对分段线性微分包含系统,根据Hamilton-Jacobi-Bellman(H-J-B)不等式将最优控制设计问题转化成最优控制性能上界的优化问题及性能下界的求取问题.其中性能上界的优化是一组以反馈增益为寻优参数的双线性矩阵不等式(bilinear matrix inequalities,BMI)问题,而性能下界是一组基于线性矩阵不等式(linear matrixinequalities,LMI)的半正定规划问题.结合遗传算法和内点法设计了一种混合算法对BMI问题进行求解.算例表明方法的有效性.

关 键 词:分段线性微分包含系统  最优控制  双线性矩阵不等式  内点法  遗传算法
文章编号:1000-5781(2006)04-0341-06
收稿时间:2004-09-13
修稿时间:2004-09-132006-04-27

Optimal control of piecewise linear differential inclusions
ZHANG Jian-xiong,TANG Wan-sheng.Optimal control of piecewise linear differential inclusions[J].Journal of Systems Engineering,2006,21(4):341-346.
Authors:ZHANG Jian-xiong  TANG Wan-sheng
Institution:Institute of Systems Engineering, Tianjin University, Tianjin 300072, China
Abstract:Based on Hamilton-Jacobi-Bellman inequalities,the optimal control of piecewise linear differential inclusions is converted to the problem of seeking upper and lower bounds of the cost function.The design of upper bound can be cast as a bilinear matrix inequalities(BMI) problem in which the feedback gain is a set of optimization parameters,and the lower bound computation can be solved as a semidefinite programming problem based on linear matrix inequalities(LMI).A mixed algorithm that combines genetic algorithm and interior-point method is designed to solve the BMI problem.The results from numerical examples illustrate the effectiveness of the proposed method.
Keywords:piecewise linear differential inclusions  optimal control  bilinear matrix inequalities  interior-point algorithm  genetic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号