skip to main content

Search for: All records

Creators/Authors contains: "Kolmanovsky, Ilya"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Free, publicly-accessible full text available January 1, 2024
  2. Free, publicly-accessible full text available November 1, 2023
  3. Free, publicly-accessible full text available August 23, 2023
  4. Free, publicly-accessible full text available August 1, 2023
  5. Free, publicly-accessible full text available August 1, 2023
  6. Free, publicly-accessible full text available August 1, 2023
  7. Free, publicly-accessible full text available August 1, 2023
  8. Free, publicly-accessible full text available July 1, 2023
  9. This paper introduces a computationally efficient approach for solving Model Predictive Control (MPC) reference tracking problems with state and control constraints. The approach consists of three key components: First, a log-domain interior-point quadratic programming method that forms the basis of the overall approach; second, a method of warm-starting this optimizer by using the MPC solution from the previous timestep; and third, a computational governor that bounds the suboptimality of the warm-start by altering the reference command provided to the MPC problem. As a result, the closed-loop system is altered in a manner so that MPC solutions can be computed using fewer optimizer iterations per timestep. In a numerical experiment, the computational governor reduces the worst-case computation time of a standard MPC implementation by 90%, while maintaining good closed-loop performance.