Matching Items (105)
168583-Thumbnail Image.png
Description
Technological progress in robot sensing, design, and fabrication, and the availability of open source software frameworks such as the Robot Operating System (ROS), are advancing the applications of swarm robotics from toy problems to real-world tasks such as surveillance, precision agriculture, search-and-rescue, and infrastructure inspection. These applications will require the

Technological progress in robot sensing, design, and fabrication, and the availability of open source software frameworks such as the Robot Operating System (ROS), are advancing the applications of swarm robotics from toy problems to real-world tasks such as surveillance, precision agriculture, search-and-rescue, and infrastructure inspection. These applications will require the development of robot controllers and system architectures that scale well with the number of robots and that are robust to robot errors and failures. To achieve this, one approach is to design decentralized robot control policies that require only local sensing and local, ad-hoc communication. In particular, stochastic control policies can be designed that are agnostic to individual robot identities and do not require a priori information about the environment or sophisticated computation, sensing, navigation, or communication capabilities. This dissertation presents novel swarm control strategies with these properties for detecting and mapping static targets, which represent features of interest, in an unknown, bounded, obstacle-free environment. The robots move on a finite spatial grid according to the time-homogeneous transition probabilities of a Discrete-Time Discrete-State (DTDS) Markov chain model, and they exchange information with other robots within their communication range using a consensus (agreement) protocol. This dissertation extend theoretical guarantees on multi-robot consensus over fixed and time-varying communication networks with known connectivity properties to consensus over the networks that have Markovian switching dynamics and no presumed connectivity. This dissertation develops such swarm consensus strategies for detecting a single feature in the environment, tracking multiple features, and reconstructing a discrete distribution of features modeled as an occupancy grid map. The proposed consensus approaches are validated in numerical simulations and in 3D physics-based simulations of quadrotors in Gazebo. The scalability of the proposed approaches is examined through extensive numerical simulation studies over different swarm populations and environment sizes.
ContributorsShirsat, Aniket (Author) / Berman, Spring (Thesis advisor) / Lee, Hyunglae (Committee member) / Marvi, Hamid (Committee member) / Saripalli, Srikanth (Committee member) / Gharavi, Lance (Committee member) / Arizona State University (Publisher)
Created2022
168490-Thumbnail Image.png
Description
Modern life is full of challenging optimization problems that we unknowingly attempt to solve. For instance, a common dilemma often encountered is the decision of picking a parking spot while trying to minimize both the distance to the goal destination and time spent searching for parking; one strategy is to

