ASU Electronic Theses and Dissertations
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 - 3 of 3
Filtering by
- Creators: Mignolet, Marc
Description
Interest in Micro Aerial Vehicle (MAV) research has surged over the past decade. MAVs offer new capabilities for intelligence gathering, reconnaissance, site mapping, communications, search and rescue, etc. This thesis discusses key modeling and control aspects of flapping wing MAVs in hover. A three degree of freedom nonlinear model is used to describe the flapping wing vehicle. Averaging theory is used to obtain a nonlinear average model. The equilibrium of this model is then analyzed. A linear model is then obtained to describe the vehicle near hover. LQR is used to as the main control system design methodology. It is used, together with a nonlinear parameter optimization algorithm, to design a family multivariable control system for the MAV. Critical performance trade-offs are illuminated. Properties at both the plant output and input are examined. Very specific rules of thumb are given for control system design. The conservatism of the rules are also discussed. Issues addressed include
What should the control system bandwidth be vis--vis the flapping frequency (so that averaging the nonlinear system is valid)?
When is first order averaging sufficient? When is higher order averaging necessary?
When can wing mass be neglected and when does wing mass become critical to model?
This includes how and when the rules given can be tightened; i.e. made less conservative.
What should the control system bandwidth be vis--vis the flapping frequency (so that averaging the nonlinear system is valid)?
When is first order averaging sufficient? When is higher order averaging necessary?
When can wing mass be neglected and when does wing mass become critical to model?
This includes how and when the rules given can be tightened; i.e. made less conservative.
ContributorsBiswal, Shiba (Author) / Rodriguez, Armando (Thesis advisor) / Mignolet, Marc (Thesis advisor) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2015
Description
Robotic joints can be either powered or passive. This work will discuss the creation of a passive and a powered joint system as well as the combination system being both powered and passive along with its benefits. A novel approach of analysis and control of the combination system is presented.
A passive and a powered ankle joint system is developed and fit to the field of prosthetics, specifically ankle joint replacement for able bodied gait. The general 1 DOF robotic joint designs are examined and the results from testing are discussed. Achievements in this area include the able bodied gait like behavior of passive systems for slow walking speeds. For higher walking speeds the powered ankle system is capable of adding the necessary energy to propel the user forward and remain similar to able bodied gait, effectively replacing the calf muscle. While running has not fully been achieved through past powered ankle devices the full power necessary is reached in this work for running and sprinting while achieving 4x’s power amplification through the powered ankle mechanism.
A theoretical approach to robotic joints is then analyzed in order to combine the advantages of both passive and powered systems. Energy methods are shown to provide a correct behavioral analysis of any robotic joint system. Manipulation of the energy curves and mechanism coupler curves allows real time joint behavioral adjustment. Such a powered joint can be adjusted to passively achieve desired behavior for different speeds and environmental needs. The effects on joint moment and stiffness from adjusting one type of mechanism is presented.
A passive and a powered ankle joint system is developed and fit to the field of prosthetics, specifically ankle joint replacement for able bodied gait. The general 1 DOF robotic joint designs are examined and the results from testing are discussed. Achievements in this area include the able bodied gait like behavior of passive systems for slow walking speeds. For higher walking speeds the powered ankle system is capable of adding the necessary energy to propel the user forward and remain similar to able bodied gait, effectively replacing the calf muscle. While running has not fully been achieved through past powered ankle devices the full power necessary is reached in this work for running and sprinting while achieving 4x’s power amplification through the powered ankle mechanism.
A theoretical approach to robotic joints is then analyzed in order to combine the advantages of both passive and powered systems. Energy methods are shown to provide a correct behavioral analysis of any robotic joint system. Manipulation of the energy curves and mechanism coupler curves allows real time joint behavioral adjustment. Such a powered joint can be adjusted to passively achieve desired behavior for different speeds and environmental needs. The effects on joint moment and stiffness from adjusting one type of mechanism is presented.
ContributorsHolgate, Robert (Author) / Sugar, Thomas (Thesis advisor) / Artemiades, Panagiotis (Thesis advisor) / Berman, Spring (Committee member) / Mignolet, Marc (Committee member) / Davidson, Joseph (Committee member) / Arizona State University (Publisher)
Created2017
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 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