This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.

In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.

Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.

Displaying 1 - 2 of 2
Filtering by

Clear all filters

168490-Thumbnail Image.png
Description
Modern life is full of challenging optimization problems that we unknowingly attempt to solve. For instance, a common dilemma often encountered is the decision of picking a parking spot while trying to minimize both the distance to the goal destination and time spent searching for parking; one strategy is to

Modern life is full of challenging optimization problems that we unknowingly attempt to solve. For instance, a common dilemma often encountered is the decision of picking a parking spot while trying to minimize both the distance to the goal destination and time spent searching for parking; one strategy is to drive as close as possible to the goal destination but risk a penalty cost if no parking spaces can be found. Optimization problems of this class all have underlying time-varying processes that can be altered by a decision/input to minimize some cost. Such optimization problems are commonly solved by a class of methods called Dynamic Programming (DP) that breaks down a complex optimization problem into a simpler family of sub-problems. In the 1950s Richard Bellman introduced a class of DP methods that broke down Multi-Stage Optimization Problems (MSOP) into a nested sequence of ``tail problems”. Bellman showed that for any MSOP with a cost function that satisfies a condition called additive separability, the solution to the tail problem of the MSOP initialized at time-stage k>0 can be used to solve the tail problem initialized at time-stage k-1. Therefore, by recursively solving each tail problem of the MSOP, a solution to the original MSOP can be found. This dissertation extends Bellman`s theory to a broader class of MSOPs involving non-additively separable costs by introducing a new state augmentation solution method and generalizing the Bellman Equation. This dissertation also considers the analogous continuous-time counterpart to discrete-time MSOPs, called Optimal Control Problems (OCPs). OCPs can be solved by solving a nonlinear Partial Differential Equation (PDE) called the Hamilton-Jacobi-Bellman (HJB) PDE. Unfortunately, it is rarely possible to obtain an analytical solution to the HJB PDE. This dissertation proposes a method for approximately solving the HJB PDE based on Sum-Of-Squares (SOS) programming. This SOS algorithm can be used to synthesize controllers, hence solving the OCP, and also compute outer bounds of reachable sets of dynamical systems. This methodology is then extended to infinite time horizons, by proposing SOS algorithms that yield Lyapunov functions that can approximate regions of attraction and attractor sets of nonlinear dynamical systems arbitrarily well.
ContributorsJones, Morgan (Author) / Peet, Matthew M (Thesis advisor) / Nedich, Angelia (Committee member) / Kawski, Matthias (Committee member) / Mignolet, Marc (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2021
153841-Thumbnail Image.png
Description
Fracture phenomena have been extensively studied in the last several decades. Continuum mechanics-based approaches, such as finite element methods and extended finite element methods, are widely used for fracture simulation. One well-known issue of these approaches is the stress singularity resulted from the spatial discontinuity at the crack tip/front. The

Fracture phenomena have been extensively studied in the last several decades. Continuum mechanics-based approaches, such as finite element methods and extended finite element methods, are widely used for fracture simulation. One well-known issue of these approaches is the stress singularity resulted from the spatial discontinuity at the crack tip/front. The requirement of guiding criteria for various cracking behaviors, such as initiation, propagation, and branching, also poses some challenges. Comparing to the continuum based formulation, the discrete approaches, such as lattice spring method, discrete element method, and peridynamics, have certain advantages when modeling various fracture problems due to their intrinsic characteristics in modeling discontinuities.

A novel, alternative, and systematic framework based on a nonlocal lattice particle model is proposed in this study. The uniqueness of the proposed model is the inclusion of both pair-wise local and multi-body nonlocal potentials in the formulation. First, the basic ideas of the proposed framework for 2D isotropic solid are presented. Derivations for triangular and square lattice structure are discussed in detail. Both mechanical deformation and fracture process are simulated and model verification and validation are performed with existing analytical solutions and experimental observations. Following this, the extension to general 3D isotropic solids based on the proposed local and nonlocal potentials is given. Three cubic lattice structures are discussed in detail. Failure predictions using the 3D simulation are compared with experimental testing results and very good agreement is observed. Next, a lattice rotation scheme is proposed to account for the material orientation in modeling anisotropic solids. The consistency and difference compared to the classical material tangent stiffness transformation method are discussed in detail. The implicit and explicit solution methods for the proposed lattice particle model are also discussed. Finally, some conclusions and discussions based on the current study are drawn at the end.
ContributorsChen, Hailong (Author) / Liu, Yongming (Thesis advisor) / Jiao, Yang (Committee member) / Mignolet, Marc (Committee member) / Oswald, Jay (Committee member) / Solanki, Kiran (Committee member) / Arizona State University (Publisher)
Created2015