Matching Items (35)
Filtering by
- All Subjects: Mechanical Engineering
- Creators: Berman, Spring
Description
The introduction of assistive/autonomous features in cyber-physical systems, e.g., self-driving vehicles, have paved the way to a relatively new field of system analysis for safety-critical applications, along with the topic of controlling systems with performance and safety guarantees. The different works in this thesis explore and design methodologies that focus on the analysis of nonlinear dynamical systems via set-membership approximations, as well as the development of controllers and estimators that can give worst-case performance guarantees, especially when the sensor data containing information on system outputs is prone to data drops and delays. For analyzing the distinguishability of nonlinear systems, building upon the idea of set membership over-approximation of the nonlinear systems, a novel optimization-based method for multi-model affine abstraction (i.e., simultaneous set-membership over-approximation of multiple models) is designed. This work solves for the existence of set-membership over-approximations of a pair of different nonlinear models such that the different systems can be distinguished/discriminated within a guaranteed detection time under worst-case uncertainties and approximation errors. Specifically, by combining mesh-based affine abstraction methods with T-distinguishability analysis in the literature yields a bilevel bilinear optimization problem, whereby leveraging robust optimization techniques and a suitable change of variables result in a sufficient linear program that can obtain a tractable solution with T-distinguishability guarantees. Moreover, the thesis studied the designs of controllers and estimators with performance guarantees, and specifically, path-dependent feedback controllers and bounded-error estimators for time-varying affine systems are proposed that are subject to delayed observations or missing data. To model the delayed/missing data, two approaches are explored; a fixed-length language and an automaton-based model. Furthermore, controllers/estimators that satisfy the equalized recovery property (a weaker form of invariance with time-varying finite bounds) are synthesized whose feedback gains can be adapted based on the observed path, i.e., the history of observed data patterns up to the latest available time step. Finally, a robust kinodynamic motion planning algorithm is also developed with collision avoidance and probabilistic completeness guarantees. In particular, methods based on fixed and flexible invariant tubes are designed such that the planned motion/trajectories can reject bounded disturbances using noisy observations.
ContributorsHassaan, Syed Muhammad (Author) / Yong, Sze Zheng (Thesis advisor) / Rivera, Daniel (Committee member) / Marvi, Hamidreza (Committee member) / Lee, Hyunglae (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2023
Description
While wearable soft robots have successfully addressed many inherent design limitations faced by wearable rigid robots, they possess a unique set of challenges due to their soft and compliant nature. Some of these challenges are present in the sensing, modeling, control and evaluation of wearable soft robots. Machine learning algorithms have shown promising results for sensor fusion with wearable robots, however, they require extensive data to train models for different users and experimental conditions. Modeling soft sensors and actuators require characterizing non-linearity and hysteresis, which complicates deriving an analytical model. Experimental characterization can capture the characteristics of non-linearity and hysteresis but requires developing a synthesized model for real-time control. Controllers for wearable soft robots must be robust to compensate for unknown disturbances that arise from the soft robot and its interaction with the user. Since developing dynamic models for soft robots is complex, inaccuracies that arise from the unmodeled dynamics lead to significant disturbances that the controller needs to compensate for. In addition, obtaining a physical model of the human-robot interaction is complex due to unknown human dynamics during walking. Finally, the performance of soft robots for wearable applications requires extensive experimental evaluation to analyze the benefits for the user. To address these challenges, this dissertation focuses on the sensing, modeling, control and evaluation of soft robots for wearable applications. A model-based sensor fusion algorithm is proposed to improve the estimation of human joint kinematics, with a soft flexible robot that requires compact and lightweight sensors. To overcome limitations with rigid sensors, an inflatable soft haptic sensor is developed to enable gait sensing and haptic feedback. Through experimental characterization, a mathematical model is derived to quantify the user's ground reaction forces and the delivered haptic force. Lastly, the performance of a wearable soft exosuit in assisting human users during lifting tasks is evaluated, and the benefits obtained from the soft robot assistance are analyzed.
ContributorsQuiñones Yumbla, Emiliano (Author) / Zhang, Wenlong (Thesis advisor) / Berman, Spring (Committee member) / Lee, Hyunglae (Committee member) / Marvi, Hamid (Committee member) / Sugar, Thomas (Committee member) / Arizona State University (Publisher)
Created2023
Description
Autonomous systems inevitably must interact with other surrounding systems; thus, algorithms for intention/behavior estimation are of great interest. This thesis dissertation focuses on developing passive and active model discrimination algorithms (PMD and AMD) with applications to set-valued intention identification and fault detection for uncertain/bounded-error dynamical systems. PMD uses the obtained input-output data to invalidate the models, while AMD designs an auxiliary input to assist the discrimination process. First, PMD algorithms are proposed for noisy switched nonlinear systems constrained by metric/signal temporal logic specifications, including systems with lossy data modeled by (m,k)-firm constraints. Specifically, optimization-based algorithms are introduced for analyzing the detectability/distinguishability of models and for ruling out models that are inconsistent with observations at run time. On the other hand, two AMD approaches are designed for noisy switched nonlinear models and piecewise affine inclusion models, which involve bilevel optimization with integer variables/constraints in the inner/lower level. The first approach solves the inner problem using mixed-integer parametric optimization, whose solution is included when solving the outer problem/higher level, while the second approach moves the integer variables/constraints to the outer problem in a manner that retains feasibility and recasts the problem as a tractable mixed-integer linear programming (MILP). Furthermore, AMD algorithms are proposed for noisy discrete-time affine time-invariant systems constrained by disjunctive and coupled safety constraints. To overcome the issues associated with generalized semi-infinite constraints due to state-dependent input constraints and disjunctive safety constraints, several constraint reformulations are proposed to recast the AMD problems as tractable MILPs. Finally, partition-based AMD approaches are proposed for noisy discrete-time affine time-invariant models with model-independent parameters and output measurement that are revealed at run time. Specifically, algorithms with fixed and adaptive partitions are proposed, where the latter improves on the performance of the former by allowing the partitions to be optimized. By partitioning the operation region, the problem is solved offline, and partition trees are constructed which can be used as a `look-up table' to determine the optimal input depending on revealed information at run time.
ContributorsNiu, Ruochen (Author) / Yong, Sze Zheng S.Z. (Thesis advisor) / Berman, Spring (Committee member) / Ren, Yi (Committee member) / Zhang, Wenlong (Committee member) / Zhuang, Houlong (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
One potential application of multi-robot systems is collective transport, a task in which multiple mobile robots collaboratively transport a payload that is too large or heavy to be carried by a single robot. Numerous control schemes have been proposed for collective transport in environments where robots can localize themselves (e.g., using GPS) and communicate with one another, have information about the payload's geometric and dynamical properties, and follow predefined robot and/or payload trajectories. However, these approaches cannot be applied in uncertain environments where robots do not have reliable communication and GPS and lack information about the payload. These conditions characterize a variety of applications, including construction, mining, assembly in space and underwater, search-and-rescue, and disaster response.
Toward this end, this thesis presents decentralized control strategies for collective transport by robots that regulate their actions using only their local sensor measurements and minimal prior information. These strategies can be implemented on robots that have limited or absent localization capabilities, do not explicitly exchange information, and are not assigned predefined trajectories. The controllers are developed for collective transport over planar surfaces, but can be extended to three-dimensional environments.
This thesis addresses the above problem for two control objectives. First, decentralized controllers are proposed for velocity control of collective transport, in which the robots must transport a payload at a constant velocity through an unbounded domain that may contain strictly convex obstacles. The robots are provided only with the target transport velocity, and they do not have global localization or prior information about any obstacles in the environment. Second, decentralized controllers are proposed for position control of collective transport, in which the robots must transport a payload to a target position through a bounded or unbounded domain that may contain convex obstacles. The robots are subject to the same constraints as in the velocity control scenario, except that they are assumed to have global localization. Theoretical guarantees for successful execution of the task are derived using techniques from nonlinear control theory, and it is shown through simulations and physical robot experiments that the transport objectives are achieved with the proposed controllers.
Toward this end, this thesis presents decentralized control strategies for collective transport by robots that regulate their actions using only their local sensor measurements and minimal prior information. These strategies can be implemented on robots that have limited or absent localization capabilities, do not explicitly exchange information, and are not assigned predefined trajectories. The controllers are developed for collective transport over planar surfaces, but can be extended to three-dimensional environments.
This thesis addresses the above problem for two control objectives. First, decentralized controllers are proposed for velocity control of collective transport, in which the robots must transport a payload at a constant velocity through an unbounded domain that may contain strictly convex obstacles. The robots are provided only with the target transport velocity, and they do not have global localization or prior information about any obstacles in the environment. Second, decentralized controllers are proposed for position control of collective transport, in which the robots must transport a payload to a target position through a bounded or unbounded domain that may contain convex obstacles. The robots are subject to the same constraints as in the velocity control scenario, except that they are assumed to have global localization. Theoretical guarantees for successful execution of the task are derived using techniques from nonlinear control theory, and it is shown through simulations and physical robot experiments that the transport objectives are achieved with the proposed controllers.
ContributorsFarivarnejad, Hamed (Author) / Berman, Spring (Thesis advisor) / Mignolet, Marc (Committee member) / Tsakalis, Konstantinos (Committee member) / Artemiadis, Panagiotis (Committee member) / Gil, Stephanie (Committee member) / Arizona State University (Publisher)
Created2020
Description
Presented in this thesis are two projects that fall under the umbrella of magnetically actuated electronics and robotics for medical applications. First, magnetically actuated tunable soft electronics are discussed in Chapter 2. Wearable and implantable soft electronics are clinically available and commonplace. However, these devices can be taken a step further to improve the lives of their users by adding remote tunability. The four electric units tested were planar inductors, axial inductors, capacitors and resistors. The devices were made of polydimethylsiloxane (PDMS) for flexibility with copper components for conductivity. The units were tuned using magnets and mobile components comprised of iron filings and ferrofluid. The characteristic properties examined for each unit are as follows: inductance and quality factor (Q-factor) for inductors, capacitance and Q-factor for capacitors, and impedance for resistors. There were two groups of tuning tests: quantity effect and position effect of the mobile component. The position of the mobile component had a larger effect on each unit, with 20-23% change in inductance for inductors (from 3.31 µH for planar and 0.44 µH for axial), 12.7% from 2.854 pF for capacitors and 185.3% from 0.353 kΩ for resistors.
Chapter 3 discusses a magnetic needle tracking device with operative assistance from a six degree-of-freedom robotic arm. Traditional needle steering faces many obstacles such as torsional effects, buckling, and small radii of curvature. To improve upon the concept, this project uses permanent magnets in parallel with a tracking system to steer and determine the position and orientation of the needle in real time. The magnet configuration is located at the end effector of the robotic arm. The trajectory of the end effector depends on the needle’s path, and vice versa. The distance the needle travels inside the workspace is tracked by a direct current (DC) motor, to which the needle is tethered. Combining this length with the pose of the end effector, the position and orientation of the needle can be calculated. Simulation of this tracking device has shown the functionality of the system. Testing has been done to confirm that a single magnet pulls the needle through the phantom tissue.
Chapter 3 discusses a magnetic needle tracking device with operative assistance from a six degree-of-freedom robotic arm. Traditional needle steering faces many obstacles such as torsional effects, buckling, and small radii of curvature. To improve upon the concept, this project uses permanent magnets in parallel with a tracking system to steer and determine the position and orientation of the needle in real time. The magnet configuration is located at the end effector of the robotic arm. The trajectory of the end effector depends on the needle’s path, and vice versa. The distance the needle travels inside the workspace is tracked by a direct current (DC) motor, to which the needle is tethered. Combining this length with the pose of the end effector, the position and orientation of the needle can be calculated. Simulation of this tracking device has shown the functionality of the system. Testing has been done to confirm that a single magnet pulls the needle through the phantom tissue.
ContributorsEdwards, Dakota (Author) / Marvi, Hamidreza (Thesis advisor) / Lee, Hyunglae (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2020
Description
Autonomous vehicle technology has been evolving for years since the Automated Highway System Project. However, this technology has been under increased scrutiny ever since an autonomous vehicle killed Elaine Herzberg, who was crossing the street in Tempe, Arizona in March 2018. Recent tests of autonomous vehicles on public roads have faced opposition from nearby residents. Before these vehicles are widely deployed, it is imperative that the general public trusts them. For this, the vehicles must be able to identify objects in their surroundings and demonstrate the ability to follow traffic rules while making decisions with human-like moral integrity when confronted with an ethical dilemma, such as an unavoidable crash that will injure either a pedestrian or the passenger.
Testing autonomous vehicles in real-world scenarios would pose a threat to people and property alike. A safe alternative is to simulate these scenarios and test to ensure that the resulting programs can work in real-world scenarios. Moreover, in order to detect a moral dilemma situation quickly, the vehicle should be able to identify objects in real-time while driving. Toward this end, this thesis investigates the use of cross-platform training for neural networks that perform visual identification of common objects in driving scenarios. Here, the object detection algorithm Faster R-CNN is used. The hypothesis is that it is possible to train a neural network model to detect objects from two different domains, simulated or physical, using transfer learning. As a proof of concept, an object detection model is trained on image datasets extracted from CARLA, a virtual driving environment, via transfer learning. After bringing the total loss factor to 0.4, the model is evaluated with an IoU metric. It is determined that the model has a precision of 100% and 75% for vehicles and traffic lights respectively. The recall is found to be 84.62% and 75% for the same. It is also shown that this model can detect the same classes of objects from other virtual environments and real-world images. Further modifications to the algorithm that may be required to improve performance are discussed as future work.
Testing autonomous vehicles in real-world scenarios would pose a threat to people and property alike. A safe alternative is to simulate these scenarios and test to ensure that the resulting programs can work in real-world scenarios. Moreover, in order to detect a moral dilemma situation quickly, the vehicle should be able to identify objects in real-time while driving. Toward this end, this thesis investigates the use of cross-platform training for neural networks that perform visual identification of common objects in driving scenarios. Here, the object detection algorithm Faster R-CNN is used. The hypothesis is that it is possible to train a neural network model to detect objects from two different domains, simulated or physical, using transfer learning. As a proof of concept, an object detection model is trained on image datasets extracted from CARLA, a virtual driving environment, via transfer learning. After bringing the total loss factor to 0.4, the model is evaluated with an IoU metric. It is determined that the model has a precision of 100% and 75% for vehicles and traffic lights respectively. The recall is found to be 84.62% and 75% for the same. It is also shown that this model can detect the same classes of objects from other virtual environments and real-world images. Further modifications to the algorithm that may be required to improve performance are discussed as future work.
ContributorsSankaramangalam Ulhas, Sangeet (Author) / Berman, Spring (Thesis advisor) / Johnson, Kathryn (Committee member) / Yong, Sze Zheng (Committee member) / Arizona State University (Publisher)
Created2019
Description
With the substantial development of intelligent robots, human-robot interaction (HRI) has become ubiquitous in applications such as collaborative manufacturing, surgical robotic operations, and autonomous driving. In all these applications, a human behavior model, which can provide predictions of human actions, is a helpful reference that helps robots to achieve intelligent interaction with humans. The requirement elicits an essential problem of how to properly model human behavior, especially when individuals are interacting or cooperating with each other. The major objective of this thesis is to utilize the human intention decoding method to help robots enhance their performance while interacting with humans. Preliminary work on integrating human intention estimation with an HRI scenario is shown to demonstrate the benefit. In order to achieve this goal, the research topic is divided into three phases. First, a novel method of an online measure of the human's reliance on the robot, which can be estimated through the intention decoding process from human actions，is described. An experiment that requires human participants to complete an object-moving task with a robot manipulator was conducted under different conditions of distractions. A relationship is discovered between human intention and trust while participants performed a familiar task with no distraction. This finding suggests a relationship between the psychological construct of trust and joint physical coordination, which bridges the human's action to its mental states. Then, a novel human collaborative dynamic model is introduced based on game theory and bounded rationality, which is a novel method to describe human dyadic behavior with the aforementioned theories. The mutual intention decoding process was also considered to inform this model. Through this model, the connection between the mental states of the individuals to their cooperative actions is indicated. A haptic interface is developed with a virtual environment and the experiments are conducted with 30 human subjects. The result suggests the existence of mutual intention decoding during the human dyadic cooperative behaviors. Last, the empirical results show that allowing agents to have empathy in inference, which lets the agents understand that others might have a false understanding of their intentions, can help to achieve correct intention inference. It has been verified that knowledge about vehicle dynamics was also important to correctly infer intentions. A new courteous policy is proposed that bounded the courteous motion using its inferred set of equilibrium motions. A simulation, which is set to reproduce an intersection passing case between an autonomous car and a human driving car, is conducted to demonstrate the benefit of the novel courteous control policy.
ContributorsWang, Yiwei (Author) / Zhang, Wenlong (Thesis advisor) / Berman, Spring (Committee member) / Lee, Hyunglae (Committee member) / Ren, Yi (Committee member) / Yang, Yezhou (Committee member) / Arizona State University (Publisher)
Created2021
Description
This paper introduces a variable impedance controller which dynamically modulates both its damping and stiffness to improve the trade-off between stability and agility in coupled human-robot systems and reduce the human user’s effort. The controller applies a range of robotic damping from negative to positive values to either inject or dissipate energy based on the user’s intent of motion. The controller also estimates the user’s intent of direction and applies a variable stiffness torque to stabilize the user towards an estimated ideal trajectory. To evaluate the controller’s ability to improve the stability/agility trade-off and reduce human effort, a study was designed for human subjects to perform a 2D target reaching task while coupled with a wearable ankle robot. A constant impedance condition was selected as a control with which to compare the variable impedance condition. The position, speed, and muscle activation responses were used to quantify the user’s stability, agility, and effort, respectively. Stability was quantified spatially and temporally, with both overshoot and stabilization time showing no statistically significant difference between the two experimental conditions. Agility was quantified using mean and maximum speed, with both increasing from the constant impedance to variable impedance condition by 29.8% and 59.9%, respectively. Effort was quantified by the overall and maximum muscle activation data, both of which showed a ~10% reduction in effort. Overall, the study demonstrated the effectiveness of the variable impedance controller.
ContributorsArnold, James (Author) / Lee, Hyunglae (Thesis advisor) / Berman, Spring (Committee member) / Yong, Sze Zheng (Committee member) / Arizona State University (Publisher)
Created2021
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 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