Solving Optimal Control and Pursuit-Evasion Game Problems of High Complexity
AbstractOptimal control problems which describe realistic technical applications exhibit various features of complexity. First, the consideration of inequality constraints leads to optimal solutions with highly complex switching structures including bang-bang, singular, and control- and state-constrained subarcs. In addition, also isolated boundary points may occur. Techniques are surveyed for the computation of optimal trajectories with multiple subarcs. If the precise computation of the switching structure holds the spotlight, the indirect multiple shooting method is top quality. Second, the differential equations describing the dynamics may be so complicated that they have to be generated by a computer program. In this case, direct methods such as direct collocation are generally superior. Third, the task is often given in applications to solve many optimal control problems, either for parameter homotopies in the course of the solution process itself or for sensitivity investigations of the..