Matching Items (5)
Filtering by
- All Subjects: Convex Optimization
- Creators: Berman, Spring
Description
This investigation focuses on the development of uncertainty modeling methods applicable to both the structural and thermal models of heated structures as part of an effort to enable the design under uncertainty of hypersonic vehicles. The maximum entropy-based nonparametric stochastic modeling approach is used within the context of coupled structural-thermal Reduced Order Models (ROMs). Not only does this strategy allow for a computationally efficient generation of samples of the structural and thermal responses but the maximum entropy approach allows to introduce both aleatoric and some epistemic uncertainty into the system.
While the nonparametric approach has a long history of applications to structural models, the present investigation was the first one to consider it for the heat conduction problem. In this process, it was recognized that the nonparametric approach had to be modified to maintain the localization of the temperature near the heat source, which was successfully achieved.
The introduction of uncertainty in coupled structural-thermal ROMs of heated structures was addressed next. It was first recognized that the structural stiffness coefficients (linear, quadratic, and cubic) and the parameters quantifying the effects of the temperature distribution on the structural response can be regrouped into a matrix that is symmetric and positive definite. The nonparametric approach was then applied to this matrix allowing the assessment of the effects of uncertainty on the resulting temperature distributions and structural response.
The third part of this document focuses on introducing uncertainty using the Maximum Entropy Method at the level of finite element by randomizing elemental matrices, for instance, elemental stiffness, mass and conductance matrices. This approach brings some epistemic uncertainty not present in the parametric approach (e.g., by randomizing the elasticity tensor) while retaining more local character than the operation in ROM level.
The last part of this document focuses on the development of “reduced ROMs” (RROMs) which are reduced order models with small bases constructed in a data-driven process from a “full” ROM with a much larger basis. The development of the RROM methodology is motivated by the desire to optimally reduce the computational cost especially in multi-physics situations where a lack of prior understanding/knowledge of the solution typically leads to the selection of ROM bases that are excessively broad to ensure the necessary accuracy in representing the response. It is additionally emphasized that the ROM reduction process can be carried out adaptively, i.e., differently over different ranges of loading conditions.
While the nonparametric approach has a long history of applications to structural models, the present investigation was the first one to consider it for the heat conduction problem. In this process, it was recognized that the nonparametric approach had to be modified to maintain the localization of the temperature near the heat source, which was successfully achieved.
The introduction of uncertainty in coupled structural-thermal ROMs of heated structures was addressed next. It was first recognized that the structural stiffness coefficients (linear, quadratic, and cubic) and the parameters quantifying the effects of the temperature distribution on the structural response can be regrouped into a matrix that is symmetric and positive definite. The nonparametric approach was then applied to this matrix allowing the assessment of the effects of uncertainty on the resulting temperature distributions and structural response.
The third part of this document focuses on introducing uncertainty using the Maximum Entropy Method at the level of finite element by randomizing elemental matrices, for instance, elemental stiffness, mass and conductance matrices. This approach brings some epistemic uncertainty not present in the parametric approach (e.g., by randomizing the elasticity tensor) while retaining more local character than the operation in ROM level.
The last part of this document focuses on the development of “reduced ROMs” (RROMs) which are reduced order models with small bases constructed in a data-driven process from a “full” ROM with a much larger basis. The development of the RROM methodology is motivated by the desire to optimally reduce the computational cost especially in multi-physics situations where a lack of prior understanding/knowledge of the solution typically leads to the selection of ROM bases that are excessively broad to ensure the necessary accuracy in representing the response. It is additionally emphasized that the ROM reduction process can be carried out adaptively, i.e., differently over different ranges of loading conditions.
ContributorsSong, Pengchao (Author) / Mignolet, Marc P (Thesis advisor) / Smarslok, Benjamin (Committee member) / Chattopadhyay, Aditi (Committee member) / Liu, Yongming (Committee member) / Jiang, Hanqing (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2019
Description
A computational framework based on convex optimization is presented for stability analysis of systems described by Partial Differential Equations (PDEs). Specifically, two forms of linear PDEs with spatially distributed polynomial coefficients are considered.
The first class includes linear coupled PDEs with one spatial variable. Parabolic, elliptic or hyperbolic PDEs with Dirichlet, Neumann, Robin or mixed boundary conditions can be reformulated in order to be used by the framework. As an example, the reformulation is presented for systems governed by Schr¨odinger equation, parabolic type, relativistic heat conduction PDE and acoustic wave equation, hyperbolic types. The second form of PDEs of interest are scalar-valued with two spatial variables. An extra spatial variable allows consideration of problems such as local stability of fluid flows in channels and dynamics of population over two dimensional domains.
The approach does not involve discretization and is based on using Sum-of-Squares (SOS) polynomials and positive semi-definite matrices to parameterize operators which are positive on function spaces. Applying the parameterization to construct Lyapunov functionals with negative derivatives allows to express stability conditions as a set of LinearMatrix Inequalities (LMIs). The MATLAB package SOSTOOLS was used to construct the LMIs. The resultant LMIs then can be solved using existent Semi-Definite Programming (SDP) solvers such as SeDuMi or MOSEK. Moreover, the proposed approach allows to calculate bounds on the rate of decay of the solution norm.
The methodology is tested using several numerical examples and compared with the results obtained from simulation using standard methods of numerical discretization and analytic solutions.
The first class includes linear coupled PDEs with one spatial variable. Parabolic, elliptic or hyperbolic PDEs with Dirichlet, Neumann, Robin or mixed boundary conditions can be reformulated in order to be used by the framework. As an example, the reformulation is presented for systems governed by Schr¨odinger equation, parabolic type, relativistic heat conduction PDE and acoustic wave equation, hyperbolic types. The second form of PDEs of interest are scalar-valued with two spatial variables. An extra spatial variable allows consideration of problems such as local stability of fluid flows in channels and dynamics of population over two dimensional domains.
The approach does not involve discretization and is based on using Sum-of-Squares (SOS) polynomials and positive semi-definite matrices to parameterize operators which are positive on function spaces. Applying the parameterization to construct Lyapunov functionals with negative derivatives allows to express stability conditions as a set of LinearMatrix Inequalities (LMIs). The MATLAB package SOSTOOLS was used to construct the LMIs. The resultant LMIs then can be solved using existent Semi-Definite Programming (SDP) solvers such as SeDuMi or MOSEK. Moreover, the proposed approach allows to calculate bounds on the rate of decay of the solution norm.
The methodology is tested using several numerical examples and compared with the results obtained from simulation using standard methods of numerical discretization and analytic solutions.
ContributorsMeyer, Evgeny (Author) / Peet, Matthew (Thesis advisor) / Berman, Spring (Committee member) / Rivera, Daniel (Committee member) / Arizona State University (Publisher)
Created2016
Description
In this thesis, we focus on some of the NP-hard problems in control theory. Thanks to the converse Lyapunov theory, these problems can often be modeled as optimization over polynomials. To avoid the problem of intractability, we establish a trade off between accuracy and complexity. In particular, we develop a sequence of tractable optimization problems - in the form of Linear Programs (LPs) and/or Semi-Definite Programs (SDPs) - whose solutions converge to the exact solution of the NP-hard problem. However, the computational and memory complexity of these LPs and SDPs grow exponentially with the progress of the sequence - meaning that improving the accuracy of the solutions requires solving SDPs with tens of thousands of decision variables and constraints. Setting up and solving such problems is a significant challenge. The existing optimization algorithms and software are only designed to use desktop computers or small cluster computers - machines which do not have sufficient memory for solving such large SDPs. Moreover, the speed-up of these algorithms does not scale beyond dozens of processors. This in fact is the reason we seek parallel algorithms for setting-up and solving large SDPs on large cluster- and/or super-computers.
We propose parallel algorithms for stability analysis of two classes of systems: 1) Linear systems with a large number of uncertain parameters; 2) Nonlinear systems defined by polynomial vector fields. First, we develop a distributed parallel algorithm which applies Polya's and/or Handelman's theorems to some variants of parameter-dependent Lyapunov inequalities with parameters defined over the standard simplex. The result is a sequence of SDPs which possess a block-diagonal structure. We then develop a parallel SDP solver which exploits this structure in order to map the computation, memory and communication to a distributed parallel environment. Numerical tests on a supercomputer demonstrate the ability of the algorithm to efficiently utilize hundreds and potentially thousands of processors, and analyze systems with 100+ dimensional state-space. Furthermore, we extend our algorithms to analyze robust stability over more complicated geometries such as hypercubes and arbitrary convex polytopes. Our algorithms can be readily extended to address a wide variety of problems in control such as Hinfinity synthesis for systems with parametric uncertainty and computing control Lyapunov functions.
We propose parallel algorithms for stability analysis of two classes of systems: 1) Linear systems with a large number of uncertain parameters; 2) Nonlinear systems defined by polynomial vector fields. First, we develop a distributed parallel algorithm which applies Polya's and/or Handelman's theorems to some variants of parameter-dependent Lyapunov inequalities with parameters defined over the standard simplex. The result is a sequence of SDPs which possess a block-diagonal structure. We then develop a parallel SDP solver which exploits this structure in order to map the computation, memory and communication to a distributed parallel environment. Numerical tests on a supercomputer demonstrate the ability of the algorithm to efficiently utilize hundreds and potentially thousands of processors, and analyze systems with 100+ dimensional state-space. Furthermore, we extend our algorithms to analyze robust stability over more complicated geometries such as hypercubes and arbitrary convex polytopes. Our algorithms can be readily extended to address a wide variety of problems in control such as Hinfinity synthesis for systems with parametric uncertainty and computing control Lyapunov functions.
ContributorsKamyar, Reza (Author) / Peet, Matthew (Thesis advisor) / Berman, Spring (Committee member) / Rivera, Daniel (Committee member) / Artemiadis, Panagiotis (Committee member) / Fainekos, Georgios (Committee member) / Arizona State University (Publisher)
Created2016
Description
Over the past few decades, there is an increase in demand for various ground robot applications such as warehouse management, surveillance, mapping, infrastructure inspection, etc. This steady increase in demand has led to a significant rise in the nonholonomic differential drive vehicles (DDV) research. Albeit extensive work has been done in developing various control laws for trajectory tracking, point stabilization, formation control, etc., there are still problems and critical questions in regards to design, modeling, and control of DDV’s - that need to be adequately addressed. In this thesis, three different dynamical models are considered that are formed by varying the input/output parameters of the DDV model. These models are analyzed to understand their stability, bandwidth, input-output coupling, and control design properties. Furthermore, a systematic approach has been presented to show the impact of design parameters such as mass, inertia, radius of the wheels, and center of gravity location on the dynamic and inner-loop (speed) control design properties. Subsequently, extensive simulation and hardware trade studies have been conductedto quantify the impact of design parameters and modeling variations on the performance of outer-loop cruise and position control (along a curve). In addition to this, detailed guidelines are provided for when a multi-input multi-output (MIMO) control strategy is advisable over a single-input single-output (SISO) control strategy; when a less stable plant is preferable over a more stable one in order to accommodate performance specifications. Additionally, a multi-robot trajectory tracking implementation based on receding horizon optimization approach is also presented. In most of the optimization-based trajectory tracking approaches found in the literature, only the constraints imposed by the kinematic model are incorporated into the problem. This thesis elaborates the fundamental problem associated with these methods and presents a systematic approach to understand and quantify when kinematic model based constraints are sufficient and when dynamic model-based constraints are necessary to obtain good tracking properties. Detailed instructions are given for designing and building the DDV based on performance specifications, and also, an open-source platform capable of handling high-speed multi-robot research is developed in C++.
ContributorsManne, Sai Sravan (Author) / Rodriguez, Armando A (Thesis advisor) / Si, Jennie (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2021
Description
When solving analysis, estimation, and control problems for Partial Differential Equations (PDEs) via computational methods, one must resolve three main challenges: (a) the lack of a universal parametric representation of PDEs; (b) handling unbounded differential operators that appear as parameters; and (c), enforcing auxiliary constraints such as Boundary conditions and continuity conditions. To address these challenges, an alternative representation of PDEs called the `Partial Integral Equation' (PIE) representation is proposed in this work. Primarily, the PIE representation alleviates the problem of the lack of a universal parametrization of PDEs since PIEs have, at most, $12$ Partial Integral (PI) operators as parameters. Naturally, this also resolves the challenges in handling unbounded operators because PI operators are bounded linear operators. Furthermore, for admissible PDEs, the PIE representation is unique and has no auxiliary constraints --- resolving the last of the $3$ main challenges. The PIE representation for a PDE is obtained by finding a unique unitary map from the states of the PIE to the states of the PDE. This map shows a PDE and its associated PIE have equivalent system properties, including well-posedness, internal stability, and I/O behavior. Furthermore, this unique map also allows us to construct a well-defined dual representation that can be used to solve optimal control problems for a PDE. Using the equivalent PIE representation of a PDE, mathematical and computational tools are developed to solve standard problems in Control theory for PDEs. In particular, problems such as a test for internal stability, Input-to-Output (I/O) $L_2$-gain, $\hinf$-optimal state observer design, and $\hinf$-optimal full state-feedback controller design are solved using convex-optimization and Lyapunov methods for linear PDEs in one spatial dimension. Once the PIE associated with a PDE is obtained, Lyapunov functions (or storage functions) are parametrized by positive PI operators to obtain a solvable convex formulation of the above-stated control problems. Lastly, the methods proposed here are applied to various PDE systems to demonstrate the application.
ContributorsShivakumar, Sachin (Author) / Peet, Matthew (Thesis advisor) / Nedich, Angelia (Committee member) / Marvi, Hamidreza (Committee member) / Platte, Rodrigo (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2024