Modern life is full of challenging optimization problems that we unknowingly attempt to solve. For instance, a common dilemma often encountered is the decision of picking a parking spot while trying to minimize both the distance to the goal destination and time spent searching for parking; one strategy is to drive as close as possible to the goal destination but risk a penalty cost if no parking spaces can be found. Optimization problems of this class all have underlying time-varying processes that can be altered by a decision/input to minimize some cost. Such optimization problems are commonly solved by a class of methods called Dynamic Programming (DP) that breaks down a complex optimization problem into a simpler family of sub-problems. In the 1950s Richard Bellman introduced a class of DP methods that broke down Multi-Stage Optimization Problems (MSOP) into a nested sequence of ``tail problems”. Bellman showed that for any MSOP with a cost function that satisfies a condition called additive separability, the solution to the tail problem of the MSOP initialized at time-stage k>0 can be used to solve the tail problem initialized at time-stage k-1. Therefore, by recursively solving each tail problem of the MSOP, a solution to the original MSOP can be found. This dissertation extends Bellman`s theory to a broader class of MSOPs involving non-additively separable costs by introducing a new state augmentation solution method and generalizing the Bellman Equation. This dissertation also considers the analogous continuous-time counterpart to discrete-time MSOPs, called Optimal Control Problems (OCPs). OCPs can be solved by solving a nonlinear Partial Differential Equation (PDE) called the Hamilton-Jacobi-Bellman (HJB) PDE. Unfortunately, it is rarely possible to obtain an analytical solution to the HJB PDE. This dissertation proposes a method for approximately solving the HJB PDE based on Sum-Of-Squares (SOS) programming. This SOS algorithm can be used to synthesize controllers, hence solving the OCP, and also compute outer bounds of reachable sets of dynamical systems. This methodology is then extended to infinite time horizons, by proposing SOS algorithms that yield Lyapunov functions that can approximate regions of attraction and attractor sets of nonlinear dynamical systems arbitrarily well.
ContributorsJones, Morgan (Author) / Peet, Matthew M (Thesis advisor) / Nedich, Angelia (Committee member) / Kawski, Matthias (Committee member) / Mignolet, Marc (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2021
168443-Thumbnail Image.png
Description
Object sorting is a very common application especially in the industry setting, but this is a labor intensive and time consuming process and it proves to be challenging if done manually. Thanks to the rapid development in technology now almost all these object sorting tasks are partially or completely automated.

Object sorting is a very common application especially in the industry setting, but this is a labor intensive and time consuming process and it proves to be challenging if done manually. Thanks to the rapid development in technology now almost all these object sorting tasks are partially or completely automated. Image processing techniques are essential for the full operation of such a pick and place robot as it is responsible for perceiving the environment and to correctly identify ,classify and localize the different objects in it. In order for the robots to perform accurate object sorting with efficiency and stability this thesis discusses how different Deep learning based perception techniques can be used. In the era of Artificial Intelligence this sorting problem can be done more efficiently than the existing techniques. This thesis presents different image processing techniques and algorithms that can be used to perform object sorting efficiently. A comparison between three different deep learning based techniques is presented and their pros and cons are discussed. Furthermore this thesis also presents a comprehensive study about the kinematics and the dynamics involved in a 2 Degree of Freedom Robotic Manipulator .
ContributorsRanganathan, Pavithra (Author) / Rodriguez, Armando (Thesis advisor) / Si, Jennie (Committee member) / Berman, Spring (Committee member) / Arizona State University (Publisher)
Created2021
161969-Thumbnail Image.png
Description
This thesis lays down a foundation for more advanced work on bipeds by carefully examining cart-inverted pendulum systems (CIPS, often used to approximate each leg of a biped) and associated closed loop performance tradeoffs. A CIPS is characterized by an instability (associated with the tendency of the pendulum

This thesis lays down a foundation for more advanced work on bipeds by carefully examining cart-inverted pendulum systems (CIPS, often used to approximate each leg of a biped) and associated closed loop performance tradeoffs. A CIPS is characterized by an instability (associated with the tendency of the pendulum to fall) and a right half plane (RHP, non-minimum phase) zero (associated with the cart displacement x). For such a system, the zero is typically close to (and smaller) than the instability. As such, a classical PK control structure would result in very poor sensitivity properties.It is therefore common to use a hierarchical inner-outer loop structure. As such, this thesis examines how such a structure can be used to improve sensitivity properties beyond a classic PK structure and systematically tradeoff sensitivity properties at the plant input/output. While the instability requires a minimum bandwidth at the plant input, the RHP zero imposes a maximum bandwidth on the cart displacement x. Three CIPs are examined – one with a long, short and an intermediately sized pendulum. We show that while the short pendulum system is the most unstable and requires the largest bandwidth at the plant input for stabilization (hardest to control), it also has the largest RHP zero. Consequently, it will permit the largest cart displacement x-bandwidth, and hence, one can argue that the short pendulum system is easiest to control. Similarly, the long pendulum system is the least unstable and requires smallest bandwidth at the plant input for stabilization (easiest to control). However, because this system also possesses the smallest RHP zero it will permit the smallest cart displacement x-bandwidth, and hence, one can argue that the long pendulum system is the hardest to control. Analogous “intermediate conclusions” can be drawn for the system with the “intermediately sized” pendulum. A set of simple academic examples (growing in plant and controller complexity) are introduced to illustrate basic tradeoffs and guide the presentation of the trade studies.
ContributorsSarkar, Soham (Author) / Rodriguez, Armando (Thesis advisor) / Berman, Spring (Thesis advisor) / Marvi, Hamidreza (Committee member) / Arizona State University (Publisher)
Created2021
166209-Thumbnail Image.png
Description

The future of driving is largely headed towards autonomous vehicles, and this is clear with companies such as Tesla, Waymo, and even tech giant Apple. Many professionals predict that autonomous vehicles will likely be commercially available and legal to use in some places by the late 2020s [15]. There are

The future of driving is largely headed towards autonomous vehicles, and this is clear with companies such as Tesla, Waymo, and even tech giant Apple. Many professionals predict that autonomous vehicles will likely be commercially available and legal to use in some places by the late 2020s [15]. There are some benefits to the rapid development of autonomous vehicle controllers, such as more independence for those who can’t drive due to impairments, the potential for reduced traffic, as well as possibly decreasing the number of accidents. Though these are promising prospects, there are ethical concerns regarding the implementation of such technology. The goal of this thesis is to provide an introductory literature review that discusses the history of autonomous vehicles, different levels of autonomy, ethical considerations in autonomous systems, and prior work on characterizing human driving behaviors and implementing these behaviors with autonomous vehicle controllers. Finally, recommendations are proposed for data collection on human driving behaviors in an ongoing NSF-funded project at Arizona State University, “Embodiment of Human Values Profiles in Autonomous Vehicles via Psychomimetic Controller Design.”

ContributorsYoung, Brittine (Author) / Berman, Spring (Thesis director) / Johnson, Kathryn (Committee member) / Barrett, The Honors College (Contributor) / Department of Physics (Contributor) / Historical, Philosophical & Religious Studies, Sch (Contributor) / Mechanical and Aerospace Engineering Program (Contributor)
Created2022-05
166235-Thumbnail Image.png
Description
Within the scope of Humanitarian Assistance and Disaster Relief (HADR), this thesis reviews some major challenges during mass evacuations, illustrated by incidents during actual mass evacuation scenarios, and identifies several potential applications of autonomous unmanned aerial vehicles (UAVs) in the effort to ease the transition of evacuees out of a

Within the scope of Humanitarian Assistance and Disaster Relief (HADR), this thesis reviews some major challenges during mass evacuations, illustrated by incidents during actual mass evacuation scenarios, and identifies several potential applications of autonomous unmanned aerial vehicles (UAVs) in the effort to ease the transition of evacuees out of a disaster area. System requirements and example UAV platforms are identified for applications in which autonomous UAVs monitor traffic conditions along evacuation routes, distribute information to the public, and establish a communications network for first responders.
ContributorsTaylor, Zachary (Author) / Berman, Spring (Thesis director) / Gerber, Brian (Committee member) / Barrett, The Honors College (Contributor) / Mechanical and Aerospace Engineering Program (Contributor)
Created2022-05
191009-Thumbnail Image.png
Description
Walking and mobility are essential aspects of our daily lives, enabling us to engage in various activities. Gait disorders and impaired mobility are widespread challenges faced by older adults and people with neurological injuries, as these conditions can significantly impact their quality of life, leading to a loss of independence

Walking and mobility are essential aspects of our daily lives, enabling us to engage in various activities. Gait disorders and impaired mobility are widespread challenges faced by older adults and people with neurological injuries, as these conditions can significantly impact their quality of life, leading to a loss of independence and an increased risk of mortality. In response to these challenges, rehabilitation, and assistive robotics have emerged as promising alternatives to conventional gait therapy, offering potential solutions that are less labor-intensive and costly. Despite numerous advances in wearable lower-limb robotics, their current applicability remains confined to laboratory settings. To expand their utility to broader gait impairments and daily living conditions, there is a pressing need for more intelligent robot controllers. In this dissertation, these challenges are tackled from two perspectives: First, to improve the robot's understanding of human motion and intentions which is crucial for assistive robot control, a robust human locomotion estimation technique is presented, focusing on measuring trunk motion. Employing an invariant extended Kalman filtering method that takes sensor misplacement into account, improved convergence properties over the existing methods for different locomotion modes are shown. Secondly, to enhance safe and effective robot-aided gait training, this dissertation proposes to directly learn from physical therapists' demonstrations of manual gait assistance in post-stroke rehabilitation. Lower-limb kinematics of patients and assistive force applied by therapists to the patient's leg are measured using a wearable sensing system which includes a custom-made force sensing array. The collected data is then used to characterize a therapist's strategies. Preliminary analysis indicates that knee extension and weight-shifting play pivotal roles in shaping a therapist's assistance strategies, which are then incorporated into a virtual impedance model that effectively captures high-level therapist behaviors throughout a complete training session. Furthermore, to introduce safety constraints in the design of such controllers, a safety-critical learning framework is explored through theoretical analysis and simulations. A safety filter incorporating an online iterative learning component is introduced to bring robust safety guarantees for gait robotic assistance and training, addressing challenges such as stochasticity and the absence of a known prior dynamic model.
ContributorsRezayat Sorkhabadi, Seyed Mostafa (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
193483-Thumbnail Image.png
Description
Shape memory alloys (SMAs) are a class of smart materials that can recover their predetermined shape when subjected to an appropriate thermal cycle. This unique property makes SMAs attractive for actuator applications, where the material’s phase transformation can be used to generate controlled motion or force. The actuator design leverages

Shape memory alloys (SMAs) are a class of smart materials that can recover their predetermined shape when subjected to an appropriate thermal cycle. This unique property makes SMAs attractive for actuator applications, where the material’s phase transformation can be used to generate controlled motion or force. The actuator design leverages the one-way shape memory effect of NiTi (Nickel-Titanium) alloy wire, which contracts upon heating and recovers its original length when cooled. A bias spring opposes the SMA wire contraction, enabling a cyclical actuation motion. Thermal actuation is achieved through joule heating by passing an electric current through the SMA wire. This thesis presents the design of a compact, lightweight SMA-based actuator, providing controlled and precise motion in various engineering applications. A design of a soft actuator is presented exploiting the responses of the shape memory alloy (SMA) to trigger intrinsically mono-stable shape reconfiguration. The proposed class of soft actuators will perform bending actuation by selectively activating the SMA. The transition sequences were optimized by geometric parameterizations and energy-based criteria. The reconfigured structure is capable of arbitrary bending, which is reported here. The proposed class of robots has shown promise as a fast actuator or shape reconfigurable structure, which will bring new capabilities in future long-duration missions in space or undersea, as well as in bio-inspired robotics.
ContributorsShankar, Kaushik (Author) / Ma, Leixin (Thesis advisor) / Berman, Spring (Committee member) / Marvi, Hamidreza (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
193651-Thumbnail Image.png
Description
Origami, the Japanese art of paper folding, has come a long way from its traditionalroots. It’s now being used in modern engineering and design. In this thesis, I explored multi-stable origami structures. These structures can hold multiple stable shapes, which could have a big impact on various technologies. I aim to break

Origami, the Japanese art of paper folding, has come a long way from its traditionalroots. It’s now being used in modern engineering and design. In this thesis, I explored multi-stable origami structures. These structures can hold multiple stable shapes, which could have a big impact on various technologies. I aim to break down the complex ideas behind these structures and explain their potential applications in a way that’s easy to understand. In this research, I looked at the history of origami and recent developments in computational design to create and study multi-stable origami structures. I used computer tools like parametric modeling software and finite element analysis to come up with new origami designs. These tools helped me create, improve, and test these designs with a level of accuracy and speed that hadn’t been possible before. The process begins with the formulation of design principles rooted in the fundamental geometry and mechanics of origami. Leveraging mathematical algorithms and optimization techniques, diverse sets of origami crease patterns are generated, each tailored to exhibit specific multi-stable behaviors. Through iterative refinement and simulation-driven design, optimal solutions are identified, leading to the realization of intricate origami morphologies that defy traditional design constraints. Furthermore, the technological implications of multi-stable origami structures are explored across a spectrum of applications. In robotics, these structures serve as foundational building blocks for reconfigurable mechanisms capable of adapting to dynamic environments and tasks. In aerospace engineering, they enable the development of lightweight, deployable structures for space exploration and satellite deployment. In architecture, they inspire innovative approaches to adaptive building envelopes and kinetic facades, enhancing sustainability and user experience. In summary, this thesis presents a comprehensive exploration of multi-stable origami structures, from their generation through computational design methodologies to their application across diverse technological domains. By pushing the boundaries of traditional design paradigms and embracing the synergy between art, science, and technology, this research opens new frontiers for innovation and creativity in the realm of origami-inspired engineering.
ContributorsRayala, Sri Ratna Kumar (Author) / Ma, Leixin L (Thesis advisor) / Berman, Spring (Committee member) / Marvi, Hamidreza (Committee member) / Arizona State University (Publisher)
Created2024