This collection includes both ASU Theses and Dissertations, submitted by graduate students, and the Barrett, Honors College theses submitted by undergraduate students. 

Displaying 1 - 6 of 6
Filtering by

Clear all filters

Description

This thesis presents the design and simulation of an energy efficient controller for a system of three drones transporting a payload in a net. The object ensnared in the net is represented as a mass connected by massless stiff springs to each drone. Both a pole-placement approach and an optimal

This thesis presents the design and simulation of an energy efficient controller for a system of three drones transporting a payload in a net. The object ensnared in the net is represented as a mass connected by massless stiff springs to each drone. Both a pole-placement approach and an optimal control approach are used to design a trajectory controller for the system. Results are simulated for a single drone and the three drone system both without and with payload.

ContributorsHayden, Alexander (Author) / Grewal, Anoop (Thesis director) / Berman, Spring (Committee member) / Barrett, The Honors College (Contributor) / Mechanical and Aerospace Engineering Program (Contributor) / Historical, Philosophical & Religious Studies, Sch (Contributor)
Created2022-05
187764-Thumbnail Image.png
Description
This thesis considers the problem of multi-robot task allocation with inter-agent distance constraints, e.g., due to the presence of physical tethers or communication requirements, that must be satisfied at all times. Specifically, three optimization-based formulations are explored: (i) a “Naive Method” that leverages the classical multiple traveling salesman (mTSP) formulation

This thesis considers the problem of multi-robot task allocation with inter-agent distance constraints, e.g., due to the presence of physical tethers or communication requirements, that must be satisfied at all times. Specifically, three optimization-based formulations are explored: (i) a “Naive Method” that leverages the classical multiple traveling salesman (mTSP) formulation to find solutions that are then filtered out when the inter-agent distance constraints are violated, (ii) a “Timed Method” thatconstructs a new formulation that explicitly accounts for robot timings, including the inter-agent distance constraints, and (iii) an “Improved Naive Method” that reformulates the Naive Method with a novel graph-traversal algorithm to produce tours that, unlike the Naive Method, allow backtracking and also introduces a more systematic approach to filter out solutions that violate inter-agent distance constraints. The effectiveness of the approaches to return task allocations that satisfy the constraints are demonstrated and compared in simulation experiments.
ContributorsGoodwin, Walter Alexander (Author) / Yong, Sze Zheng (Thesis advisor) / Grewal, Anoop (Thesis advisor) / Xu, Zhe (Committee member) / Arizona State University (Publisher)
Created2023
Description

This project compared two optimization-based formulations for solving multi-robot task allocation problems with tether constraints. The first approach, or the ”Iterative Method,” used the common multiple traveling salesman (mTSP) formulation and implemented an algorithm over the formulation to filter out solutions that failed to satisfy the tether constraint. The second

This project compared two optimization-based formulations for solving multi-robot task allocation problems with tether constraints. The first approach, or the ”Iterative Method,” used the common multiple traveling salesman (mTSP) formulation and implemented an algorithm over the formulation to filter out solutions that failed to satisfy the tether constraint. The second approach, named the ”Timing Formulation,” involved constructing a new formulation specifically designed account for robot timings, including the tether constraint in the formulation itself. The approaches were tested against each other in 10-city simulations and the results were compared. The Iterative Method could provide answers in 1- and 2-norm variations quickly, but its mTSP model formulation broke down and became infeasible at low city numbers. The 1-norm Timing Formulation quickly and reliably produced solutions but faced high computation times in its 2-norm manifestation. Ultimately, while the Timing Formulation is a more optimal method for solving tether-constrained task allocation problems, its reliance on the 1-norm for low computation times causes it to sacrifice some realism.

ContributorsGoodwin, Walter (Author) / Yong, Sze Zheng (Thesis director) / Grewal, Anoop (Committee member) / Barrett, The Honors College (Contributor) / Mechanical and Aerospace Engineering Program (Contributor)
Created2022-05
164614-Thumbnail Image.png
ContributorsGoodwin, Walter (Author) / Yong, Sze Zheng (Thesis director) / Grewal, Anoop (Committee member) / Barrett, The Honors College (Contributor) / Mechanical and Aerospace Engineering Program (Contributor)
Created2022-05
164615-Thumbnail Image.png
ContributorsGoodwin, Walter (Author) / Yong, Sze Zheng (Thesis director) / Grewal, Anoop (Committee member) / Barrett, The Honors College (Contributor) / Mechanical and Aerospace Engineering Program (Contributor)
Created2022-05
166149-Thumbnail Image.png
Description

The objective goal of this research is to maximize the speed of the end effector of a three link R-R-R mechanical system with constrained torque input control. The project utilizes MATLAB optimization tools to determine the optimal throwing motion of a simulated mechanical system, while mirroring the physical parameters and

The objective goal of this research is to maximize the speed of the end effector of a three link R-R-R mechanical system with constrained torque input control. The project utilizes MATLAB optimization tools to determine the optimal throwing motion of a simulated mechanical system, while mirroring the physical parameters and constraints of a human arm wherever possible. The analysis of this final result determines if the kinetic chain effect is present in the theoretically optimized solution. This is done by comparing it with an intuitively optimized system based on throwing motion derived from the forehand throw in Ultimate frisbee.

ContributorsHartmann, Julien (Author) / Grewal, Anoop (Thesis director) / Redkar, Sangram (Committee member) / Barrett, The Honors College (Contributor) / School of International Letters and Cultures (Contributor) / Mechanical and Aerospace Engineering Program (Contributor)
Created2022-05