Linear Quadratic Optimal Control Via Fourier-Based State Parameterization

1991 ◽  
Vol 113 (2) ◽  
pp. 206-215 ◽  
Author(s):  
V. Yen ◽  
M. Nagurka

A method for determining the optimal control of unconstrained and linearly constrained linear dynamic systems with quadratic performance indices is presented. The method is based on a modified Fourier series approximation of each state variable that converts the linear quadratic (LQ) problem into a mathematical programming problem. In particular, it is shown that an unconstrained LQ problem can be cast as an unconstrained quadratic programming problem where the necessary condition of optimality is derived as a system of linear algebraic equations. Furthermore, it is shown that a linearly constrained LQ problem can be converted into a general quadratic programming problem. Simulation studies for constrained LQ systems, including a bang-bang control problem, demonstrate that the approach is accurate. The results also indicate that in solving high order unconstrained LQ problems the approach is computationally more efficient and robust than standard methods.

Author(s):  
Yuefen Chen ◽  
◽  
Liubao Deng ◽  

This paper deals with a discrete-time uncertain linear quadratic (LQ) optimal control, where the control weight costs are indefinite . Based on Bellman’s principle of optimality, the recurrence equation of the uncertain LQ optimal control is proposed. Then, by using the recurrence equation, a necessary condition of the optimal state feedback control for the LQ problem is obtained. Moreover, a sufficient condition of well-posedness for the LQ problem is presented. Furthermore, an algorithm to compute the optimal control and optimal value is provided. Finally, a numerical example to illustrate that the LQ problem is still well-posedness with indefinite control weight costs.


1967 ◽  
Vol 7 (2) ◽  
pp. 349-355
Author(s):  
R. Jasilionis

The abstracts (in two languages) can be found in the pdf file of the article. Original author name(s) and title in Russian and Lithuanian: Р. Ю. Ясилионис. Связь сложных задач математического программированы? с задачами квадратичного программирования R. Jasilionis. Sudėtingų matematinio programavimo uždavinių ryšys su kvadratinio programavimo uždaviniais


1993 ◽  
Vol 115 (1) ◽  
pp. 1-6 ◽  
Author(s):  
M. L. Nagurka ◽  
S.-K. Wang

A computationally attractive method for determining the optimal control of unconstrained linear dynamic systems with quadratic performance indices is presented. In the proposed method, the difference between each state variable and its initial condition is represented by a finite-term shifted Chebyshev series. The representation leads to a system of linear algebraic equations as the necessary condition of optimality. Simulation studies demonstrate computational advantages relative to a standard Riccati-based method, a transition matrix method, and a previous Fourier-based method.


Sign in / Sign up

Export Citation Format

Share Document