Matching Items (4)
Filtering by
- All Subjects: Mathematics
Description
In order to refine autonomous exploratory movement planning schemes, an approach must be developed that accounts for valuable information other than that gained from map filling. To this end, the goal of this thesis is divided into two parts. The first is to develop a technique for categorizing objects detected by an autonomous exploratory robot and assigning them a score based on their interest value. The second is an attempt to develop a method of integrating this technique into a navigation algorithm in order to refine the movements of a robot or robots to maximize the efficiency of information gain. The intention of both of these components is to provide a method of refining the navigation scheme applied to autonomous exploring robots and maximize the amount of information they can gather in deployments where they face significant resource or functionality constraints. To this end this project is divided into two main sections: a shape-matching technique and a simulation in in which to implement this technique. The first section was accomplished by combining concepts from information theory, principal component analysis, and the eigenfaces algorithm to create an effective matching technique. The second was created with inspiration from existing navigation algorithms. Once these components were determined to be functional, a testing regime was applied to determine their capabilities. The testing regime was also divided into two parts. The tests applied to the matching technique were first to demonstrate that it functions under ideal conditions. After testing was conducted under ideal conditions, the technique was tested under non-ideal conditions. Additional tests were run to determine how the system responded to changes in the coefficients and equations that govern its operation. Similarly, the simulation component was initially tested under normal conditions to determine the base effectiveness of the approach. After these tests were conducted, alternative conditions were tested to evaluate the effects of modifying the implementation technique. The results of these tests indicated a few things. The first series of tests confirmed that the matching technique functions as expected under ideal conditions. The second series of tests determined that the matching element is effective for a reasonable range of variations and non-ideal conditions. The third series of tests showed that changing the functional coefficients of the matching technique can help tune the technique to different conditions. The fourth series of tests demonstrated that the basic concept of the implementation technique makes sense. The final series of tests demonstrated that modifying the implementation method is at least somewhat effective and that modifications to it can be used to specifically tailor the implementation to a method. Overall the results indicate that the stated goals of the project were accomplished successfully.
ContributorsFleetwood, Garrett Clark (Author) / Thanga, Jekan (Thesis director) / Berman, Spring (Committee member) / Middleton, James (Committee member) / Economics Program in CLAS (Contributor) / Mechanical and Aerospace Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2016-12
Description
Currently, one of the biggest limiting factors for long-term deployment of autonomous systems is the power constraints of a platform. In particular, for aerial robots such as unmanned aerial vehicles (UAVs), the energy resource is the main driver of mission planning and operation definitions, as everything revolved around flight time. The focus of this work is to develop a new method of energy storage and charging for autonomous UAV systems, for use during long-term deployments in a constrained environment. We developed a charging solution that allows pre-equipped UAV system to land on top of designated charging pads and rapidly replenish their battery reserves, using a contact charging point. This system is designed to work with all types of rechargeable batteries, focusing on Lithium Polymer (LiPo) packs, that incorporate a battery management system for increased reliability. The project also explores optimization methods for fleets of UAV systems, to increase charging efficiency and extend battery lifespans. Each component of this project was first designed and tested in computer simulation. Following positive feedback and results, prototypes for each part of this system were developed and rigorously tested. Results show that the contact charging method is able to charge LiPo batteries at a 1-C rate, which is the industry standard rate, maintaining the same safety and efficiency standards as modern day direct connection chargers. Control software for these base stations was also created, to be integrated with a fleet management system, and optimizes UAV charge levels and distribution to extend LiPo battery lifetimes while still meeting expected mission demand. Each component of this project (hardware/software) was designed for manufacturing and implementation using industry standard tools, making it ideal for large-scale implementations. This system has been successfully tested with a fleet of UAV systems at Arizona State University, and is currently being integrated into an Arizona smart city environment for deployment.
ContributorsMian, Sami (Author) / Panchanathan, Sethuraman (Thesis advisor) / Berman, Spring (Committee member) / Yang, Yezhou (Committee member) / McDaniel, Troy (Committee member) / Arizona State University (Publisher)
Created2018
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
For the last 50 years, oscillator modeling in ranging systems has received considerable
attention. Many components in a navigation system, such as the master oscillator
driving the receiver system, as well the master oscillator in the transmitting system
contribute significantly to timing errors. Algorithms in the navigation processor must
be able to predict and compensate such errors to achieve a specified accuracy. While
much work has been done on the fundamentals of these problems, the thinking on said
problems has not progressed. On the hardware end, the designers of local oscillators
focus on synthesized frequency and loop noise bandwidth. This does nothing to
mitigate, or reduce frequency stability degradation in band. Similarly, there are not
systematic methods to accommodate phase and frequency anomalies such as clock
jumps. Phase locked loops are fundamentally control systems, and while control
theory has had significant advancement over the last 30 years, the design of timekeeping
sources has not advanced beyond classical control. On the software end,
single or two state oscillator models are typically embedded in a Kalman Filter to
alleviate time errors between the transmitter and receiver clock. Such models are
appropriate for short term time accuracy, but insufficient for long term time accuracy.
Additionally, flicker frequency noise may be present in oscillators, and it presents
mathematical modeling complications. This work proposes novel H∞ control methods
to address the shortcomings in the standard design of time-keeping phase locked loops.
Such methods allow the designer to address frequency stability degradation as well
as high phase/frequency dynamics. Additionally, finite-dimensional approximants of
flicker frequency noise that are more representative of the truth system than the
tradition Gauss Markov approach are derived. Last, to maintain timing accuracy in
a wide variety of operating environments, novel Banks of Adaptive Extended Kalman
Filters are used to address both stochastic and dynamic uncertainty.
attention. Many components in a navigation system, such as the master oscillator
driving the receiver system, as well the master oscillator in the transmitting system
contribute significantly to timing errors. Algorithms in the navigation processor must
be able to predict and compensate such errors to achieve a specified accuracy. While
much work has been done on the fundamentals of these problems, the thinking on said
problems has not progressed. On the hardware end, the designers of local oscillators
focus on synthesized frequency and loop noise bandwidth. This does nothing to
mitigate, or reduce frequency stability degradation in band. Similarly, there are not
systematic methods to accommodate phase and frequency anomalies such as clock
jumps. Phase locked loops are fundamentally control systems, and while control
theory has had significant advancement over the last 30 years, the design of timekeeping
sources has not advanced beyond classical control. On the software end,
single or two state oscillator models are typically embedded in a Kalman Filter to
alleviate time errors between the transmitter and receiver clock. Such models are
appropriate for short term time accuracy, but insufficient for long term time accuracy.
Additionally, flicker frequency noise may be present in oscillators, and it presents
mathematical modeling complications. This work proposes novel H∞ control methods
to address the shortcomings in the standard design of time-keeping phase locked loops.
Such methods allow the designer to address frequency stability degradation as well
as high phase/frequency dynamics. Additionally, finite-dimensional approximants of
flicker frequency noise that are more representative of the truth system than the
tradition Gauss Markov approach are derived. Last, to maintain timing accuracy in
a wide variety of operating environments, novel Banks of Adaptive Extended Kalman
Filters are used to address both stochastic and dynamic uncertainty.
ContributorsEchols, Justin A (Author) / Bliss, Daniel W (Thesis advisor) / Tsakalis, Konstantinos S (Committee member) / Berman, Spring (Committee member) / Mittelmann, Hans (Committee member) / Arizona State University (Publisher)
Created2020