Matching Items (19)
Filtering by
- All Subjects: engineering
- All Subjects: Mathematics
- Creators: Berman, Spring
Description
The Autonomous Vehicle (AV), also known as self-driving car, promises to be a game changer for the transportation industry. This technology is predicted to drastically reduce the number of traffic fatalities due to human error [21].
However, road driving at any reasonable speed involves some risks. Therefore, even with high-tech AV algorithms and sophisticated sensors, there may be unavoidable crashes due to imperfection of the AV systems, or unexpected encounters with wildlife, children and pedestrians. Whenever there is a risk involved, there is the need for an ethical decision to be made [33].
While ethical and moral decision-making in humans has long been studied by experts, the advent of artificial intelligence (AI) also calls for machine ethics. To study the different moral and ethical decisions made by humans, experts may use the Trolley Problem [34], which is a scenario where one must pull a switch near a trolley track to redirect the trolley to kill one person on the track or do nothing, which will result in the deaths of five people. While it is important to take into account the input of members of a society and perform studies to understand how humans crash during unavoidable accidents to help program moral and ethical decision-making into self-driving cars, using the classical trolley problem is not ideal, as it is unrealistic and does not represent moral situations that people face in the real world.
This work seeks to increase the realism of the classical trolley problem for use in studies on moral and ethical decision-making by simulating realistic driving conditions in an immersive virtual environment with unavoidable crash scenarios, to investigate how drivers crash during these scenarios. Chapter 1 gives an in-depth background into autonomous vehicles and relevant ethical and moral problems; Chapter 2 describes current state-of-the-art online tools and simulators that were developed to study moral decision-making during unavoidable crashes. Chapters 3 focuses on building the simulator and the design of the crash scenarios. Chapter 4 describes human subjects experiments that were conducted with the simulator and their results, and Chapter 5 provides conclusions and avenues for future work.
However, road driving at any reasonable speed involves some risks. Therefore, even with high-tech AV algorithms and sophisticated sensors, there may be unavoidable crashes due to imperfection of the AV systems, or unexpected encounters with wildlife, children and pedestrians. Whenever there is a risk involved, there is the need for an ethical decision to be made [33].
While ethical and moral decision-making in humans has long been studied by experts, the advent of artificial intelligence (AI) also calls for machine ethics. To study the different moral and ethical decisions made by humans, experts may use the Trolley Problem [34], which is a scenario where one must pull a switch near a trolley track to redirect the trolley to kill one person on the track or do nothing, which will result in the deaths of five people. While it is important to take into account the input of members of a society and perform studies to understand how humans crash during unavoidable accidents to help program moral and ethical decision-making into self-driving cars, using the classical trolley problem is not ideal, as it is unrealistic and does not represent moral situations that people face in the real world.
This work seeks to increase the realism of the classical trolley problem for use in studies on moral and ethical decision-making by simulating realistic driving conditions in an immersive virtual environment with unavoidable crash scenarios, to investigate how drivers crash during these scenarios. Chapter 1 gives an in-depth background into autonomous vehicles and relevant ethical and moral problems; Chapter 2 describes current state-of-the-art online tools and simulators that were developed to study moral decision-making during unavoidable crashes. Chapters 3 focuses on building the simulator and the design of the crash scenarios. Chapter 4 describes human subjects experiments that were conducted with the simulator and their results, and Chapter 5 provides conclusions and avenues for future work.
ContributorsKankam, Immanuella (Author) / Berman, Spring (Thesis advisor) / Johnson, Kathryn (Committee member) / Yong, Sze Zheng (Committee member) / Arizona State University (Publisher)
Created2019
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
Robotic systems are outmatched by the abilities of the human hand to perceive and manipulate the world. Human hands are able to physically interact with the world to perceive, learn, and act to accomplish tasks. Limitations of robotic systems to interact with and manipulate the world diminish their usefulness. In order to advance robot end effectors, specifically artificial hands, rich multimodal tactile sensing is needed. In this work, a multi-articulating, anthropomorphic robot testbed was developed for investigating tactile sensory stimuli during finger-object interactions. The artificial finger is controlled by a tendon-driven remote actuation system that allows for modular control of any tendon-driven end effector and capabilities for both speed and strength. The artificial proprioception system enables direct measurement of joint angles and tendon tensions while temperature, vibration, and skin deformation are provided by a multimodal tactile sensor. Next, attention was focused on real-time artificial perception for decision-making. A robotic system needs to perceive its environment in order to make decisions. Specific actions such as “exploratory procedures” can be employed to classify and characterize object features. Prior work on offline perception was extended to develop an anytime predictive model that returns the probability of having touched a specific feature of an object based on minimally processed sensor data. Developing models for anytime classification of features facilitates real-time action-perception loops. Finally, by combining real-time action-perception with reinforcement learning, a policy was learned to complete a functional contour-following task: closing a deformable ziplock bag. The approach relies only on proprioceptive and localized tactile data. A Contextual Multi-Armed Bandit (C-MAB) reinforcement learning algorithm was implemented to maximize cumulative rewards within a finite time period by balancing exploration versus exploitation of the action space. Performance of the C-MAB learner was compared to a benchmark Q-learner that eventually returns the optimal policy. To assess robustness and generalizability, the learned policy was tested on variations of the original contour-following task. The work presented contributes to the full range of tools necessary to advance the abilities of artificial hands with respect to dexterity, perception, decision-making, and learning.
ContributorsHellman, Randall Blake (Author) / Santos, Veronica J (Thesis advisor) / Artemiadis, Panagiotis K (Committee member) / Berman, Spring (Committee member) / Helms Tillery, Stephen I (Committee member) / Fainekos, Georgios (Committee member) / Arizona State University (Publisher)
Created2016
Description
Interest in Micro Aerial Vehicle (MAV) research has surged over the past decade. MAVs offer new capabilities for intelligence gathering, reconnaissance, site mapping, communications, search and rescue, etc. This thesis discusses key modeling and control aspects of flapping wing MAVs in hover. A three degree of freedom nonlinear model is used to describe the flapping wing vehicle. Averaging theory is used to obtain a nonlinear average model. The equilibrium of this model is then analyzed. A linear model is then obtained to describe the vehicle near hover. LQR is used to as the main control system design methodology. It is used, together with a nonlinear parameter optimization algorithm, to design a family multivariable control system for the MAV. Critical performance trade-offs are illuminated. Properties at both the plant output and input are examined. Very specific rules of thumb are given for control system design. The conservatism of the rules are also discussed. Issues addressed include
What should the control system bandwidth be vis--vis the flapping frequency (so that averaging the nonlinear system is valid)?
When is first order averaging sufficient? When is higher order averaging necessary?
When can wing mass be neglected and when does wing mass become critical to model?
This includes how and when the rules given can be tightened; i.e. made less conservative.
What should the control system bandwidth be vis--vis the flapping frequency (so that averaging the nonlinear system is valid)?
When is first order averaging sufficient? When is higher order averaging necessary?
When can wing mass be neglected and when does wing mass become critical to model?
This includes how and when the rules given can be tightened; i.e. made less conservative.
ContributorsBiswal, Shiba (Author) / Rodriguez, Armando (Thesis advisor) / Mignolet, Marc (Thesis advisor) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2015
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
Millions of individuals suffer from gait impairments due to stroke or other neurological disorders. A primary goal of patients is to walk independently, but most patients only achieve a poor functional outcome five years after injury. Despite the growing interest in using robotic devices for rehabilitation of sensorimotor function, state-of-the-art robotic interventions in gait therapy have not resulted in improved outcomes when compared to traditional treadmill-based therapy. Because bipedal walking requires neural coupling and dynamic interactions between the legs, a fundamental understanding of the sensorimotor mechanisms of inter-leg coordination during walking is needed to inform robotic interventions in gait therapy. This dissertation presents a systematic exploration of sensorimotor mechanisms of inter-leg coordination by studying the effect of unilateral perturbations of the walking surface stiffness on contralateral muscle activation in healthy populations. An analysis of the contribution of several sensory modalities to the muscle activation of the opposite leg provides new insight into the sensorimotor control mechanisms utilized in human walking, including the role of supra-spinal neural circuits in inter-leg coordination. Based on these insights, a model is created which relates the unilateral deflection of the walking surface to the resulting neuromuscular activation in the opposite leg. Additionally, case studies with hemiplegic walkers indicate the existence of the observed mechanism in neurologically impaired walkers. The results of this dissertation suggest a novel approach to gait therapy for hemiplegic patients in which desired muscle activity is evoked in the impaired leg by only interacting with the healthy leg. One of the most significant advantages of this approach over current rehabilitation protocols is the safety of the patient since there is no direct manipulation of the impaired leg. Therefore, the methods and results presented in this dissertation represent a potential paradigm shift in robot-assisted gait therapy.
ContributorsSkidmore, Jeffrey Alan (Author) / Artemiadis, Panagiotis (Thesis advisor) / Santello, Marco (Committee member) / Berman, Spring (Committee member) / Lee, Hyunglae (Committee member) / Marvi, Hamidreza (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
Vehicles traverse granular media through complex reactions with large numbers of small particles. Many approaches rely on empirical trends derived from wheeled vehicles in well-characterized media. However, the environments of numerous bodies such as Mars or the moon are primarily composed of fines called regolith which require different design considerations. This dissertation discusses research aimed at understanding the role and function of empirical, computational, and theoretical granular physics approaches as they apply to helical geometries, their envelope of applicability, and the development of new laws. First, a static Archimedes screw submerged in granular material (glass beads) is analyzed using two methods: Granular Resistive Force Theory (RFT), an empirically derived set of equations based on fluid dynamic superposition principles, and Discrete element method (DEM) simulations, a particle modeling software. Dynamic experiments further confirm the computational method with multi-body dynamics (MBD)-DEM co-simulations. Granular Scaling Laws (GSL), a set of physics relationships based on non-dimensional analysis, are utilized for the gravity-modified environments. A testing chamber to contain a lunar analogue, BP-1, is developed and built. An investigation of straight and helical grousered wheels in both silica sand and BP-1 is performed to examine general GSL applicability for lunar purposes. Mechanical power draw and velocity prediction by GSL show non-trivial but predictable deviation. BP-1 properties are characterized and applied to an MBD-DEM environment for the first time. MBD-DEM simulation results between Earth gravity and lunar gravity show good agreement with theoretical predictions for both power and velocity. The experimental deviation is further investigated and found to have a mass-dependant component driven by granular sinkage and engagement. Finally, a robust set of helical granular scaling laws (HGSL) are derived. The granular dynamics scaling of three-dimensional screw-driven mobility is reduced to a similar theory as wheeled scaling laws, provided the screw is radially continuous. The new laws are validated in BP-1 with results showing very close agreement to predictions. A gravity-variant version of these laws is validated with MBD-DEM simulations. The results of the dissertation suggest GSL, HGSL, and MBD-DEM give reasonable approximations for use in lunar environments to predict rover mobility given adequate granular engagement.
ContributorsThoesen, Andrew Lawrence (Author) / Marvi, Hamidreza (Thesis advisor) / Berman, Spring (Committee member) / Emady, Heather (Committee member) / Lee, Hyunglae (Committee member) / Klesh, Andrew (Committee member) / Arizona State University (Publisher)
Created2019
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