Minimum-amplitude control of linear discrete systems
- 1 April 1974
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 19 (4) , 765-780
- https://doi.org/10.1080/00207177408932671
Abstract
This paper treats the problem of generating a minimum-amplitude control sequence which will drive a linear discrete system from some arbitrary initial state to a desired final state in a fixed number of control iterations. It is well known that this problem is equivalent to that of finding a minimum l ∞ normed solution to a set of under-determined linear equations (Cadzow 1071). With this in mind, an algorithmic procedure for finding such a solution is presented. This algorithm is developed by incorporating some elegant theorems from functional analysis. The resultant algorithm is computationally efficient and can be used in many real-time control applications, as is demonstrated by a specific example. Its computation efficiency is shown to easily exceed that of the linear programming algorithm used to find a minimum l ∞, norm solution.Keywords
This publication has 4 references indexed in Scilit:
- Algorithm for the minimum-effort problemIEEE Transactions on Automatic Control, 1971
- A solution of the discrete minimum-time control problemJournal of Optimization Theory and Applications, 1970
- A minimal time discrete systemIRE Transactions on Automatic Control, 1961
- Solution Space Approach to Optimal Control ProblemsJournal of Basic Engineering, 1961