Desensitizing algorithms for state-restrained optimal control assessments
- 1 March 1975
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 21 (3) , 353-373
- https://doi.org/10.1080/00207177508921995
Abstract
An examination of the structure of the optimal control problem with hard state restraints indicates that problem sensitivity presents the principal difficulty to solution convergence in algorithm design. A design philosophy based on problem sensitivity and comprising a set. of arbitrarily chosen desensitizing algorithms is successfully applied to an illustrative example of state restrained optimal control. A full sensitivity analysis indicates the scope for application of the specimen desensitizing algorithms presented.Keywords
This publication has 8 references indexed in Scilit:
- A graphical approach to the analysis of linear dynamic systemsInternational Journal of Systems Science, 1973
- Search speed control strategies for the solution of optimal control problemsInternational Journal of Control, 1972
- Fast Hybrid Computer Implementation of the Dynostat AlgorithmIEEE Transactions on Computers, 1972
- Balance function for the optimal control problemJournal of Optimization Theory and Applications, 1971
- Mathematical solution of the problem of optimal control of integrated power systems with generalized maximum principle†International Journal of Control, 1971
- An iterative algorithm for optimum control problems with inequality constraintsIEEE Transactions on Automatic Control, 1969
- A transformation technique for optimal control problems with a state variable inequality constraintIEEE Transactions on Automatic Control, 1969
- OPTIMAL PROGRAMMING PROBLEMS WITH INEQUALITY CONSTRAINTSAIAA Journal, 1963