A neighboring extremal solution for optimal switched impulsive control problems with large perturbations
Access Status
Authors
Date
2012Type
Metadata
Show full item recordCitation
Source Title
Additional URLs
ISSN
Collection
Abstract
This paper presents an approach to compute the neighboring extremal solution for an optimal switched impulsive control problem with a pre-specified sequence of modes and a large perturbation in the initial state. The decision variables - the subsystem switching times and the control parameters - are subject to inequality constraints. Since the active status of these inequality constraints may change under the large perturbation, we add fractions of the initial perturbation separately such that the active status of the inequality constraints is invariant during each step, and compute the neighboring extremal solution iteratively by solving a sequence of quadratic programming problems. First, we compute a correction direction for the control in the perturbed system through an extended backward sweep technique. Then, we compute the maximal step size in this direction and derive the solution iteratively by using a revised active set strategy. An example problem involving a shrimp harvesting operation demonstrates that our solution approach is faster than the sequential quadratic programming approach.
Related items
Showing items related by title, author, creator and subject.
-
Li, Bin (2011)In this thesis, we consider several types of optimal control problems with constraints on the state and control variables. These problems have many engineering applications. Our aim is to develop efficient numerical methods ...
-
Ruan, Ning (2012)Duality is one of the most successful ideas in modern science [46] [91]. It is essential in natural phenomena, particularly, in physics and mathematics [39] [94] [96]. In this thesis, we consider the canonical duality ...
-
Loxton, Ryan Christopher (2010)In this thesis, we develop numerical methods for solving five nonstandard optimal control problems. The main idea of each method is to reformulate the optimal control problem as, or approximate it by, a nonlinear programming ...