论文信息 - First-order strong variation algorithms for optimal control problems with terminal inequality constraints

First-order strong variation algorithms for optimal control problems with terminal inequality constraints

This paper presents eight algorithms for solving optimal control problems with general constraints on the control and inequality constraints on the terminal state. These algorithms are of the differential dynamic programming type and bear a strong kinship to nonlinear programming algorithms of the feasible direction type.

D. Mayne | E. Polak

[1] G. Zoutendijk,et al. Methods of Feasible Directions , 1962, The Mathematical Gazette.

[2] E. Polak,et al. Computational methods in optimization : a unified approach , 1972 .

[3] David Q. Mayne,et al. Differential dynamic programming , 1972, The Mathematical Gazette.

[4] E. Polak. An historical survey of computational methods in optimal control. , 1973 .

[5] E. Polak,et al. A Dual Method for Optimal Control Problems with Initial and Final Boundary Constraints , 1973 .

[6] R. Klessig. A General Theory of Convergence for Constrained Optimization Algorithms that Use Antizigzagging Provisions , 1974 .

[7] D. Mayne,et al. First-order strong variation algorithms for optimal control , 1975 .