Matching Items (209)
Description
Building and optimizing a design for deformable media can be extremely costly. However, granular scaling laws enable the ability to predict system velocity and mobility
power consumption by testing at a smaller scale in the same environment. The validity of
the granular scaling laws for arbitrarily shaped wheels and screws were evaluated in
materials like silica sand and BP-1, a lunar simulant. Different wheel geometries, such as
non-grousered and straight and bihelically grousered wheels were created and tested
using 3D printed technologies. Using the granular scaling laws and the empirical data
from initial experiments, power and velocity were predicted for a larger scaled version
then experimentally validated on a dynamic mobility platform. Working with granular
media has high variability in material properties depending on initial environmental
conditions, so particular emphasis was placed on consistency in the testing methodology.
Through experiments, these scaling laws have been validated with defined use cases and
limitations.
ContributorsMcbryan, Teresa (Author) / Marvi, Hamidreza (Thesis advisor) / Berman, Spring (Committee member) / Lee, Hyunglae (Committee member) / Arizona State University (Publisher)
Created2022
Description
Tubes and pipelines serve as a major component of several units in power plants and oil, gas, and water transmission. These structures undergo extreme conditions, where temperature and pressure vary, leading to corroding of the pipe over time, creating defects in them. A small crack in these tubes can cause major safety problems, so a regular inspection of these tubes is required. Most power plants prefer to use non-destructive testing procedures, such as long-range ultrasonic testing and phased array ultrasonic testing, to name a few. These procedures can be carried out with the help of crawlers that go inside the pipes. One of the main drawbacks of the current robotic tube inspection robots is the lack of maneuverability over complex tubular structures and the inability to traverse non-ferromagnetic pipelines. The main motivation of this project is to create a robotic system that can grab onto ferromagnetic and non-ferromagnetic tubes and move along those, move onto adjacent tubes, and maneuver around flanges and bends in the tube. Furthermore, most of the robots used for inspection rely on roller balls and suction-based components that can allow the robot to hold on to the curved surface of the tube. These techniques fail when the surface is rough or uneven, which has served as an inspiration to look at friction-based solutions. Lizards are known for their agile locomotion, as well as their ability to grab on any surface irrespective of the surface texture. The work presented here is focused on the design and control of a lizard-inspired tube inspection robot that can be used to inspect complex tubular structures made of any material.
ContributorsMasurkar, Nihar Dattaram (Author) / Marvi, Hamidreza (Thesis advisor) / Dehghan-Niri, Ehsan (Committee member) / Lee, Hyunglae (Committee member) / Arizona State University (Publisher)
Created2022
Description
Physical and structural tree measurements are applied in forestry, precision agriculture and conservation for various reasons. Since measuring tree properties manually is tedious, measurements from only a small subset of trees present in a forest, agricultural land or survey site are often used. Utilizing robotics to autonomously estimate physical tree dimensions would speed up the measurement or data collection process and allow for a much larger set of trees to be used in studies. In turn, this would allow studies to make more generalizable inferences about areas with trees. To this end, this thesis focuses on developing a system that generates a semantic representation of the topology of a tree in real-time. The first part describes a simulation environment and a real-world sensor suite to develop and test the tree mapping pipeline proposed in this thesis. The second part presents details of the proposed tree mapping pipeline. Stage one of the mapping pipeline utilizes a deep learning network to detect woody and cylindrical portions of a tree like trunks and branches based on popular semantic segmentation networks. Stage two of the pipeline proposes an algorithm to separate the detected portions of a tree into individual trunk and branch segments. The third stage implements an optimization algorithm to represent each segment parametrically as a cylinder. The fourth stage formulates a multi-sensor factor graph to incrementally integrate and optimize the semantic tree map while also fusing two forms of odometry. Finally, results from all the stages of the tree mapping pipeline using simulation and real-world data are presented. With these implementations, this thesis provides an end-to-end system to estimate tree topology through semantic representations for forestry and precision agriculture applications.
ContributorsVishwanatha, Rakshith (Author) / Das, Jnaneshwar (Thesis advisor) / Martin, Roberta (Committee member) / Throop, Heather (Committee member) / Zhang, Wenlong (Committee member) / Ehsani, Reza (Committee member) / Arizona State University (Publisher)
Created2022
Description
Chemical Reaction Networks (CRNs) provide a useful framework for modeling andcontrolling large numbers of agents that undergo stochastic transitions between a set of states
in a manner similar to chemical compounds. By utilizing CRN models to design agent control
policies, some of the computational challenges in the coordination of multi-agent systems can
be overcome. In this thesis, a CRN model is developed that defines agent control policies for a
multi-agent construction task. The use of surface CRNs to overcome the tradeoff between
speed and accuracy of task performance is explained. The computational difficulties involved
in coordinating multiple agents to complete collective construction tasks is then discussed. A
method for stochastic task and motion planning (TAMP) is proposed to explain how a TAMP
solver can be applied with CRNs to coordinate multiple agents.
This work defines a collective construction scenario in which a group of noncommunicating agents must rearrange blocks on a discrete domain with obstacles into a
predefined target distribution. Four different construction tasks are considered with 10, 20,
30, or 40 blocks, and a simulation of each scenario with 2, 4, 6, or 8 agents is performed. As the
number of blocks increases, the construction problem becomes more complex, and a given
population of agents requires more time to complete the task. Populations of fewer than 8
agents are unable to solve the 30-block and 40-block problems in the allotted simulation time,
suggesting an inflection point for computational feasibility, implying that beyond that point
the solution times for fewer than 8 agents would be expected to increase significantly. For a
group of 8 agents, the time to complete the task generally increases as the number of blocks
increases, except for the 30-block problem, which has specifications that make the task slightly
easier for the agents to complete compared to the 20-block problem. For the 10-block and 20-
block problems, the time to complete the task decreases as the number of agents increases;
however, the marginal effect of each additional two agents on this time decreases. This can be
explained through the pigeonhole principle: since there area finite number of states, when the
number of agents is greater than the number of available spaces, deadlocks start to occur and
the expectation is that the overall solution time to tend to infinity.
ContributorsKamojjhala, Pranav (Author) / Berman, Spring (Thesis advisor) / Fainekos, Gergios E (Thesis advisor) / Pavlic, Theodore P (Committee member) / Arizona State University (Publisher)
Created2022
Description
A Graph Neural Network (GNN) is a type of neural network architecture that operates on data consisting of objects and their relationships, which are represented by a graph. Within the graph, nodes represent objects and edges represent associations between those objects. The representation of relationships and correlations between data is unique to graph structures. GNNs exploit this feature of graphs by augmenting both forms of data, individual and relational, and have been designed to allow for communication and sharing of data within each neural network layer. These benefits allow each node to have an enriched perspective, or a better understanding, of its neighbouring nodes and its connections to those nodes. The ability of GNNs to efficiently process high-dimensional node data and multi-faceted relationships among nodes gives them advantages over neural network architectures such as Convolutional Neural Networks (CNNs) that do not implicitly handle relational data. These quintessential characteristics of GNN models make them suitable for solving problems in which the correspondences among input data are needed to produce an accurate and precise representation of these data. GNN frameworks may significantly improve existing communication and control techniques for multi-agent tasks by implicitly representing not only information associated with the individual agents, such as agent position, velocity, and camera data, but also their relationships with one another, such as distances between the agents and their ability to communicate with one another. One such task is a multi-agent navigation problem in which the agents must coordinate with one another in a decentralized manner, using proximity sensors only, to navigate safely to their intended goal positions in the environment without collisions or deadlocks. The contribution of this thesis is the design of an end-to-end decentralized control scheme for multi-agent navigation that utilizes GNNs to prevent inter-agent collisions and deadlocks. The contributions consist of the development, simulation and evaluation of the performance of an advantage actor-critic (A2C) reinforcement learning algorithm that employs actor and critic networks for training that simultaneously approximate the policy function and value function, respectively. These networks are implemented using GNN frameworks for navigation by groups of 3, 5, 10 and 15 agents in simulated two-dimensional environments. It is observed that in $40\%$ to $50\%$ of the simulation trials, between 70$\%$ to 80$\%$ of the agents reach their goal positions without colliding with other agents or becoming trapped in deadlocks. The model is also compared to a random run simulation, where actions are chosen randomly for the agents and observe that the model performs notably well for smaller groups of agents.
ContributorsAyalasomayajula, Manaswini (Author) / Berman, Spring (Thesis advisor) / Mian, Sami (Committee member) / Pavlic, Theodore (Committee member) / Arizona State University (Publisher)
Created2022
Description
Recently, Generative Adversarial Networks (GANs) have been applied to the problem of Cold-Start Recommendation, but the training performance of these models is hampered by the extreme sparsity in warm user purchase behavior. This thesis introduces a novel representation for user-vectors by combining user demographics and user preferences, making the model a hybrid system which uses Collaborative Filtering and Content Based Recommendation. This system models user purchase behavior using weighted user-product preferences (explicit feedback) rather than binary user-product interactions (implicit feedback). Using this a novel sparse adversarial model, Sparse ReguLarized Generative Adversarial Network (SRLGAN), is developed for Cold-Start Recommendation. SRLGAN leverages the sparse user-purchase behavior which ensures training stability and avoids over-fitting on warm users. The performance of SRLGAN is evaluated on two popular datasets and demonstrate state-of-the-art results.
ContributorsShah, Aksheshkumar Ajaykumar (Author) / Venkateswara, Hemanth (Thesis advisor) / Berman, Spring (Thesis advisor) / Ladani, Leila J (Committee member) / Arizona State University (Publisher)
Created2022
Description
The ability for aerial manipulators to stay aloft while interacting with dynamic environments is critical for successfully in situ data acquisition methods in arboreal environments. One widely used platform utilizes a six degree of freedom manipulator attached to quadcoper or octocopter, to sample a tree leaf by maintaining the system in a hover while the arm pulls the leaf for a sample. Other system are comprised of simpler quadcopter with a fixed mechanical device to physically cut the leaf while the system is manually piloted. Neither of these common methods account or compensate for the variation of inherent dynamics occurring in the arboreal-aerial manipulator interaction effects. This research proposes force and velocity feedback methods to control an aerial manipulation platform while allowing waypoint navigation within the work space to take place. Using these methods requires minimal knowledge of the system and the dynamic parameters. This thesis outlines the Robot Operating System (ROS) based Open Autonomous Air Vehicle (OpenUAV) simulations performed on the purposed three degree of freedom redundant aerial manipulation platform.
ContributorsCohen, Daniel (Author) / Das, Jnaneshwar (Thesis advisor) / Marvi, Hamidreza (Committee member) / Saldaña, David (Committee member) / Arizona State University (Publisher)
Created2022
Description
Soft continuum robots with the ability to bend, twist, elongate, and shorten, similar to octopus arms, have many potential applications, such as dexterous manipulation and navigation through unstructured, dynamic environments. Novel soft materials such as smart hydrogels, which change volume and other properties in response to stimuli such as temperature, pH, and chemicals, can potentially be used to construct soft robots that achieve self-regulated adaptive reconfiguration through on-demand dynamic control of local properties. However, the design of controllers for soft continuum robots is challenging due to their high-dimensional configuration space and the complexity of modeling soft actuator dynamics. To address these challenges, this dissertation presents two different model-based control approaches for robots with distributed soft actuators and sensors and validates the approaches in simulations and physical experiments. It is demonstrated that by choosing an appropriate dynamical model and designing a decentralized controller based on this model, such robots can be controlled to achieve diverse types of complex configurations. The first approach consists of approximating the dynamics of the system, including its actuators, as a linear state-space model in order to apply optimal robust control techniques such as H∞ state-feedback and H∞ output-feedback methods. These techniques are designed to utilize the decentralized control structure of the robot and its distributed sensing and actuation to achieve vibration control and trajectory tracking. The approach is validated in simulation on an Euler-Bernoulli dynamic model of a hydrogel based cantilevered robotic arm and in experiments with a hydrogel-actuated miniature 2-DOF manipulator. The second approach is developed for soft continuum robots with dynamics that can be modeled using Cosserat rod theory. An inverse dynamics control approach is implemented on the Cosserat model of the robot for tracking configurations that include bending, torsion, shear, and extension deformations. The decentralized controller structure facilitates its implementation on robot arms composed of independently-controllable segments that have local sensing and actuation. This approach is validated on simulated 3D robot arms and on an actual silicone robot arm with distributed pneumatic actuation, for which the inverse dynamics problem is solved in simulation and the computed control outputs are applied to the robot in real-time.
ContributorsDoroudchi, Azadeh (Author) / Berman, Spring (Thesis advisor) / Tsakalis, Konstantinos (Committee member) / Si, Jennie (Committee member) / Marvi, Hamid (Committee member) / Arizona State University (Publisher)
Created2022
Description
Over the past decade, fall related injuries and death among individuals 65 and older due to osteosarcopenia have increased significantly. To reduce the risk of recurrent falls among the elderly caused by osteosarcopenia, a soft-body pneumatically stabilizing device is designed. A few different actuation methods are considered, both rigid and soft body actuators, before deciding the best fit for the design goals of the wearable assistive device. Much of the design is developed through numerically modeling and analyzing the human upper body as an inverted pendulum. Through this method, common characteristics of falling behavior are identified to develop a control system that counteracts falling motion with pneumatically produced forces. An emphasis on human-oriented design provides much of the framework for translating the numerical model of forces into a device that prioritizes user comfort without sacrificing assistive performance.
ContributorsJohansen, Max (Author) / Grewal, Anoop (Thesis director) / Marvi, Hamidreza (Committee member) / Barrett, The Honors College (Contributor) / Mechanical and Aerospace Engineering Program (Contributor)
Created2022-12
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