Global optimization of hybrid systems

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Chemical Engineering, 2006.Includes bibliographical references (p. 339-353).Systems that exhibit both discrete state and continuous state dynamics are called hybrid systems. In most nontrivial cases, these two aspects of system behavior interact to such a significant extent that they cannot be decoupled effectively by any kind of abstraction and must be analyzed simultaneously. Hybrid system models are important in many areas of science and engineering, including flip-flops and latching relays, manufacturing systems, air-traffic management systems, controller synthesis, switched systems, chemical process systems, signaling and decision making mechanisms in (biological) cells, robotic systems, safety interlock systems, and embedded systems. The primary focus of this thesis is to explore deterministic methods for the global optimization of hybrid systems. While the areas of modeling, simulation and sensitivity analysis of hybrid systems have received much attention, there are many challenging difficulties associated with the optimization of such systems. The contents of this thesis represent the first steps toward deterministic global optimization of hybrid systems in the continuous time domain. There are various reasons for wanting to solve optimization problems globally.(cont.) In particular, there are many applications which demand that the global solution be found, for example, formal safety verification problems and parameter estimation problems. In the former case, a suboptimal local solution could falsely indicate that all safety specifications are met, leading to disastrous consequences if, in actuality, a global solution exists which provides a counter example that violates some safety specification. In the latter case, a suboptimal local solution could falsely indicate that a proposed model structure did not match experimental data in a statistically significant manner, leading to the false rejection of a valid model structure. In addition, for many optimization problems in engineering, the presence of nonlinear equality constraints makes the optimization problem nonconvex such that local optimization methods can often fail to produce a single feasible point, even though the problem is indeed feasible. The control parameterization framework is employed for the solution of the optimization problem with continuous time hybrid systems embedded. A major difficulty of such a framework lies in the fact that the mode sequence of the embedded hybrid system changes in the space of the optimization decision variables for most nontrivial problems.(cont.) This makes the resulting optimization problem nonsmooth because the parametric sensitivities of the hybrid system do not exist everywhere, thus invalidating efficient gradient based optimization solvers. In this thesis, the general optimization problem is decomposed into three subproblems, and tackled individually: (a) when the mode sequence is fixed, and the transition times are fixed; (b) when the mode sequence is allowed to vary, and the transition times are fixed; and (c) when the mode sequence is fixed, and the transition times are allowed to vary. Because even these subproblems are nontrivial to solve, this thesis focuses on hybrid systems with linear time varying ordinary differential equations describing the continuous dynamics, and proposes various methods to exploit the linear structure. However, in the course of solving the last subproblem, a convexity theory for general, nonlinear hybrid systems is developed, which can be easily extended for general, nonlinear hybrid systems. Subproblem (a) is the easiest to solve. A convexity theory is presented that allows convex relaxations of general, nonconvex Bolza type functions to be constructed for the optimization problem. This allows a deterministic branch-and-bound framework to be employed for the global optimization of the subproblem.(cont.) Subproblems (b) and (c) are much more difficult to solve, and require the exploitation of structure. For subproblem (b), a hybrid superstructure is proposed that enables the linear structure to be retained. A branch-and-cut framework with a novel dynamic bounds tightening heuristic is proposed, and it is shown that the generation of cuts from dynamic bounds tightening can have a dramatic impact on the solution of the problem. For subproblem (c), a time transformation is employed to transform the problem into one with fixed transition times, but nonlinear dynamics. A convexity theory is developed for constructing convex relaxations of general, nonconvex Bolza type functions with the nonlinear hybrid system embedded, along with the development of bounding methods, based on the theory of differential inequalities. A novel bounding technique that exploits the time transformation is also introduced, which can provide much tighter bounds than that furnished utilizing differential inequalities.by Cha Kun Lee.Ph.D

Robust Stability Analysis of Nonlinear Hybrid Systems

We present a methodology for robust stability analysis of nonlinear hybrid systems, through the algorithmic construction of polynomial and piecewise polynomial Lyapunov-like functions using convex optimization and in particular the sum of squares decomposition of multivariate polynomials. Several improvements compared to previous approaches are discussed, such as treating in a unified way polynomial switching surfaces and robust stability analysis for nonlinear hybrid systems

Hybrid Evolutionary Shape Manipulation for Efficient Hull Form Design Optimisation

‘Eco-friendly shipping’ and fuel efficiency are gaining much attention in the maritime industry due to increasingly stringent environmental regulations and volatile fuel prices. The shape of hull affects the overall performance in efficiency and stability of ships. Despite the advantages of simulation-based design, the application of a formal optimisation process in actual ship design work is limited. A hybrid approach which integrates a morphing technique into a multi-objective genetic algorithm to automate and optimise the hull form design is developed. It is envisioned that the proposed hybrid approach will improve the hydrodynamic performance as well as overall efficiency of the design process

Optimization by Quantum Annealing: Lessons from hard 3-SAT cases

The Path Integral Monte Carlo simulated Quantum Annealing algorithm is applied to the optimization of a large hard instance of the Random 3-SAT Problem (N=10000). The dynamical behavior of the quantum and the classical annealing are compared, showing important qualitative differences in the way of exploring the complex energy landscape of the combinatorial optimization problem. At variance with the results obtained for the Ising spin glass and for the Traveling Salesman Problem, in the present case the linear-schedule Quantum Annealing performance is definitely worse than Classical Annealing. Nevertheless, a quantum cooling protocol based on field-cycling and able to outperform standard classical simulated annealing over short time scales is introduced.Comment: 10 pages, 6 figures, submitted to PR

Distributive Power Control Algorithm for Multicarrier Interference Network over Time-Varying Fading Channels - Tracking Performance Analysis and Optimization

Distributed power control over interference limited network has received an increasing intensity of interest over the past few years. Distributed solutions (like the iterative water-filling, gradient projection, etc.) have been intensively investigated under \emph{quasi-static} channels. However, as such distributed solutions involve iterative updating and explicit message passing, it is unrealistic to assume that the wireless channel remains unchanged during the iterations. Unfortunately, the behavior of those distributed solutions under \emph{time-varying} channels is in general unknown. In this paper, we shall investigate the distributed scaled gradient projection algorithm (DSGPA) in a $K$ pairs multicarrier interference network under a finite-state Markov channel (FSMC) model. We shall analyze the \emph{convergence property} as well as \emph{tracking performance} of the proposed DSGPA. Our analysis shows that the proposed DSGPA converges to a limit region rather than a single point under the FSMC model. We also show that the order of growth of the tracking errors is given by \mathcal{O}\(1 \big/ \bar{N}\), where $\bar{N}$ is the \emph{average sojourn time} of the FSMC. Based on the analysis, we shall derive the \emph{tracking error optimal scaling matrices} via Markov decision process modeling. We shall show that the tracking error optimal scaling matrices can be implemented distributively at each transmitter. The numerical results show the superior performance of the proposed DSGPA over three baseline schemes, such as the gradient projection algorithm with a constant stepsize.Comment: To Appear on the IEEE Transaction on Signal Processin

On green routing and scheduling problem

The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools