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 - 6 of 6
Filtering by

Clear all filters

187789-Thumbnail Image.png
Description
Ferrofluidic microrobots have emerged as promising tools for minimally invasive medical procedures, leveraging their unique properties to navigate through complex fluids and reach otherwise inaccessible regions of the human body, thereby enabling new applications in areas such as targeted drug delivery, tissue engineering, and diagnostics. This dissertation develops a

Ferrofluidic microrobots have emerged as promising tools for minimally invasive medical procedures, leveraging their unique properties to navigate through complex fluids and reach otherwise inaccessible regions of the human body, thereby enabling new applications in areas such as targeted drug delivery, tissue engineering, and diagnostics. This dissertation develops a model-predictive controller for the external magnetic manipulation of ferrofluid microrobots. Several experiments are performed to illustrate the adaptability and generalizability of the control algorithm to changes in system parameters, including the three-dimensional reference trajectory, the velocity of the workspace fluid, and the size, orientation, deformation, and velocity of the microrobotic droplet. A linear time-invariant control system governing the dynamics of locomotion is derived and used as the constraints of a least squares optimal control algorithm to minimize the projected error between the actual trajectory and the desired trajectory of the microrobot. The optimal control problem is implemented after time discretization using quadratic programming. In addition to demonstrating generalizability and adaptability, the accuracy of the control algorithm is analyzed for several different types of experiments. The experiments are performed in a workspace with a static surrounding fluid and extended to a workspace with fluid flowing through it. The results suggest that the proposed control algorithm could enable new capabilities for ferrofluidic microrobots, opening up new opportunities for applications in minimally invasive medical procedures, lab-on-a-chip, and microfluidics.
ContributorsSkowronek, Elizabeth Olga (Author) / Marvi, Hamidreza (Thesis advisor) / Berman, Spring (Committee member) / Platte, Rodrigo (Committee member) / Xu, Zhe (Committee member) / Lee, Hyunglae (Committee member) / Arizona State University (Publisher)
Created2023
187806-Thumbnail Image.png
Description
This thesis presents a study on the user adaptive variable impedance control of a wearable ankle robot for robot-aided rehabilitation with a primary focus on enhancing accuracy and speed. The controller adjusts the impedance parameters based on the user's kinematic data to provide personalized assistance. Bayesian optimization is employed to

This thesis presents a study on the user adaptive variable impedance control of a wearable ankle robot for robot-aided rehabilitation with a primary focus on enhancing accuracy and speed. The controller adjusts the impedance parameters based on the user's kinematic data to provide personalized assistance. Bayesian optimization is employed to minimize an objective function formulated from the user's kinematic data to adapt the impedance parameters per user, thereby enhancing speed and accuracy. Gaussian process is used as a surrogate model for optimization to account for uncertainties and outliers inherent to human experiments. Student-t process based outlier detection is utilized to enhance optimization robustness and accuracy. The efficacy of the optimization is evaluated based on measures of speed, accuracy, and effort, and compared with an untuned variable impedance controller during 2D curved trajectory following tasks. User effort was measured based on muscle activation data from the tibialis anterior, peroneus longus, soleus, and gastrocnemius muscles. The optimized controller was evaluated on 15 healthy subjects and demonstrated an average increase in speed of 9.85% and a decrease in deviation from the ideal trajectory of 7.57%, compared to an unoptimized variable impedance controller. The strategy also reduced the time to complete tasks by 6.57%, while maintaining a similar level of user effort.
ContributorsManoharan, Gautham (Author) / Lee, Hyunglae (Thesis advisor) / Berman, Spring (Committee member) / Xu, Zhe (Committee member) / Arizona State University (Publisher)
Created2023
161727-Thumbnail Image.png
Description
In this thesis, the problem of designing model discrimination algorithms for unknown nonlinear systems is considered, where only raw experimental data of the system is available. This kind of model discrimination techniques finds one of its application in the estimation of the system or intent models under consideration, where all

In this thesis, the problem of designing model discrimination algorithms for unknown nonlinear systems is considered, where only raw experimental data of the system is available. This kind of model discrimination techniques finds one of its application in the estimation of the system or intent models under consideration, where all incompatible models are invalidated using new data that is available at run time. The proposed steps to reach the end goal of the algorithm for intention estimation involves two steps: First, using available experimental data of system trajectories, optimization-based techniques are used to over-approximate/abstract the dynamics of the system by constructing an upper and lower function which encapsulates/frames the true unknown system dynamics. This over-approximation is a conservative preservation of the dynamics of the system, in a way that ensures that any model which is invalidated against this approximation is guaranteed to be invalidated with the actual model of the system. The next step involves the use of optimization-based techniques to investigate the distinguishability of pairs of abstraction/approximated models using an algorithm for 'T-Distinguishability', which gives a finite horizon time 'T', within which the pair of models are guaranteed to be distinguished, and to eliminate incompatible models at run time using a 'Model Invalidation' algorithm. Furthermore, due the large amount of data under consideration, some computation-aware improvements were proposed for the processing of the raw data and the abstraction and distinguishability algorithms.The effectiveness of the above-mentioned algorithms is demonstrated using two examples. The first uses the data collected from the artificial simulation of a swarm of agents, also known as 'Boids', that move in certain patterns/formations, while the second example uses the 'HighD' dataset of naturalistic trajectories recorded on German Highways for vehicle intention estimation.
ContributorsBhagwat, Mohit Mukul (Author) / Yong, Sze Zheng (Thesis advisor) / Berman, Spring (Committee member) / Xu, Zhe (Committee member) / Arizona State University (Publisher)
Created2021
161695-Thumbnail Image.png
Description
This thesis proposes novel set-theoretic approaches for polytopic state estimationin bounded- error discrete-time nonlinear systems with nonlinear observations or constraints. Specically, our approaches rely on two equivalent representations of polytopic sets known as zonotope bundles (ZB) and constrained zonotopes (CZ), which allows us to transform the state space to the space of the

This thesis proposes novel set-theoretic approaches for polytopic state estimationin bounded- error discrete-time nonlinear systems with nonlinear observations or constraints. Specically, our approaches rely on two equivalent representations of polytopic sets known as zonotope bundles (ZB) and constrained zonotopes (CZ), which allows us to transform the state space to the space of the generators of the ZB/CZ that are generally interval-valued. This transformation enables us to leverage a recent result on remainder-form mixed-monotone decomposition functions for interval propagation to compute the propagated set estimate, i.e., a polytope that is guaranteed to enclose the set of the state trajectories of a nonlinear dynamical system. Furthermore, a similar procedure with state transformation and remainderform decomposition functions can be applied to the nonlinear observation function to compute the updated set estimate, i.e., an enclosing polytope of the set of states from the propagated set estimate that are compatible/consistent with the observations/ constraints. In addition, we also show that a mean value extension result for computing the propagated set estimate in the literature can also be extended to compute the updated set estimation when the observation/constraint function is nonlinear. Finally, the eectiveness of our proposed techniques is demonstrated using two simulation examples and compared with existing methods in the literature.
ContributorsShoaib, Fatima (Author) / Zheng Yong, Sze (Thesis advisor) / Berman, Spring (Committee member) / Xu, Zhe (Committee member) / Arizona State University (Publisher)
Created2021
193361-Thumbnail Image.png
Description
In this thesis, I investigate a subset of reinforcement learning (RL) tasks where the objective for the agent is to achieve temporally extended goals. A common approach, in this setting, is to represent the tasks using deterministic finite automata (DFA) and integrate them in the state space of the RL

In this thesis, I investigate a subset of reinforcement learning (RL) tasks where the objective for the agent is to achieve temporally extended goals. A common approach, in this setting, is to represent the tasks using deterministic finite automata (DFA) and integrate them in the state space of the RL algorithms, yet such representations often disregard causal knowledge pertinent to the environment. To address this limitation, I introduce the Temporal-Logic-based Causal Diagram (TL-CD) in RL.TL-CD encapsulates temporal causal relationships among diverse environmental properties. We leverage the TL-CD to devise an RL algorithm that significantly reduces environment exploration requirements. By synergizing TL-CD with task-specific DFAs, I identify scenarios wherein the agent can efficiently determine expected rewards early during the exploration phases. Through a series of case studies, I empirically demonstrate the advantages of TL-CDs, particularly highlighting the accelerated convergence of the algorithm towards an optimal policy facilitated by diminished exploration of the environment.
ContributorsPaliwal, Yash (Author) / Xu, Zhe (Thesis advisor) / Marvi, Hamidreza (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2024
193641-Thumbnail Image.png
Description
Human-robot interactions can often be formulated as general-sum differential games where the equilibrial policies are governed by Hamilton-Jacobi-Isaacs (HJI) equations. Solving HJI PDEs faces the curse of dimensionality (CoD). While physics-informed neural networks (PINNs) alleviate CoD in solving PDEs with smooth solutions, they fall short in learning discontinuous solutions due

Human-robot interactions can often be formulated as general-sum differential games where the equilibrial policies are governed by Hamilton-Jacobi-Isaacs (HJI) equations. Solving HJI PDEs faces the curse of dimensionality (CoD). While physics-informed neural networks (PINNs) alleviate CoD in solving PDEs with smooth solutions, they fall short in learning discontinuous solutions due to their sampling nature. This causes PINNs to have poor safety performance when they are applied to approximate values that are discontinuous due to state constraints. This dissertation aims to improve the safety performance of PINN-based value and policy models. The first contribution of the dissertation is to develop learning methods to approximate discontinuous values. Specifically, three solutions are developed: (1) hybrid learning uses both supervisory and PDE losses, (2) value-hardening solves HJIs with increasing Lipschitz constant on the constraint violation penalty, and (3) the epigraphical technique lifts the value to a higher-dimensional state space where it becomes continuous. Evaluations through 5D and 9D vehicle and 13D drone simulations reveal that the hybrid method outperforms others in terms of generalization and safety performance. The second contribution is a learning-theoretical analysis of PINN for value and policy approximation. Specifically, by extending the neural tangent kernel (NTK) framework, this dissertation explores why the choice of activation function significantly affects the PINN generalization performance, and why the inclusion of supervisory costate data improves the safety performance. The last contribution is a series of extensions of the hybrid PINN method to address real-time parameter estimation problems in incomplete-information games. Specifically, a Pontryagin-mode PINN is developed to avoid costly computation for supervisory data. The key idea is the introduction of a costate loss, which is cheap to compute yet effectively enables the learning of important value changes and policies in space-time. Building upon this, a Pontryagin-mode neural operator is developed to achieve state-of-the-art (SOTA) safety performance across a set of differential games with parametric state constraints. This dissertation demonstrates the utility of the resultant neural operator in estimating player constraint parameters during incomplete-information games.
ContributorsZhang, Lei (Author) / Ren, Yi (Thesis advisor) / Si, Jennie (Committee member) / Berman, Spring (Committee member) / Zhang, Wenlong (Committee member) / Xu, Zhe (Committee member) / Arizona State University (Publisher)
Created2024