Matching Items (2)
Filtering by

Clear all filters

154053-Thumbnail Image.png
Description
Vertical taking off and landing (VTOL) drones started to emerge at the beginning of this century, and finds applications in the vast areas of mapping, rescuing, logistics, etc. Usually a VTOL drone control system design starts from a first principles model. Most of the VTOL drones are in the shape

Vertical taking off and landing (VTOL) drones started to emerge at the beginning of this century, and finds applications in the vast areas of mapping, rescuing, logistics, etc. Usually a VTOL drone control system design starts from a first principles model. Most of the VTOL drones are in the shape of a quad-rotor which is convenient for dynamic analysis.

In this project, a VTOL drone with shape similar to a Convair XFY-1 is studied and the primary focus is developing and examining an alternative method to identify a system model from the input and output data, with which it is possible to estimate system parameters and compute model uncertainties on discontinuous data sets. We verify the models by designing controllers that stabilize the yaw, pitch, and roll angles for the VTOL drone in the hovering state.

This project comprises of three stages: an open-loop identification to identify the yaw and pitch dynamics, an intermediate closed-loop identification to identify the roll action dynamic and a closed-loop identification to refine the identification of yaw and pitch action. In open and closed loop identifications, the reference signals sent to the servos were recorded as inputs to the system and the angles and angular velocities in yaw and pitch directions read by inertial measurement unit were recorded as outputs of the system. In the intermediate closed loop identification, the difference between the reference signals sent to the motors on the contra-rotators was recorded as input and the roll angular velocity is recorded as output. Next, regressors were formed by using a coprime factor structure and then parameters of the system were estimated using the least square method. Multiplicative and divisive uncertainties were calculated from the data set and were used to guide PID loop-shaping controller design.
ContributorsLiu, Yiqiu (Author) / Tsakalis, Konstantinos (Thesis advisor) / Rodriguez, Armando (Thesis advisor) / Rivera, Daniel (Committee member) / Arizona State University (Publisher)
Created2015
154349-Thumbnail Image.png
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

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.
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