Affiliation:
1. Department of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon 34141, Republic of Korea
Abstract
The objective of this paper is to investigate a multi-objective linear quadratic Gaussian (LQG) control problem. Specifically, we examine an optimal control problem that minimizes a quadratic cost over a finite time horizon for linear stochastic systems subject to control energy constraints. To tackle this problem, we propose an efficient bisection line search algorithm that outperforms other approaches such as semidefinite programming in terms of computational efficiency. The primary idea behind our algorithm is to use the Lagrangian function and Karush–Kuhn–Tucker (KKT) optimality conditions to address the constrained optimization problem. The bisection line search is employed to search for the Lagrange multiplier. Furthermore, we provide numerical examples to illustrate the efficacy of our proposed methods.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference35 articles.
1. Bertsekas, D.P., and Tsitsiklis, J.N. (1996). Neuro-Dynamic Programming, Athena Scientific.
2. Bertsekas, D.P. (2005). Dynamic Programming and Optimal Control, Athena Scientific. [3rd ed.].
3. Convergence of Dynamic Programming on the Semidefinite Cone for Discrete-Time Infinite-Horizon LQR;Lee;IEEE Trans. Autom. Control,2022
4. Fibonacci wavelets and Galerkin method to investigate fractional optimal control problems with bibliometric analysis;Sabermahani;J. Vib. Control,2021
5. Boyd, S., and Vandenberghe, L. (2004). Convex Optimization, Cambridge University Press.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献