Robust linear programming and optimal control

24Citations
Citations of this article
50Readers
Mendeley users who have this article in their library.

Your institution provides access to this article.

Abstract

The paper describes an efficient method for solving an optimal control problem that arises in robust model-predictive control. The problem is to design the input sequence that minimizes the peak tracking error between the ouput of a linear dynamical system and a desired target output, subject to inequality constraints on the inputs. The system is uncertain, with an impulse response that can take arbitrary values in a given polyhedral set. This problem can be formulated as a robust linear programming problem with structured uncertainty. The presented method is based on Mehrotra's interior-point method for linear programming, and takes advantage of the problem structure to achieve a complexity that grows linearly with the control horizon, and increases as a cubic polynomial as a function of the system order, the number of inputs, and the number of uncertainty parameters.

Cite

CITATION STYLE

APA

Vandenberghe, L., Boyd, S., & Nouralishahi, M. (2002). Robust linear programming and optimal control. In IFAC Proceedings Volumes (IFAC-PapersOnline) (Vol. 15, pp. 271–276). IFAC Secretariat. https://doi.org/10.3182/20020721-6-es-1901.00295

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free