Robust optimal control of linear discrete-time systems using primal-dual interior-point methods

被引:0
|
作者
Hansson, A [1 ]
Boyd, S [1 ]
机构
[1] Stanford Univ, Informat Syst Lab, Stanford, CA 94305 USA
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper is described how to efficiently solve a robust optimal control problem using recently developed primal-dual interior-point methods. Among potential applications are model predictive control. The optimization problem considered consists of a worst case quadratic performance criterion over a finite set of linear discrete-time models subject to inequality constraints on the states and control signals. The scheme has been prototyped in Matlab. To give a rough idea of the efficiencies obtained, it is possible to solve problems with more than 1000 variables and 5000 constraints in a few minutes on a workstation.
引用
收藏
页码:183 / 187
页数:5
相关论文
共 50 条