Matching Items (2)
Filtering by
- Member of: ASU Electronic Theses and Dissertations

Description
This thesis describes a longitudinal dynamic analysis of a large, twin-fuselage aircraft that is connected solely by the main wing with two tails unattached by a horizontal stabilizer. The goal of the analysis is to predict the aircraft’s behavior in various flight conditions. Starting with simple force diagrams of the longitudinal directions, six equations of motion are derived: three equations defining the left fuselage’s motion and three equations defining the right fuselage’s motion. The derivation uses a state-vector approach. Linearization of the system utilizes a Taylor series expansion about different trim points to analyze the aircraft for small disturbances about the equilibrium. The state transition matrix shows that there is a coupling effect from the reactionary moments caused by the two empennages through the connection of the main wing. By analyzing the system in multiple flight conditions: take-off, climb, cruise, and post-separation of payload, a general flight envelope can be developed which will give insight as to how the aircraft will behave and the overall controllability of the aircraft. The four flight conditions are tested with published Boeing 747 data confirmed from multiple sources. All four flight conditions contain unstable phugoid modes that imply instability increases with decreasing torsional spring stiffness of the wing or as the structural damping drops below 4%.
ContributorsSpiller, Ryan K (Author) / Wells, Valana (Thesis advisor) / Garrett, Frederick (Committee member) / Grewal, Anoop (Committee member) / Arizona State University (Publisher)
Created2017

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 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