Matching Items (10)
Filtering by
- All Subjects: Optimization
- All Subjects: Mathematics
- Resource Type: Text
- Status: Published
Description
The rapid escalation of technology and the widespread emergence of modern technological equipments have resulted in the generation of humongous amounts of digital data (in the form of images, videos and text). This has expanded the possibility of solving real world problems using computational learning frameworks. However, while gathering a large amount of data is cheap and easy, annotating them with class labels is an expensive process in terms of time, labor and human expertise. This has paved the way for research in the field of active learning. Such algorithms automatically select the salient and exemplar instances from large quantities of unlabeled data and are effective in reducing human labeling effort in inducing classification models. To utilize the possible presence of multiple labeling agents, there have been attempts towards a batch mode form of active learning, where a batch of data instances is selected simultaneously for manual annotation. This dissertation is aimed at the development of novel batch mode active learning algorithms to reduce manual effort in training classification models in real world multimedia pattern recognition applications. Four major contributions are proposed in this work: $(i)$ a framework for dynamic batch mode active learning, where the batch size and the specific data instances to be queried are selected adaptively through a single formulation, based on the complexity of the data stream in question, $(ii)$ a batch mode active learning strategy for fuzzy label classification problems, where there is an inherent imprecision and vagueness in the class label definitions, $(iii)$ batch mode active learning algorithms based on convex relaxations of an NP-hard integer quadratic programming (IQP) problem, with guaranteed bounds on the solution quality and $(iv)$ an active matrix completion algorithm and its application to solve several variants of the active learning problem (transductive active learning, multi-label active learning, active feature acquisition and active learning for regression). These contributions are validated on the face recognition and facial expression recognition problems (which are commonly encountered in real world applications like robotics, security and assistive technology for the blind and the visually impaired) and also on collaborative filtering applications like movie recommendation.
ContributorsChakraborty, Shayok (Author) / Panchanathan, Sethuraman (Thesis advisor) / Balasubramanian, Vineeth N. (Committee member) / Li, Baoxin (Committee member) / Mittelmann, Hans (Committee member) / Ye, Jieping (Committee member) / Arizona State University (Publisher)
Created2013
Description
Many industries require workers in warehouse and stockroom environments to perform frequent lifting tasks. Over time these repeated tasks can lead to excess strain on the worker's body and reduced productivity. This project seeks to develop an exoskeletal wrist fixture to be used in conjunction with a powered exoskeleton arm to aid workers performing box lifting types of tasks. Existing products aimed at improving worker comfort and productivity typically employ either fully powered exoskeleton suits or utilize minimally powered spring arms and/or fixtures. These designs either reduce stress to the user's body through powered arms and grippers operated via handheld controls which have limited functionality, or they use a more minimal setup that reduces some load, but exposes the user's hands and wrists to injury by directing support to the forearm. The design proposed here seeks to strike a balance between size, weight, and power requirements and also proposes a novel wrist exoskeleton design which minimizes stress on the user's wrists by directly interfacing with the object to be picked up. The design of the wrist exoskeleton was approached through initially selecting degrees of freedom and a ROM (range of motion) to accommodate. Feel and functionality were improved through an iterative prototyping process which yielded two primary designs. A novel "clip-in" method was proposed to allow the user to easily attach and detach from the exoskeleton. Designs utilized a contact surface intended to be used with dry fibrillary adhesives to maximize exoskeleton grip. Two final designs, which used two pivots in opposite kinematic order, were constructed and tested to determine the best kinematic layout. The best design had two prototypes created to be worn with passive test arms that attached to the user though a specially designed belt.
ContributorsGreason, Kenneth Berend (Author) / Sugar, Thomas (Thesis director) / Holgate, Matthew (Committee member) / Mechanical and Aerospace Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2016-12
Description
Multibody Dynamic (MBD) models are important tools in motion analysis and are used to represent and accurately predict the behavior of systems in the real-world. These models have a range of applications, including the stowage and deployment of flexible deployables on spacecraft, the dynamic response of vehicles in automotive design and crash testing, and mapping interactions of the human body. An accurate model can aid in the design of a system to ensure the system is effective and meets specified performance criteria when built. A model may have many design parameters, such as geometrical constraints and component mechanical properties, or controller parameters if the system uses an external controller. Varying these parameters and rerunning analyses by hand to find an ideal design can be time consuming for models that take hours or days to run. To reduce the amount of time required to find a set of parameters that produces a desired performance, optimization is necessary. Many papers have discussed methods for optimizing rigid and flexible MBD models, and separately their controllers, using both gradient-based and gradient-free algorithms. However, these optimization methods have not been used to optimize full-scale MBD models and their controllers simultaneously. This thesis presents a method for co-optimizing an MBD model and controller that allows for the flexibility to find model and controller-based solutions for systems with tightly coupled parameters. Specifically, the optimization is performed on a quadrotor drone MBD model undergoing disturbance from a slung load and its position controller to meet specified position error performance criteria. A gradient-free optimization algorithm and multiple objective approach is used due to the many local optima from the tradeoffs between the model and controller parameters. The thesis uses nine different quadrotor cases with three different position error formulations. The results are used to determine the effectiveness of the optimization and the ability to converge on a single optimal design. After reviewing the results, the optimization limitations are discussed as well as the ability to transition the optimization to work with different MBD models and their controllers.
ContributorsGambatese, Marcus (Author) / Zhang, Wenlong (Thesis advisor) / Berman, Spring (Committee member) / Inoyama, Daisaku (Committee member) / Arizona State University (Publisher)
Created2022
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
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
The Kuramoto model is an archetypal model for studying synchronization in groups
of nonidentical oscillators where oscillators are imbued with their own frequency and
coupled with other oscillators though a network of interactions. As the coupling
strength increases, there is a bifurcation to complete synchronization where all oscillators
move with the same frequency and show a collective rhythm. Kuramoto-like
dynamics are considered a relevant model for instabilities of the AC-power grid which
operates in synchrony under standard conditions but exhibits, in a state of failure,
segmentation of the grid into desynchronized clusters.
In this dissertation the minimum coupling strength required to ensure total frequency
synchronization in a Kuramoto system, called the critical coupling, is investigated.
For coupling strength below the critical coupling, clusters of oscillators form
where oscillators within a cluster are on average oscillating with the same long-term
frequency. A unified order parameter based approach is developed to create approximations
of the critical coupling. Some of the new approximations provide strict lower
bounds for the critical coupling. In addition, these approximations allow for predictions
of the partially synchronized clusters that emerge in the bifurcation from the
synchronized state.
Merging the order parameter approach with graph theoretical concepts leads to a
characterization of this bifurcation as a weighted graph partitioning problem on an
arbitrary networks which then leads to an optimization problem that can efficiently
estimate the partially synchronized clusters. Numerical experiments on random Kuramoto
systems show the high accuracy of these methods. An interpretation of the
methods in the context of power systems is provided.
of nonidentical oscillators where oscillators are imbued with their own frequency and
coupled with other oscillators though a network of interactions. As the coupling
strength increases, there is a bifurcation to complete synchronization where all oscillators
move with the same frequency and show a collective rhythm. Kuramoto-like
dynamics are considered a relevant model for instabilities of the AC-power grid which
operates in synchrony under standard conditions but exhibits, in a state of failure,
segmentation of the grid into desynchronized clusters.
In this dissertation the minimum coupling strength required to ensure total frequency
synchronization in a Kuramoto system, called the critical coupling, is investigated.
For coupling strength below the critical coupling, clusters of oscillators form
where oscillators within a cluster are on average oscillating with the same long-term
frequency. A unified order parameter based approach is developed to create approximations
of the critical coupling. Some of the new approximations provide strict lower
bounds for the critical coupling. In addition, these approximations allow for predictions
of the partially synchronized clusters that emerge in the bifurcation from the
synchronized state.
Merging the order parameter approach with graph theoretical concepts leads to a
characterization of this bifurcation as a weighted graph partitioning problem on an
arbitrary networks which then leads to an optimization problem that can efficiently
estimate the partially synchronized clusters. Numerical experiments on random Kuramoto
systems show the high accuracy of these methods. An interpretation of the
methods in the context of power systems is provided.
ContributorsGilg, Brady (Author) / Armbruster, Dieter (Thesis advisor) / Mittelmann, Hans (Committee member) / Scaglione, Anna (Committee member) / Strogatz, Steven (Committee member) / Welfert, Bruno (Committee member) / Arizona State University (Publisher)
Created2018
Description
In order for assistive mobile robots to operate in the same environment as humans, they must be able to navigate the same obstacles as humans do. Many elements are required to do this: a powerful controller which can understand the obstacle, and power-dense actuators which will be able to achieve the necessary limb accelerations and output energies. Rapid growth in information technology has made complex controllers, and the devices which run them considerably light and cheap. The energy density of batteries, motors, and engines has not grown nearly as fast. This is problematic because biological systems are more agile, and more efficient than robotic systems. This dissertation introduces design methods which may be used optimize a multiactuator robotic limb's natural dynamics in an effort to reduce energy waste. These energy savings decrease the robot's cost of transport, and the weight of the required fuel storage system. To achieve this, an optimal design method, which allows the specialization of robot geometry, is introduced. In addition to optimal geometry design, a gearing optimization is presented which selects a gear ratio which minimizes the electrical power at the motor while considering the constraints of the motor. Furthermore, an efficient algorithm for the optimization of parallel stiffness elements in the robot is introduced. In addition to the optimal design tools introduced, the KiTy SP robotic limb structure is also presented. Which is a novel hybrid parallel-serial actuation method. This novel leg structure has many desirable attributes such as: three dimensional end-effector positioning, low mobile mass, compact form-factor, and a large workspace. We also show that the KiTy SP structure outperforms the classical, biologically-inspired serial limb structure.
ContributorsCahill, Nathan M (Author) / Sugar, Thomas (Thesis advisor) / Ren, Yi (Thesis advisor) / Holgate, Matthew (Committee member) / Berman, Spring (Committee member) / Artemiadis, Panagiotis (Committee member) / Arizona State University (Publisher)
Created2017
Description
The problem of modeling and controlling the distribution of a multi-agent system has recently evolved into an interdisciplinary effort. When the agent population is very large, i.e., at least on the order of hundreds of agents, it is important that techniques for analyzing and controlling the system scale well with the number of agents. One scalable approach to characterizing the behavior of a multi-agent system is possible when the agents' states evolve over time according to a Markov process. In this case, the density of agents over space and time is governed by a set of difference or differential equations known as a {\it mean-field model}, whose parameters determine the stochastic control policies of the individual agents. These models often have the advantage of being easier to analyze than the individual agent dynamics. Mean-field models have been used to describe the behavior of chemical reaction networks, biological collectives such as social insect colonies, and more recently, swarms of robots that, like natural swarms, consist of hundreds or thousands of agents that are individually limited in capability but can coordinate to achieve a particular collective goal.
This dissertation presents a control-theoretic analysis of mean-field models for which the agent dynamics are governed by either a continuous-time Markov chain on an arbitrary state space, or a discrete-time Markov chain on a continuous state space. Three main problems are investigated. First, the problem of stabilization is addressed, that is, the design of transition probabilities/rates of the Markov process (the agent control parameters) that make a target distribution, satisfying certain conditions, invariant. Such a control approach could be used to achieve desired multi-agent distributions for spatial coverage and task allocation. However, the convergence of the multi-agent distribution to the designed equilibrium does not imply the convergence of the individual agents to fixed states. To prevent the agents from continuing to transition between states once the target distribution is reached, and thus potentially waste energy, the second problem addressed within this dissertation is the construction of feedback control laws that prevent agents from transitioning once the equilibrium distribution is reached. The third problem addressed is the computation of optimized transition probabilities/rates that maximize the speed at which the system converges to the target distribution.
This dissertation presents a control-theoretic analysis of mean-field models for which the agent dynamics are governed by either a continuous-time Markov chain on an arbitrary state space, or a discrete-time Markov chain on a continuous state space. Three main problems are investigated. First, the problem of stabilization is addressed, that is, the design of transition probabilities/rates of the Markov process (the agent control parameters) that make a target distribution, satisfying certain conditions, invariant. Such a control approach could be used to achieve desired multi-agent distributions for spatial coverage and task allocation. However, the convergence of the multi-agent distribution to the designed equilibrium does not imply the convergence of the individual agents to fixed states. To prevent the agents from continuing to transition between states once the target distribution is reached, and thus potentially waste energy, the second problem addressed within this dissertation is the construction of feedback control laws that prevent agents from transitioning once the equilibrium distribution is reached. The third problem addressed is the computation of optimized transition probabilities/rates that maximize the speed at which the system converges to the target distribution.
ContributorsBiswal, Shiba (Author) / Berman, Spring (Thesis advisor) / Fainekos, Georgios (Committee member) / Lanchier, Nicolas (Committee member) / Mignolet, Marc (Committee member) / Peet, Matthew (Committee member) / Arizona State University (Publisher)
Created2020
Description
Global optimization (programming) has been attracting the attention of researchers for almost a century. Since linear programming (LP) and mixed integer linear programming (MILP) had been well studied in early stages, MILP methods and software tools had improved in their efficiency in the past few years. They are now fast and robust even for problems with millions of variables. Therefore, it is desirable to use MILP software to solve mixed integer nonlinear programming (MINLP) problems. For an MINLP problem to be solved by an MILP solver, its nonlinear functions must be transformed to linear ones. The most common method to do the transformation is the piecewise linear approximation (PLA). This dissertation will summarize the types of optimization and the most important tools and methods, and will discuss in depth the PLA tool. PLA will be done using nonuniform partitioning of the domain of the variables involved in the function that will be approximated. Also partial PLA models that approximate only parts of a complicated optimization problem will be introduced. Computational experiments will be done and the results will show that nonuniform partitioning and partial PLA can be beneficial.
ContributorsAlkhalifa, Loay (Author) / Mittelmann, Hans (Thesis advisor) / Armbruster, Hans (Committee member) / Escobedo, Adolfo (Committee member) / Renaut, Rosemary (Committee member) / Sefair, Jorge (Committee member) / Arizona State University (Publisher)
Created2020
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