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.
A new method for solving the hitting set problem is proposed. This method is based on the mapping of the problem onto an integer programming optimization problem. this new approach provides an algorithm with much better performance compare to the algorithms for the hitting set problem that currently are used for solving the diagnosis problem.
Integrated Systems Health Management (ISHM) is a comprehensive capability. An ISHM system must detect anomalies, identify causes of such anomalies, predict future anomalies, help identify consequences of anomalies for example, suggested mitigation steps. The system should also provide users with appropriate navigation tools to facilitate the flow of information into and out of the ISHM system. Central to the ability of the ISHM to detect anomalies is a clearly defined catalog of anomalies. Further, this lexicon of anomalies must be organized in ways that make it accessible to a suite of tools used to manage the data, information and knowledge (DIaK) associated with a system. In particular, it is critical to ensure that there is optimal mapping between target anomalies and the algorithms associated with their detection. During the early development of our ISHM architecture and approach, it became clear that a lexicon of anomalies would be important to the development of critical anomaly detection algorithms. In our work in the rocket engine test environment at John C. Stennis Space Center, we have access to a repository of discrepancy reports (DRs) that are generated in response to squawks identified during post-test data analysis. The DR is the tool used to document anomalies and the methods used to resolve the issue. These DRs have been generated for many different tests and for all test stands. The result is that they represent a comprehensive summary of the anomalies associated with rocket engine testing. Fig. 1 illustrates some of the data that can be extracted from a DR. Such information includes affected transducer channels, narrative description of the observed anomaly, and the steps used to correct the problem. The primary goal of the anomaly lexicon development efforts we have undertaken is to create a lexicon that could be used in support of an associated health assessment database system (HADS) co-development effort. There are a number of significant byproducts of the anomaly lexicon compilation effort. For example, (1) Allows determination of the frequency distribution of anomalies to help identify those with the potential for high return on investment if included in automated detection as part of an ISHM system, (2) Availability of a regular lexicon could provide the base anomaly name choices to help maintain consistency in the DR collection process, and (3) Although developed for the rocket engine test environment, most of the anomalies are not specific to rocket testing, and thus can be reused in other applications.
As the number of cancer survivors grows, prediction of radiotherapy-induced second cancer risks becomes increasingly important. Because the latency period for solid tumors is long, the risks of recently introduced radiotherapy protocols are not yet directly measurable. In the accompanying article, we presented a new biologically based mathematical model, which, in principle, can estimate second cancer risks for any protocol. The novelty of the model is that it integrates, into a single formalism, mechanistic analyses of pre-malignant cell dynamics on two different time scales: short-term during radiotherapy and recovery; long-term during the entire life span. Here, we apply the model to nine solid cancer types (stomach, lung, colon, rectal, pancreatic, bladder, breast, central nervous system, and thyroid) using data on radiotherapy-induced second malignancies, on Japanese atomic bomb survivors, and on background US cancer incidence. Potentially, the model can be incorporated into radiotherapy treatment planning algorithms, adding second cancer risk as an optimization criterion.
Grayscale Optical Correlator Workbench (GOCWB) is a computer program for use in automatic target recognition (ATR). GOCWB performs ATR with an accurate simulation of a hardware grayscale optical correlator (GOC). This simulation is performed to test filters that are created in GOCWB. Thus, GOCWB can be used as a stand-alone ATR software tool or in combination with GOC hardware for building (target training), testing, and optimization of filters. The software is divided into three main parts, denoted filter, testing, and training. The training part is used for assembling training images as input to a filter. The filter part is used for combining training images into a filter and optimizing that filter. The testing part is used for testing new filters and for general simulation of GOC output. The current version of GOCWB relies on the mathematical software tools from MATLAB binaries for performing matrix operations and fast Fourier transforms. Optimization of filters is based on an algorithm, known as OT-MACH, in which variables specified by the user are parameterized and the best filter is selected on the basis of an average result for correct identification of targets in multiple test images.
Range Process Simulation Tool (RPST) is a computer program that assists managers in rapidly predicting and quantitatively assessing the operational effects of proposed technological additions to, and/or upgrades of, complex facilities and engineering systems such as the Eastern Test Range. Originally designed for application to space transportation systems, RPST is also suitable for assessing effects of proposed changes in industrial facilities and large organizations. RPST follows a model-based approach that includes finite-capacity schedule analysis and discrete-event process simulation. A component-based, scalable, open architecture makes RPST easily and rapidly tailorable for diverse applications. Specific RPST functions include: (1) definition of analysis objectives and performance metrics; (2) selection of process templates from a processtemplate library; (3) configuration of process models for detailed simulation and schedule analysis; (4) design of operations- analysis experiments; (5) schedule and simulation-based process analysis; and (6) optimization of performance by use of genetic algorithms and simulated annealing. The main benefits afforded by RPST are provision of information that can be used to reduce costs of operation and maintenance, and the capability for affordable, accurate, and reliable prediction and exploration of the consequences of many alternative proposed decisions.
Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic. The information carried by CGR contact plan messages is useful not only for dynamic route computation, but also for the implementation of rate control, congestion forecasting, transmission episode initiation and termination, timeout interval computation, and retransmission timer suspension and resumption.
Traditional robotic structures have limitations in planetary exploration as their rigid structural joints are prone to damage in new and rough terrains. In contrast, robots based on tensegrity structures, composed of rods and tensile cables, offer a highly robust, lightweight, and energy efficient solution over traditional robots. In addition tensegrity robots can be highly configurable by rearranging their topology of rods, cables and motors. However, these highly configurable tensegrity robots pose a significant challenge for locomotion due to their complexity. This study investigates a control pattern for successful locomotion in tensegrity robots through an evolutionary algorithm. A twelve-rod hardware model is rapidly prototyped to utilize a new actuation method based on friction. A web-based physics simulation is created to model the twelve-rod tensegrity ball structure. Square-waves are used as control policies for the actuators of the tensegrity structure. Monte Carlo trials are run to find the most successful number of amplitudes for the square-wave control policy. From the results, an evolutionary algorithm is implemented to find the most optimized solution for locomotion of the twelve-rod tensegrity structure. The software pattern coupled with the new friction based actuation method can serve as the basis for highly efficient tensegrity robots in space exploration.
In support of the NASA Human Research Program Exploration Medical Capability (ExMC) Element, NASA Ames Research Center (ARC) established a collaborative effort with the Canadian Space Agency (CSA). The collaboration focuses on leveraging CSA capability in the areas of biosensors and decision support that will augment future development of such components for Exploration Missions. The CSA advancement of biosensors enables NASA to focus on the integration and data management associated with these types of components through the system currently under development by the Medical Data Architecture (MDA) project. This approach has enabled the establishment of a successful collaborative working relationship between ExMC and CSA.Applying lessons learned from the fiscal year 2016 (FY16) Human Exploration Research Analog (HERA) campaign, CSA and NASA ARC developed a solution to provide real-time feedback to researchers who monitor the collection of vital signs data from a wearable Astroskin garment. The advances in the interfaces included the development of an iPad application (by CSA) to wirelessly forward the vital signs data to the MDA system, which collected the vital signs data through a receiver developed by NASA ARC. The development of these interfaces aims to provide communications between the Astroskin and the MDA system such that data may be seamlessly collected, stored and retrieved by the MDA. The first steps towards this goal were demonstrated in FY16. In FY17, ExMC will complete the first in a series of test beds that establishes a system to automate collection and management of vital sign data from the Astroskin, and other sources of data, to provide information for a crewmember to make medical decisions. In addition, the MDA Test Bed 1 will enable CSA to evaluate and optimize biosensor advancement and facilitate decision support algorithm development.
In support of the NASA Human Research Program Exploration Medical Capability (ExMC) Element, NASA Ames Research Center (ARC) established a collaborative effort with the Canadian Space Agency (CSA). The collaboration focuses on leveraging CSA capability in the areas of biosensors and decision support that will augment future development of such components for Exploration Missions. The CSA advancement of biosensors enables NASA to focus on the integration and data management associated with these types of components through the system currently under development by the Medical Data Architecture (MDA) project. This approach has enabled the establishment of a successful collaborative working relationship between ExMC and CSA.Applying lessons learned from the fiscal year 2016 (FY16) Human Exploration Research Analog (HERA) campaign, CSA and NASA ARC developed a solution to provide real-time feedback to researchers who monitor the collection of vital signs data from a wearable Astroskin garment. The advances in the interfaces included the development of an iPad application (by CSA) to wirelessly forward the vital signs data to the MDA system, which collected the vital signs data through a receiver developed by NASA ARC. The development of these interfaces aims to provide communications between the Astroskin and the MDA system such that data may be seamlessly collected, stored and retrieved by the MDA. The first steps towards this goal were demonstrated in FY16. In FY17, ExMC will complete the first in a series of test beds that establishes a system to automate collection and management of vital sign data from the Astroskin, and other sources of data, to provide information for a crewmember to make medical decisions. In addition, the MDA Test Bed 1 will enable CSA to evaluate and optimize biosensor advancement and facilitate decision support algorithm development.
In this tutorial we discuss the quantum alternating operator ansatz (QAOA), which is a variational algorithm that can be used for approximate optimization of combinatorial problems with soft and hard constraints.We go through the design of the quantum circuit and its actual implementation in real hardware, discussing compilation issues such as gate synthesis and scheduling of all the required gates and qubit-swapping overhead.
Prognostics-enabled Decision Making (PDM) is an emerging research area that aims to integrate prognostic health information and knowledge about the future operating conditions into the process of selecting subsequent actions for the system. Previous work developing and testing PDM algorithms has been done in simulation; this paper describes the effort leading to a successful demonstration of PDM algorithms on a hardware mobile robot platform. The hardware platform, based on the K11 planetary rover prototype, was modified to allow injection of selected fault modes related to the rover’s electrical power subsystem. The PDM algorithms were adapted to the hardware platform, including development of a software module framework, a new route planner, and modifications to increase the algorithms’ robustness to sensor noise and system timing issues. A set of test scenarios was chosen to demonstrate the algorithms’ capabilities. The modifications to run with a hardware platform, the test scenarios, and the test results are described in detail. The results show a successful use of PDM algorithms on a hardware test platform to optimize mission planning in the presence of electrical system faults.
HybridQ and PySA are open-source tools developed by NASA to support benchmarking, analysis and quantum algorithm development in areas such as simulation, optimization and machine learning. These tools leverage classical hardware acceleration via high-performance computing CPU and GPU architectures and support high-performance computing. HybridQ is a highly extensible platform designed to provide a common framework to integrate multiple state-of-the-art techniques to simulate large scale quantum circuits. PySA is an extensible platform to optimize a classical cost function. We provide an outline of each of these open-source tools and highlight projects using each of these tools in contexts of simulation, optimization and machine learning.
The use of product quality as the performance criteria for manufacturing system control is explored. The goal in manufacturing, for economic reasons, is to optimize product quality. The problem is that since quality is a rather nebulous product characteristic, there is seldom an analytic function that can be used as a measure. Therefore standard control approaches, such as optimal control, cannot readily be applied. A second problem with optimizing product quality is that it is typically measured along many dimensions: there are many apsects of quality which must be optimized simultaneously. Very often these different aspects are incommensurate and competing. The concept of optimality must now include accepting tradeoffs among the different quality characteristics. These problems are addressed using multiple objective optimization. It is shown that the quality control problem can be defined as a multiple objective optimization problem. A controller structure is defined using this as the basis. Then, an algorithm is presented which can be used by an operator to interactively find the best operating point. Essentially, the algorithm uses process data to provide the operator with two pieces of information: (1) if it is possible to simultaneously improve all quality criteria, then determine what changes to the process input or controller parameters should be made to do this; and (2) if it is not possible to improve all criteria, and the current operating point is not a desirable one, select a criteria in which a tradeoff should be made, and make input changes to improve all other criteria. The process is not operating at an optimal point in any sense if no tradeoff has to be made to move to a new operating point. This algorithm ensures that operating points are optimal in some sense and provides the operator with information about tradeoffs when seeking the best operating point. The multiobjective algorithm was implemented in two different injection molding scenarios: tuning of process controllers to meet specified performance objectives and tuning of process inputs to meet specified quality objectives. Five case studies are presented.
The SpaRibs topology of an aircraft wing has a significant effect on its structural behavior and stability as well as the flutter performance. The development of additive manufacturing techniques like Electron Beam Free Form Fabrication (EBF3) has made it feasible to manufacture aircraft wings with curvilinear spars, ribs (SpaRibs) and stiffeners. In this article a new global-local optimization framework for wing with multiple sections using curvilinear SpaRibs is described. A single design space is used to parameterize the SpaRibs geometry. This method has been implemented using MSC-PATRAN to create a broad range of SpaRibs topologies using limited number of parameters. It ensures C0 and C1 continuities in SpaRibs geometry at the junction of two wing sections with airfoil thickness gradient discontinuity as well as mesh continuity between all structural components. This method is advantageous in complex multi-disciplinary optimization due to its potential to reduce the number of design variables. For the global-local optimization the local panels are generated by an algorithm which is totally based on a set algebra on the connectivity matrix data. The great advantage of this method is that it is completely independent of the coordinates of the nodes of the finite element model. It is also independent of the order in which the elements are distributed in the FEM. The code is verified by optimizing of the CRM Baseline model at trim condition at Mach number equal to 0.85 for five different angle of attack (-2deg, 0deg,2deg,4deg and 6deg). The final weight of the wing is 19,090.61 lb. This value is comparable to that obtained by Qiang et al. 6 (19,269 lb).
Delay Tolerant Networking (DTN) is the standard approach to the networking of space systems with the goal of supporting the Solar System Internet (SSI). Current space networks have a small scale and often depend on rigorously scheduled (pre-determined) contact opportunities; this manual approach inhibits scalability. The goal of this paper is to recast these scheduling problems in order to apply the optimization machinery of tropical geometry. Contact opportunities in space are dependent on such factors as orbital mechanics and asset availability, which induce time-varying connectivity; indeed, end-to-end connectivity might never occur. Routing optimization within this structure is classically difficult and typically utilizes Dijkstra's algorithm as applied to contact graphs. Alternatively, we follow the successes of tropical geometry in train schedule optimization, job assignments, and even traditional networking, by extending this approach to this more general (i.e. disconnected) problem space. These successes imply tropical geometry provides a useful framework in the context of DTNs, starting with applications to queuing theory and long-haul links. Recently, tropical geometry has been applied to parametric path optimization on graphs with variable edge weights. In this work, we extend these advances to account for the problem of routing in a space network, and find that tropical geometry is well-suited to the challenges offered by this new setting, including contact schedules featuring probabilities. Our approach leverages the combinatorial nature of the problem to give feasible shortest path trees in the presence of variable channel conditions and latency, evolving topologies, and uncertainty inherent in space routing. We discuss our tropical approach to DTN for two Python implementations, a Verilog Tropical ALU implementation, tropical frameworks for other parametric graph problems, and solution stability. Lastly, a program for future work is included to illuminate the path ahead.
Simulated annealing is a general purpose Monte Carlo optimization technique that was applied to the problem of placing standard logic cells in a VLSI ship so that the total interconnection wire length is minimized. An improved standard cell placement algorithm that takes advantage of the performance enhancements that appear to come from parallelizing the uniprocessor simulated annealing algorithm is presented. An outline of this algorithm is given.
The variational quantum eigenvalue solver is a powerful hybrid quantum-classical approach that has been suggested as a candidate method to run on near-term quantum hardware for computing ground state electronic energies of molecular systems. However, even for small molecules, the number of variational parameters and qubits required to minimize the electronic energy is beyond the reach of current quantum computers except for small basis sets. We explore a new paradigm for state preparation where we test how much of the optimization can be approximately prepared with classical computers to reduce the number of optimization steps performed using a quantum device. By adapting a recent algorithm for the factorized form of the UCC ansatz, we can study molecular electronic structure problems with up to 64 qubits. In addition, we also test a related approach of using tensor networks to optimize quantum circuits in order to benchmark various lattice models. We present results using these approaches and discuss strategies for incorporating these ideas into variational algorithms involving near-term quantum computers. Our results help demonstrate the strength of the UCC ansatz and address pressing questions about optimal initial parameterizations and circuit construction.
There are a variety of algorithms for deconvolution of blurred images, each having its own criteria or statistic to be optimized in order to estimate the original image data. Using the Interactive Data Language (IDL), we have implemented the Maximum Likelihood, Maximum Entropy, Maximum Residual Likelihood, and sigma-CLEAN algorithms in a unified environment called DeConv_Tool. Most of the algorithms have as their goal the optimization of statistics such as standard deviation and mean of residuals. Shannon entropy, log-likelihood, and chi-square of the residual auto-correlation are computed by DeConv_Tool for the purpose of determining the performance and convergence of any particular method and comparisons between methods. DeConv_Tool allows interactive monitoring of the statistics and the deconvolved image during computation. The final results, and optionally, the intermediate results, are stored in a structure convenient for comparison between methods and review of the deconvolution computation. The routines comprising DeConv_Tool are available via anonymous FTP through the IDL Astronomy User's Library.