Minimum-effort time-optimal control of linear discrete systems†
- 1 February 1975
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 21 (2) , 293-304
- https://doi.org/10.1080/00207177508921988
Abstract
An iterative algorithm based on linear programming for solving the minimum-time minimum-effort discrete control problem for linear time-invariant systems is presented. The algorithm is based on transforming the minimum-effort problem to an equivalent linear programming one. Some interesting properties of the iterative linear programming algorithm are shown which result in reducing the computational time and storage memory required. Numerical examples are provided to indicate the efficiency of the proposed method.Keywords
This publication has 7 references indexed in Scilit:
- A simplex algorithm for on-line computation of time optimal controlsIEEE Transactions on Automatic Control, 1971
- Algorithm for the minimum-effort problemIEEE Transactions on Automatic Control, 1971
- Determination of reachable set for a linear discrete systemIEEE Transactions on Automatic Control, 1970
- A solution of the discrete minimum-time control problemJournal of Optimization Theory and Applications, 1970
- Optimization of discrete control systems through linear programmingJournal of the Franklin Institute, 1964
- On optimal control and linear programmingIRE Transactions on Automatic Control, 1962
- The minimal time regulator problem for linear sampled-data systems: General theoryJournal of the Franklin Institute, 1961