This paper briefly reviews the literature on necessary optimality conditions for optimal control problems with state-variable inequality constraints. Then, it attempts to unify the treatment of linear optimal control problems with state variable inequality constraints in the framework of continuous linear programming. The duality theory in this framework makes it possible to relate the adjoint variables arising in different formulations of a problem; these relationships are illustrated by the use of a simple example. This framework also allows more general problems and admits a simplex-like algorithm to solve these problems.
The report deals with theoretical and computational aspects or optimal control problems with state variable inequality constraints. The computational methods developed here solve bounded state variable problems by searching the constraint surface (or boundary) for the optimal junction point between the subarc on the boundary and the unconstrained subarc. The results obtained for the bounded state variables problem are extended to problems with discontinuous state variable and/or discontinuous differential equations. (Author).
Optimal Impulsive Control explores the class of impulsive dynamic optimization problems—problems that stem from the fact that many conventional optimal control problems do not have a solution in the classical setting—which is highly relevant with regard to engineering applications. The absence of a classical solution naturally invokes the so-called extension, or relaxation, of a problem, and leads to the notion of generalized solution which encompasses the notions of generalized control and trajectory; in this book several extensions of optimal control problems are considered within the framework of optimal impulsive control theory. In this framework, the feasible arcs are permitted to have jumps, while the conventional absolutely continuous trajectories may fail to exist. The authors draw together various types of their own results, centered on the necessary conditions of optimality in the form of Pontryagin’s maximum principle and the existence theorems, which shape a substantial body of optimal impulsive control theory. At the same time, they present optimal impulsive control theory in a unified framework, introducing the different paradigmatic problems in increasing order of complexity. The rationale underlying the book involves addressing extensions increasing in complexity from the simplest case provided by linear control systems and ending with the most general case of a totally nonlinear differential control system with state constraints. The mathematical models presented in Optimal Impulsive Control being encountered in various engineering applications, this book will be of interest to both academic researchers and practising engineers.
The topic for this thesis is the state-variable inequality constrainted optimal control problem. The problem is formulated as a standard optimal control problem with one additional constraint of the form S(x(t)) or = 0. This constraint is assumed to be of p-th order where p is an integer and p or = 1. In particular, the p-th time derivative of the constraint is the first to contain the control variable explicity.
Infinite-dimensional linear programs; Algebraic fundamentals; Topology and duality. Semi-infinite linear programs; The mass-transfer problem; Maximal flow in a dynamic network; Continuous linear programs; Other infinite linear programs; Index.
This book provides a series of systematic theoretical results and numerical solution algorithms for dynamic optimization problems of switched systems within infinite-dimensional inequality path constraints. Dynamic optimization of path-constrained switched systems is a challenging task due to the complexity from seeking the best combinatorial optimization among the system input, switch times and switching sequences. Meanwhile, to ensure safety and guarantee product quality, path constraints are required to be rigorously satisfied (i.e., at an infinite number of time points) within a finite number of iterations. Several novel methodologies are presented by using dynamic optimization and semi-infinite programming techniques. The core advantages of our new approaches lie in two folds: i) The system input, switch times and the switching sequence can be optimized simultaneously. ii) The proposed algorithms terminate within finite iterations while coming with a certification of feasibility for the path constraints. In this book, first, we provide brief surveys on dynamic optimization of path-constrained systems and switched systems. For switched systems with a fixed switching sequence, we propose a bi-level algorithm, in which the input is optimized at the inner level, and the switch times are updated at the outer level by using the gradient information of the optimal value function calculated at the optimal input. We then propose an efficient single-level algorithm by optimizing the input and switch times simultaneously, which greatly reduces the number of nonlinear programs and the computational burden. For switched systems with free switching sequences, we propose a solution framework for dynamic optimization of path-constrained switched systems by employing the variant 2 of generalized Benders decomposition technique. In this framework, we adopt two different system formulations in the primal and master problem construction and explicitly characterize the switching sequences by introducing a binary variable. Finally, we propose a multi-objective dynamic optimization algorithm for locating approximated local Pareto solutions and quantitatively analyze the approximation optimality of the obtained solutions. This book provides a unified framework of dynamic optimization of path-constrained switched systems. It can therefore serve as a useful book for researchers and graduate students who are interested in knowing the state of the art of dynamic optimization of switched systems, as well as recent advances in path-constrained optimization problems. It is a useful source of up-to-date optimization methods and algorithms for researchers who study switched systems and graduate students of control theory and control engineering. In addition, it is also a useful source for engineers who work in the control and optimization fields such as robotics, chemical engineering and industrial processes.
