• Corpus ID: 19679553

Tradespace Exploration Approach For Architectural Definition Of In-Space Transportation Infrastructure Systems For Future Human Space Exploration

  title={Tradespace Exploration Approach For Architectural Definition Of In-Space Transportation Infrastructure Systems For Future Human Space Exploration},
  author={Alexander Rudat and Jonathan Battat and Alessandro Aliakbargolkar and Morgan Dwyer and Bruce G. Cameron and Edward F. Crawley},
Current planning activities for human spaceflight development are centered on exploration beyond Earth orbit, focusing primarily on the destinations of the Moon, Near Earth Asteroids (NEAs), and Mars. In order to more effectively define future programs, key system level features impacting mission infrastructure performance and cost must be identified and assessed prior to concept down-selection. This paper presents a framework in which the inspace portion of beyond Earth orbit human exploration… 

Figures from this paper

Space Exploration Systems, Strategies and Solutions
The present thesis describes the PhD research activities dealing with the topic "Space Exploration Systems, Strategies and Solutions". Traveling beyond low Earth orbit is the next step in the
The modeling and evaluation of interplanetary manned missions using system architecting techniques
The development of a systems architecture-level model used to evaluate the in-space transportation portion of manned exploration missions to other rocky bodies in the solar system is described.
In-space transportation infrastructure architecture decisions using a weighted graph approach
This paper transforms a fully enumerated tradespace of architectures for the in-space transportation infrastructure for human exploration of Mars into a weighted graph with nodes corresponding to architecture-technology combinations and edges corresponding to the ability to transition between two architectures.
Technology Portfolio Planning by Weighted Graph Analysis of System Architectures
A method for charting development pathways within a tradespace of potential architectures, with a view to enabling robustness to technology portfolio realization and later architectural changes is presented.
A Method to Establish a Trade-Space of System Requirements and Life Cycle Cost
This paper explores a different philosophy for finding the system requirements; starting with the required system level service provision, but agnostic about the technical quality needed, and investigates a trade-space including the life cycle cost of service provision as a contribution to determining subsystem requirements.
Patterns in System Architecture Decisions
A set of six canonical classes of architectural decisions derived from the tasks described in the system architecture body of knowledge and from real system architecture problems are proposed, intended to be a useful tool for researchers, practitioners, and educators alike.
Tradespace exploration for space system architectures : a weighted graph framework
A framework for modeling relationships based on the evaluation of a pre-existing tradespace for analyzing architecture change decisions is proposed, using a directed, weighted 'tradespace graph' that serves as a model of the architecture decision making process.
Technology Decisions Under Architectural Uncertainty: Informing Investment Decisions Through Tradespace Exploration
United States. National Aeronautics and Space Administration (Massachusetts Institute of Technology Research Grant)


Technology and Architecture: Informing Investment Decisions for the Future of Human Space Exploration
A framework for evaluating technologies in the context of long term system architecture planning for the future human space exploration transportation system is developed and some suggestions of favorable pre-cursor missions to the Moon or NEAs are proposed as preparation for a future Mars exploration mission.
A Practical Architecture for Exploration-Focused Manned Mars Missions Using Chemical Propulsion, Solar Power Generation and In-Situ Resource Utilisation.
In 2001 Mars Society Australia (MSA) commenced researching design concepts for their proposed simulated Mars station ‘MARS-Oz’1 to be located in the South Australian outback. This project is intended
Factors Impacting Habitable Volume Requirements: Results from the 2011 Habitable Volume Workshop
This report documents the results of the Habitable Volume Workshop held April 18-21, 2011 in Houston, TX at the Center for Advanced Space Studies-Universities Space Research Association. The workshop
Gradient Based Optimization Methods for Metamaterial Design
Both level set methods and eigenfunction optimization for representing the topography of a dielectric environment and efficient techniques for using gradient methods to solve different material design problems are discussed.
This paper attempts to examine the claim that PSO has the same effectiveness (finding the true global optimal solution) as the GA but with significantly better computational efficiency by implementing statistical analysis and formal hypothesis testing.
Computers and Intractability: A Guide to the Theory of NP-Completeness
The experiences, understandings, and beliefs that guide the professional practices of teacher educators are explored, and the book paints a picture of a profession that offers huge rewards, alongside challenges and frustrations.
A Systematic Review of Software Development Cost Estimation Studies
A systematic review of previous work identifies 304 software cost estimation papers in 76 journals and classifies the papers according to research topic, estimation approach, research approach, study context and data set to provide a basis for the improvement of software-estimation research.
Some Simplified NP-Complete Graph Problems
The Set-Partitioning Problem: Set Covering with Equality Constraints
This paper gives an enumerative algorithm for the set-partitioning problem, that is, the set-covering problem with equality constraints, and presents computational results for real and randomly
An efficient approximation for the Generalized Assignment Problem