Clipping-off gradient algorithms to compute optimal controls with constrained magnitude
- 1 August 1974
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 20 (2) , 243-255
- https://doi.org/10.1080/00207177408932734
Abstract
This paper presents a clipping-off technique which, when used in association with gradient methods in function space, can be used to solve non-linear optima control problems with magnitude constraint on the control inputs. The proposed clipping-off gradient algorithms are simple to implement on a digital computer and preserve the large range of convergence of first-variational methods. Several numerical examples are included, one of which contains two state-variable inequality constraints and a magnitude constraint on the control inputKeywords
This publication has 5 references indexed in Scilit:
- A numerical method for solving optimal control problems with unspecified terminal time†International Journal of Control, 1973
- Differential dynamic programming methods for solving bang-bang control problemsIEEE Transactions on Automatic Control, 1968
- The conjugate gradient method for optimal control problems with bounded control variablesAutomatica, 1968
- The conjugate gradient method for optimal control problemsIEEE Transactions on Automatic Control, 1967
- An Automatic Method for Finding the Greatest or Least Value of a FunctionThe Computer Journal, 1960