A platform for research: civil engineering, architecture and urbanism
Tradespace exploration for space system architectures : a weighted graph framework
Many systems undergo significant architecture-level change during their lifecycles as a result of exogenous system disturbances (e.g. budget reduction or changes in stakeholder requirements), failure to develop critical technologies, or planned evolution of the system over time. Given the high cost in terms of resources, schedule, and performance of making these changes during system development or operations, it is essential to make these decisions with a thorough understanding of the available options and costs associated with different architecture changes. The analysis of such decisions stems from an understanding of the relationships between architectures in the tradespace, however most architecture tradespace generation tools focus on the modeling and evaluation of individual architectures rather than on modeling how different architectures are related to one another. In this thesis we propose a framework for modeling these relationships based on the evaluation of a pre-existing tradespace for the purpose of analyzing architecture change decisions. This modeling framework is used to discover and evaluate evolutionary pathways through a disorganized tradespace: a process we call tradespace exploration. These pathways can be used to assess architecture selection decisions and to quantitatively compare architecture change decisions against one another, providing a decision analysis tool for system architects. At the core of the framework is the generation of a directed, weighted 'tradespace graph' that serves as a model of the architecture decision making process. Vertices in the tradespace graph are defined by pairings of architectures from the tradespace with asset portfolios, which are the sets of the common elements shared between multiple architectures. The existence of an edge in the graph, which represents a feasible decision to transform from one architecture to another, is determined by the relationship between the asset portfolios of the two vertices. The weight of an edge represents the cost of the corresponding architecture change, with the sum of edge weights along a path through the tradespace representing the total development cost of the architecture evolution. We apply this tradespace exploration framework to two pre-existing architecture tradespaces: the first being the 'HEXANE' tradespace of in-space transportation infrastructures for human exploration beyond low Earth orbit, and the second being the 'SCaN' tradespace of space-based communications network architectures for the relay of data between ground stations and user spacecraft. Using a variety of domain-independent analysis tools and graph search algorithms, we generate several results of potential value to system architects for both applications.
Tradespace exploration for space system architectures : a weighted graph framework
Many systems undergo significant architecture-level change during their lifecycles as a result of exogenous system disturbances (e.g. budget reduction or changes in stakeholder requirements), failure to develop critical technologies, or planned evolution of the system over time. Given the high cost in terms of resources, schedule, and performance of making these changes during system development or operations, it is essential to make these decisions with a thorough understanding of the available options and costs associated with different architecture changes. The analysis of such decisions stems from an understanding of the relationships between architectures in the tradespace, however most architecture tradespace generation tools focus on the modeling and evaluation of individual architectures rather than on modeling how different architectures are related to one another. In this thesis we propose a framework for modeling these relationships based on the evaluation of a pre-existing tradespace for the purpose of analyzing architecture change decisions. This modeling framework is used to discover and evaluate evolutionary pathways through a disorganized tradespace: a process we call tradespace exploration. These pathways can be used to assess architecture selection decisions and to quantitatively compare architecture change decisions against one another, providing a decision analysis tool for system architects. At the core of the framework is the generation of a directed, weighted 'tradespace graph' that serves as a model of the architecture decision making process. Vertices in the tradespace graph are defined by pairings of architectures from the tradespace with asset portfolios, which are the sets of the common elements shared between multiple architectures. The existence of an edge in the graph, which represents a feasible decision to transform from one architecture to another, is determined by the relationship between the asset portfolios of the two vertices. The weight of an edge represents the cost of the corresponding architecture change, with the sum of edge weights along a path through the tradespace representing the total development cost of the architecture evolution. We apply this tradespace exploration framework to two pre-existing architecture tradespaces: the first being the 'HEXANE' tradespace of in-space transportation infrastructures for human exploration beyond low Earth orbit, and the second being the 'SCaN' tradespace of space-based communications network architectures for the relay of data between ground stations and user spacecraft. Using a variety of domain-independent analysis tools and graph search algorithms, we generate several results of potential value to system architects for both applications.
Tradespace exploration for space system architectures : a weighted graph framework
Davison, Peter Leslie (author)
2014
172 pages
Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2014.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 167-172).
Theses
Electronic Resource
English
DSpace@MIT | 2005
|DSpace@MIT | 2005
|