For linear systems with purely imaginary eigenvalues, the number of switching points in time-optimal controls is bounded from below by a linear function of the time interval length in the generic case.
An application of the mean motion problem to time-optimal control
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We consider time-optimal controls of a controllable linear system with a scalar control on a long time interval. It is well-known that if all the eigenvalues of the matrix describing the linear system dynamics are real then any time-optimal control has a bounded number of switching points, where the bound does not depend on the length of the time interval. We consider the case where the governing matrix has purely imaginary eigenvalues, and show that then, in the generic case, the number of switching points is bounded from below by a linear function of the length of the time interval. The proof is based on relating the switching function in the optimal control problem to the mean motion problem that dates back to Lagrange and was solved by Hermann Weyl.
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An application of the mean motion problem to time-optimal control
For linear systems with purely imaginary eigenvalues, the number of switching points in time-optimal controls is bounded from below by a linear function of the time interval length in the generic case.