A New Run Algorithm for Solving the Continuous Linear-Quadratic Optimal Control Problem with Unseparated Boundary Conditions
A sweep method is proposed for solving the optimal control problem with unseparated boundary conditions. This model reduces the boundary conditions to the initial condition. Using the properties of the J -symmetry of the corresponding Hamiltonian matrix and Euler–Lagrange equations, it is shown that...
Saved in:
| Published in | Journal of computer & systems sciences international Vol. 60; no. 1; pp. 48 - 55 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
Moscow
Pleiades Publishing
01.01.2021
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1064-2307 1555-6530 |
| DOI | 10.1134/S1064230721010020 |
Cover
| Summary: | A sweep method is proposed for solving the optimal control problem with unseparated boundary conditions. This model reduces the boundary conditions to the initial condition. Using the properties of the
J
-symmetry of the corresponding Hamiltonian matrix and Euler–Lagrange equations, it is shown that linear algebraic equations for determining the missing initial data of the system being solved have a symmetric matrix of coefficients. The proposed algorithm allows us to reduce the dimension of the problem of finding the fundamental matrix of the Hamiltonian system. The results are illustrated by the example of a linear-quadratic optimal control problem (stationary case) with the minimal control actions. |
|---|---|
| ISSN: | 1064-2307 1555-6530 |
| DOI: | 10.1134/S1064230721010020 |