The Direct Shooting Method is a Complete Method

Abstract

The direct shooting method is a classic approach for the solution of Optimal Control Problems (OCPs). It parameterizes the control variables and transforms the OCP to the Nonlinear Programming (NLP) problem to solve. This method is easy to use and it often introduces less parameters compared with all-variable parameterization method like the Pseudo-spectral (PS) method. However, it is long believed that its solution is not guaranteed to satisfy the optimality conditions of the OCP and the costates are not available in using this method. In this paper, we show that the direct shooting method may also provide the costate information, and it is proved that both the state and the costate solutions converge to the optimal as long as the control variable tends to the optimal, while the parameterized control may approach the optimal control with reasonable parameterization. This gives us the credit for the optimal control computation when employing the direct shooting method.

References in corpus (9)

• Variation Evolving for Optimal Control Computation, a Compact Way
• Computation of Optimal Control Problems with Terminal Constraint via Variation Evolution
• On the Computation of Optimal Control Problems with Terminal Inequality Constraint via Variation Evolution
• Optimal Control Computation via Evolution Partial Differential Equation with Arbitrary Definite Conditions
• Computation of time-optimal control problem with variation evolution principle
• Computation of Optimal Control Problems with Terminal Constraint via Modified Evolution Partial Differential Equation
• Solve the General Constrained Optimal Control Problem with Common Integration Method
• Transform the Non-linear Programming Problem to the Initial-value Problem to Solve
• The Third Evolution Equation for Optimal Control Computation