SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
We consider constrained multiple-spacecraft reconfigurations outside of a gravity well in deep space. As opposed to the single-spacecraft scenario, such reconfigurations involve collision avoidance constraints that can be formalized and embedded in a nonconvex.
The increasing demand to improve focusing accuracy and to accommodate higher frequencies in space communications and radio astronomy has created significant challenges for improving the capability of the constituent systems in radio antennas and telescopes. One important system is the radio antenna/telescope backup structure connections. The backup structure is a key element in providing a stable, precise and rigid support for the reflective surface. The ideal connection for these types of structures is rigid and concentric resulting in minimal deformation with stress/strain curves that are linear, repeatable and exhibiting no hysteresis over the entire service load range. Conceivably such a connection could be designed so that the stress/strain curve mimics the stress/strain characteristics of the connecting member in both tension and compression. When this is achieved then such joints can be said to be 'invisible' in the global behavior of the backup structure. At that point, overall reflector deflection becomes more linear and highly predictable. In conjunction with this advantage, optimized backup structure geometries, adaptive reflectors and compensating algorithms can best be applied in producing an instrument of unparalleled performance. This paper introduces Co-Axial Joint (CAJ) technology as the practical and economical means to produce an invisible connection.
The performance of an optical system (for example, a telescope) is limited by the misalignments and manufacturing imperfections of the optical elements in the system. The impact of these misalignments and imperfections can be quantified by the phase variations imparted on light traveling through the system. Phase retrieval is a methodology for determining these variations. Phase retrieval uses images taken with the optical system and using a light source of known shape and characteristics. Unlike interferometric methods, which require an optical reference for comparison, and unlike Shack-Hartmann wavefront sensors that require special optical hardware at the optical system's exit pupil, phase retrieval is an in situ, image-based method for determining the phase variations of light at the system s exit pupil. Phase retrieval can be used both as an optical metrology tool (during fabrication of optical surfaces and assembly of optical systems) and as a sensor used in active, closed-loop control of an optical system, to optimize performance. One class of phase-retrieval algorithms is the iterative transform algorithm (ITA). ITAs estimate the phase variations by iteratively enforcing known constraints in the exit pupil and at the detector, determined from modeled or measured data. The Variable Sampling Mapping (VSM) technique is a new method for enforcing these constraints in ITAs. VSM is an open framework for addressing a wide range of issues that have previously been considered detrimental to high-accuracy phase retrieval, including undersampled images, broadband illumination, images taken at or near best focus, chromatic aberrations, jitter or vibration of the optical system or detector, and dead or noisy detector pixels. The VSM is a model-to-data mapping procedure. In VSM, fully sampled electric fields at multiple wavelengths are modeled inside the phase-retrieval algorithm, and then these fields are mapped to intensities on the light detector, using the properties of the detector and optical system, for comparison with measured data. Ultimately, this model-to-data mapping procedure enables a more robust and accurate way of incorporating the exit-pupil and image detector constraints, which are fundamental to the general class of ITA phase retrieval algorithms.
Numerous tests of various multilayer insulation systems have indicated that there are optimal densities for these systems. However, the only method of calculating this optimal density was by a complex physics based algorithm developed by McIntosh. In the 1970's much data were collected on the performance of these insulation systems with many different variables analyzed. All formulas generated included number of layers and layer density as geometric variables in solving for the heat flux, none of them was in a differentiable form for a single geometric variable. It was recently discovered that by converting the equations from heat flux to thermal conductivity using Fourier's Law, the equations became functions of layer density, temperatures, and material properties only. The thickness and number of layers of the blanket were merged into a layer density. These equations were then differentiated with respect to layer density. By setting the first derivative equal to zero, and solving for the layer density, the critical layer density was determined. Taking a second derivative showed that the critical layer density is a minimum in the function and thus the optimum density for minimal heat leak, this is confirmed by plotting the original function. This method was checked and validated using test data from the Multipurpose Hydrogen Testbed which was designed using McIntosh's algorithm.
This paper discusses a computationally efficient algorithm for estimating the safe maneuvering envelope of damaged aircraft. The algorithm performs a robust reachability analysis through an optimal control formulation while making use of time scale separation and taking into account uncertainties in the aerodynamic derivatives. This approach differs from others since it is physically inspired. This more transparent approach allows interpreting data in each step, and it is assumed that these physical models based upon flight dynamics theory will therefore facilitate certification for future real life applications.
An adjustably-autonomous intelligent systems approach for developing Closed Ecosystems (CESs) is presented, which includes a design concept and preliminary design details for the Controlled Closed-Ecosystem Development System (CCEDS) and the Orbiting Modular Artificial-Gravity Spacecraft (OMAGS). The paper is divided into three sections: CESs, the CCEDS Design Concept, and Orbiting Fractional-Gravity Closed Ecosystems OMAGS design concept. The first section briefly describes Closed EcoSystems (CESs), complex adaptive systems, biomes, microbial microbiomes, and their relevance for the study of astrobiology. This section also discusses initial efforts in the development of Closed Environment Life Support Systems (CELSSs) for sustainable communities in space and on Earth. This section concludes with a discussion of the bioregenerative life support system challenge of and the corresponding consequences due to the inverse relationship of the very small human biomass/non-human biomass ratio overall on the Earth with respect to the extremely large human biomass/non-human-biomass ratio found in cities and the International Space Station. The second section describes the CCEDS design concept, which consists of a population of controlled colonies of CES Modules (CESMs), each an integrated CES, continually generating data for an intelligent system that operates the CESs and their CESMs. A variety of CESM types and their use are briefly described. The CCEDS intelligent system uses an evolutionary computation algorithm described in this section to develop and optimize these CESs to increase their viability duration and the size of the animals they support with the ultimate goal to support populations of humans, both on Earth and in space. The CCEDS architecture, its five control subsystems, and its five evolutionary computation levels are also discussed. The section concludes with a discussion of several CCEDS design strategies. The third section summarizes the OMAGS design concept for a spacecraft with a payload consisting of CESs in an orbiting spacecraft centrifuge that operates for at least 5 years. The spacecraft concept is described including its 150cm-radius centrifuge with a 2 ton & 3,000 liter bioscience payload capacity for 24 CESMs. The centrifuge design has four physical levels for its CESMs, each level subject to a different fractional gravity level. This section presents the spacecraft benefits of being designed and operated such that the spacecraft and payload centrifuge wheel counter-rotate resulting in net zero angular momentum and zero gyroscopic forces. Artificial-gravity generation by centripetal acceleration is also discussed. This section concludes by showing the external specifications of the CESMs and their layout in the centrifuge, followed by discussing the multi-payload module rationale. In tandem, the CCEDS and OMAGS systems can be used to foster gravitational ecosystem research for developing sustainable communities in space and on Earth.
Spatially-resolved observations from the IRIS, SDO/AIA, and other space mission and ground-based telescopes, coupled with realistic 3D RMHD simulations, are a powerful tool for analysis of processes in the solar atmosphere. To better understand the dynamical and thermodynamic properties in the simulation data and their connection to observations, it is essential to determine similarities in the behaviors of the synthesized and observed emission. However, the complexity of observational data and physical processes makes comparison of observations and modeling results difficult. In this work, we show the initial results of application of K-Means clustering (unsupervised machine learning) algorithm to two different problems: 1) recognition of the typical spectroscopic line profiles observed by IRIS during solar flares and their typical dynamic behavior; 2) recognition of shocks and heating events in synthetic AIA emission data obtained from StellarBox quiet-Sun simulations. The average silhouette width technique for the KMeans algorithm is utilized in different ways to obtain optimal numbers of clusters. We discuss application of the emission clustering to visualizations of the computational volume, understanding its evolutionary trends and behavior patterns, and inversion (reconstruction) of physical properties of the solar atmosphere from synthesizes emission data.
Spatially-resolved observations from the IRIS and SDO/AIA satellites, especially when coupled with realistic 3D RMHD simulations, are a powerful tool for analysis of processes in the solar chromosphere, transition region, and corona. However, the complexity of the data makes understanding the observations and modeling results difficult. In this work, we apply unsupervised clustering algorithms for analysis of observational and synthetic chromospheric Mg II h&k 2796Å&2803Å and transition region C II 1334Å&1335Å line profiles observed by IRIS, and extreme ultraviolet (EUV) emission observed by SDO/AIA, for various types of problems. The synthetic line profiles are computed for simulations of the quiescent solar atmosphere (using the StellarBox and RH1.5 codes). The K-Means clustering algorithm is applied, and the selection of an optimal number of clusters is supported by the average silhouette width technique. We discuss applications of the line profile clustering method to 1) visualization of computational and observational spectroscopic imaging data; 2) understanding of evolutionary trends and behavior patterns of quiet Sun emission and during solar flares; and 3) recognition of heating events and shock waves.
2014 NASA published the outcome of the 2030 CFD (Computational Fluid Dynamics) Vision study: “CFD Vision 2030: A path to Revolutionary Computational Aerosciences” . The study provided a comprehensive review of the state of the art of CFD in 2014 for aerospace applications including, but not limited to, numerical algorithms, physics models, MDAO (Multidisciplinary Design Analysis and Optimization) and HPC (High Performance Computing) hardware. The study also proposed four conceptual ideas of Grand Challenge problems that would build on and benefit from advances outlined in the roadmap. The proposed challenges were meant to foster more detailed descriptions of grand challenge problems for specific disciplines. One of the proposed challenges was in the gas turbine propulsion area, focusing on transient full engine simulations. The current paper addresses detailed technical aspects of that challenge, and proposes a plan to approach it in a gradual manner, which includes high fidelity modeling of components, component coupling, and targeted experimental campaigns relying on common research models.
The Single Field-of-view Sounder Atmospheric Products (SiFSAP) answer the need for a novel high spatial resolution atmospheric data product for major hyper-spectral infrared (IR) sounder missions. SiFSAP include a complete set of atmospheric vertical profiles, cloud, and surface properties, which are physically retrieved from top-of-atmosphere (TOA) spectral radiances under all-sky conditions via a rigorously defined radiative transfer relationship. By using a state-of-art fast radiative transfer model and a carefully designed optimal estimation based physical retrieval scheme, the SiFSAP algorithm ensures both an ultra-fast data processing speed needed for operational weather applications and the radiometric consistency desired by long-term climate studies. SiFSAP supplement existing operational products by providing data at the native resolution of the sounder instruments, the direct and accurate retrieval of cloud scattering properties, and the establishment of ‘radiance closure.’
NASA's Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. Growth in mission demand, both in number of spacecraft and in data return, has led to increased loading levels on the network, and actual demand frequently exceeds network capacity. The DSN scheduling process involves peer-to-peer collaborative negotiation, which consumes significant time and resources in order to reach a baseline version of the schedule, and then to manage and agree to changes. Process delays are exacerbated by the high level of oversubscription experienced by the DSN: it is not unusual for the scheduling process to start with 20-40\% more requested time can be accommodated on the available antennas. The other NASA networks make use of a static mission priority list to address a similar problem: missions are ranked in priority order, then the schedule is populated by priority from highest to lowest. Such a mechanism would not work for DSN due to the heterogeneity of the mission set, and to the time-varying mission requirements with mission phase. This paper describes an alternative approach for the DSN that addresses key problems inherent in the current process --- oversubsubscription and how to "fairly'" reduce it to a manageable level. The main characteristics of the new approach are the use of loading-based limits based on balancing requested time, along with priorities and user preferences as the basis for optimization criteria that can be used by new algorithms.
Multi-Reward Proximal Policy Optimization, a multi-objective deep reinforcement learning algorithm, is used to examine the design space of low-thrust trajectories for a SmallSat transferring between two libration point orbits in the Earth- Moon system. Using Multi-Reward Proximal Policy Optimiza- tion, multiple policies are simultaneously and efficiently trained on three distinct trajectory design scenarios. Each policy is trained to create a unique control scheme based on the trajectory design scenario and assigned reward function: a unique combination of weights scaling competing objectives that guide the spacecraft to the target mission orbit, incentivize faster flight times, and penalize propellant mass usage. Then, the policies are evaluated on the same set of perturbed initial conditions in each scenario to generate the propellant mass usages, flight times, and state discontinuities from a reference trajectory for each control scheme. This solution space of low-thrust trajectories for a SmallSat is used to examine the multi-objective trade space for the trajectory design scenario. By autonomously constructing the solution space, insights into the required propellant mass, flight time, and transfer geometry are rapidly achieved.
The Single Field-of-view Sounder Atmospheric Products (SiFSAP) answer the need for a novel high spatial resolution atmospheric data product for major hyper-spectral infrared (IR) sounder missions. SiFSAP include a complete set of atmospheric vertical profiles, cloud, and surface properties, which are physically retrieved from top-of-atmosphere (TOA) spectral radiances under all-sky conditions via a rigorously defined radiative transfer relationship. By using a state-of-art fast radiative transfer model and a carefully designed optimal estimation based physical retrieval scheme, the SiFSAP algorithm ensures both an ultra-fast data processing speed needed for operational weather applications and the radiometric consistency desired by long-term climate studies. SiFSAP supplement existing operational products by providing data at the native spatial resolution of the sounder instruments, the direct and accurate retrieval of cloud scattering properties, and the establishment of ‘radiance closure.’
NASA’s Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. Growth in mission demand, both in number of spacecraft and in data return, has led to increased loading levels on the network, and actual demand frequently exceeds network capacity. The DSN scheduling process involves peer-to-peer collaborative negotiation, which consumes significant time and resources in order to reach a baseline version of the schedule, and then to manage and agree to changes. Process delays are exacerbated by the high level of oversubscription experienced by the DSN: it is not unusual for the scheduling process to start with 20-40% more requested time can be accommodated on the available antennas. The other NASA networks make use of a static mission priority list to address a similar problem: missions are ranked in priority order, then the schedule is populated by priority from highest to lowest. Such a mechanism would not work for DSN due to the heterogeneity of the mission set, and to the time-varying mission requirements with mission phase. This paper describes an alternative approach for the DSN that addresses key problems inherent in the current process — oversubsubscription and how to “fairly” reduce it to a manageable level. The main characteristics of the new approach are the use of loading-based limits based on balancing requested time, along with priorities and user preferences as the basis for optimization criteria that can be used by new algorithms.
The next generation of Mars rotorcrafts requires on-board autonomous hazard avoidance landing. To this end, this work proposes a system that performs continuous multi- resolution height map reconstruction and safe landing spot detection. Structure-from-Motion measurements are aggregated in a pyramid structure using a novel Optimal Mixture of Gaus- sians formulation that provides a comprehensive uncertainty model. Our multiresolution pyramid is built more efficiently and accurately than past work by decoupling pyramid filling from the measurement updates of different resolutions.To detect the safest landing location, after an optimized hazard segmentation, we use a mean shift algorithm on multiple distance transform peaks to account for terrain roughness and uncertainty. The benefits of our contributions are evaluated on real and synthetic flight data.
A systematic approach for monitoring U.S. air traffic was developed in the context of system-wide planning and control. Towards this end, a network optimization model with nonlinear objectives was chosen as the central element in the planning/control system. The network representation was selected because: (1) it provides a comprehensive structure for depicting essential aspects of the air traffic system, (2) it can be solved efficiently for large scale problems, and (3) the design can be easily communicated to non-technical users through computer graphics. Briefly, the network planning models consider the flow of traffic through a graph as the basic structure. Nodes depict locations and time periods for either individual planes or for aggregated groups of airplanes. Arcs define variables as actual airplanes flying through space or as delays across time periods. As such, a special case of the network can be used to model the so called flow control problem. Due to the large number of interacting variables and the difficulty in subdividing the problem into relatively independent subproblems, an integrated model was designed which will depict the entire high level (above 29000 feet) jet route system for the 48 contiguous states in the U.S. As a first step in demonstrating the concept's feasibility a nonlinear risk/cost model was developed for the Indianapolis Airspace. The nonlinear network program --NLPNETG-- was employed in solving the resulting test cases. This optimization program uses the Truncated-Newton method (quadratic approximation) for determining the search direction at each iteration in the nonlinear algorithm. It was shown that aircraft could be re-routed in an optimal fashion whenever traffic congestion increased beyond an acceptable level, as measured by the nonlinear risk function.
Time-sequential imagery is difficult to analyze because of its high dimensionality. This paper advances a new algorithm that screens input data in an intelligent way, discards data with negligible information, and uses the remaining images to represent the sequence in an optimal compact form. Data are presented to illustrate how this algorithm can be used to do novelty filtering, novelty detection, segmentation, background independent modeling, and classification.
A new technique for locating simultaneous roots of a set of functions is described. The technique is based on the property of the Kreisselmeier-Steinhauser function which descends to a minimum at each root location. It is shown that the ensuing algorithm may be merged into any nonlinear programming method for solving optimization problems with equality constraints.