Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “combinatorial”

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.

At least 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS2005

Biased Randomized Algorithm for Fast Model-Based Diagnosis

A biased randomized algorithm has been developed to enable the rapid computational solution of a propositional- satisfiability (SAT) problem equivalent to a diagnosis problem. The closest competing methods of automated diagnosis are described in the preceding article "Fast Algorithms for Model-Based Diagnosis" and "Two Methods of Efficient Solution of the Hitting-Set Problem" (NPO-30584), which appears elsewhere in this issue. It is necessary to recapitulate some of the information from the cited articles as a prerequisite to a description of the present method. As used here, "diagnosis" signifies, more precisely, a type of model-based diagnosis in which one explores any logical inconsistencies between the observed and expected behaviors of an engineering system. The function of each component and the interconnections among all the components of the engineering system are represented as a logical system. Hence, the expected behavior of the engineering system is represented as a set of logical consequences. Faulty components lead to inconsistency between the observed and expected behaviors of the system, represented by logical inconsistencies. Diagnosis - the task of finding the faulty components - reduces to finding the components, the abnormalities of which could explain all the logical inconsistencies. One seeks a minimal set of faulty components (denoted a minimal diagnosis), because the trivial solution, in which all components are deemed to be faulty, always explains all inconsistencies. In the methods of the cited articles, the minimal-diagnosis problem is treated as equivalent to a minimal-hitting-set problem, which is translated from a combinatorial to a computational problem by mapping it onto the Boolean-satisfiability and integer-programming problems. The integer-programming approach taken in one of the prior methods is complete (in the sense that it is guaranteed to find a solution if one exists) and slow and yields a lower bound on the size of the minimal diagnosis. In contrast, the present approach is incomplete and fast and yields an upper bound on the size of the minimal diagnosis.

Williams, Colin↗
NASA NTRS2011

Parametric Testing of Launch Vehicle FDDR Models

For the safe operation of a complex system like a (manned) launch vehicle, real-time information about the state of the system and potential faults is extremely important. The on-board FDDR (Failure Detection, Diagnostics, and Response) system is a software system to detect and identify failures, provide real-time diagnostics, and to initiate fault recovery and mitigation. The ERIS (Evaluation of Rocket Integrated Subsystems) failure simulation is a unified Matlab/Simulink model of the Ares I Launch Vehicle with modular, hierarchical subsystems and components. With this model, the nominal flight performance characteristics can be studied. Additionally, failures can be injected to see their effects on vehicle state and on vehicle behavior. A comprehensive test and analysis of such a complicated model is virtually impossible. In this paper, we will describe, how parametric testing (PT) can be used to support testing and analysis of the ERIS failure simulation. PT uses a combination of Monte Carlo techniques with n-factor combinatorial exploration to generate a small, yet comprehensive set of parameters for the test runs. For the analysis of the high-dimensional simulation data, we are using multivariate clustering to automatically find structure in this high-dimensional data space. Our tools can generate detailed HTML reports that facilitate the analysis.

Schumann, Johann↗
NASA NTRS2004

Rapid Chemometric Filtering of Spectral Data

A method of rapid, programmable filtering of spectral transmittance, reflectance, or fluorescence data to measure the concentrations of chemical species has been proposed. By programmable is meant that a variety of spectral analyses can readily be performed and modified in software, firmware, and/or electronic hardware, without need to change optical filters or other optical hardware of the associated spectrometers. The method is intended to enable real-time identification of single or multiple target chemical species in applications that involve high-throughput screening of multiple samples. Examples of such applications include (but are not limited to) combinatorial chemistry, flow cytometry, bead assays, testing drugs, remote sensing, and identification of targets. The basic concept of the proposed method is to perform real-time crosscorrelations of a measured spectrum with one or more analytical function(s) of wavelength that could be, for example, the known spectra of target species. Assuming that measured spectral intensities are proportional to concentrations of target species plus background spectral intensities, then after subtraction of background levels, it should be possible to determine target species concentrations from cross-correlation values. Of course, the problem of determining the concentrations is more complex when spectra of different species overlap, but the problem can be solved by use of multiple analytical functions in combination with computational techniques that have been developed previously for analyses of this type. The method is applicable to the design and operation of a spectrometer in which spectrally dispersed light is measured by means of an active-pixel sensor (APS) array. The row or column dimension of such an array is generally chosen to be aligned along the spectral-dispersion dimension, so that each pixel intercepts light in a narrow spectral band centered on a wavelength that is a known function of the pixel position. The proposed method admits of two hardware implementations for computing cross-correlations in real time.

Beaman, Gregory↗
NASA NTRS2011

Optimizing Muscle Parameters in Musculoskeletal Modeling Using Monte Carlo Simulations

Astronauts assigned to long-duration missions experience bone and muscle atrophy in the lower limbs. The use of musculoskeletal simulation software has become a useful tool for modeling joint and muscle forces during human activity in reduced gravity as access to direct experimentation is limited. Knowledge of muscle and joint loads can better inform the design of exercise protocols and exercise countermeasure equipment. In this study, the LifeModeler(TM) (San Clemente, CA) biomechanics simulation software was used to model a squat exercise. The initial model using default parameters yielded physiologically reasonable hip-joint forces. However, no activation was predicted in some large muscles such as rectus femoris, which have been shown to be active in 1-g performance of the activity. Parametric testing was conducted using Monte Carlo methods and combinatorial reduction to find a muscle parameter set that more closely matched physiologically observed activation patterns during the squat exercise. Peak hip joint force using the default parameters was 2.96 times body weight (BW) and increased to 3.21 BW in an optimized, feature-selected test case. The rectus femoris was predicted to peak at 60.1% activation following muscle recruitment optimization, compared to 19.2% activation with default parameters. These results indicate the critical role that muscle parameters play in joint force estimation and the need for exploration of the solution space to achieve physiologically realistic muscle activation.

Hanson, Andrea↗
NASA NTRS2003

NASA Tech Briefs, June 2003

Topics covered include: Nulling Infrared Radiometer for Measuring Temperature; The Ames Power Monitoring System; Hot Films on Ceramic Substrates for Measuring Skin Friction; Probe Without Moving Parts Measures Flow Angle; Detecting Conductive Liquid Leaking from Nonconductive Pipe; Adaptive Suppression of Noise in Voice Communications; High-Performance Solid-State W-Band Power Amplifiers; Microbatteries for Combinatorial Studies of Conventional Lithium-Ion Batteries; Correcting for Beam Aberrations in a Beam-Waveguide Antenna; Advanced Rainbow Solar Photovoltaic Arrays; Metal Side Reflectors for Trapping Light in QWIPs; Software for Collaborative Engineering of Launch Rockets; Software Assists in Extensive Environmental Auditing; Software Supports Distributed Operations via the Internet; Software Estimates Costs of Testing Rocket Engines; yourSky: Custom Sky-Image Mosaics via the Internet; Software for Managing Inventory of Flight Hardware; Lower-Conductivity Thermal-Barrier Coatings; Process for Smoothing an Si Substrate after Etching of SiO2; Flexible Composite-Material Pressure Vessel; Treatment to Destroy Chlorohydrocarbon Liquids in the Ground; Noncircular Cross Sections Could Enhance Mixing in Sprays; Small, Untethered, Mobile Roots for Inspecting Gas Pipes; Paint-Overspray Catcher; Preparation of Regular Specimens for Atom Probes; Inverse Tomo-Lithography for Making Microscopic 3D Parts; Predicting and Preventing Incipient Flameout in Combustors; MEMS-Based Piezoelectric/Electrostatic Inchworm Actuator; Metallized Capillaries as Probes for Raman Spectroscopy; Adaptation of Mesoscale Weather Models to Local Forecasting; Aerodynamic Design using Neural Networks; Combining Multiple Gyroscope Outputs for Increased Accuracy; and Improved Collision-Detection Method for Robotic Manipulator.

Source record↗
NASA NTRS2011

Stress-Driven Selection of Novel Phenotypes

A process has been developed that can confer novel properties, such as metal resistance, to a host bacterium. This same process can also be used to produce RNAs and peptides that have novel properties, such as the ability to bind particular compounds. It is inherent in the method that the peptide or RNA will behave as expected in the target organism. Plasmid-born mini-gene libraries coding for either a population of combinatorial peptides or stable, artificial RNAs carrying random inserts are produced. These libraries, which have no bias towards any biological function, are used to transform the organism of interest and to serve as an initial source of genetic variation for stress-driven evolution. The transformed bacteria are propagated under selective pressure in order to obtain variants with the desired properties. The process is highly distinct from in vitro methods because the variants are selected in the context of the cell while it is experiencing stress. Hence, the selected peptide or RNA will, by definition, work as expected in the target cell as the cell adapts to its presence during the selection process. Once the novel gene, which produces the sought phenotype, is obtained, it can be transferred to the main genome to increase the genetic stability in the organism. Alternatively, the cell line can be used to produce novel RNAs or peptides with selectable properties in large quantity for separate purposes. The system allows for easy, large-scale purification of the RNAs or peptide products. The process has been reduced to practice by imposing sub-inhibitory concentrations of NiCl2 on cells of the bacterium Escherichia coli that were transformed separately with the peptide library and RNA library. The evolved resistant clones were isolated, and sequences of the selected mini-gene variants were established. Clones resistant to NiCl2 were found to carry identical plasmid variants with a functional mini-gene that specifically conferred significant nickel tolerance on the host cells. Sequencing of the selected mini-gene revealed a propensity of the encoded peptide to bind transient metal ions. Expression of the mini-gene markedly improved growth parameters of the evolved clones at sub-inhibitory concentrations of NiCl2 while being slightly detrimental in the absence of stress. Similar results have been obtained with the RNA libraries. Overall, the results demonstrate a very natural outcome of the selection experiments in which the mini-genes were expected to be either successfully integrated into bacterial genetic networks, or rejected depending upon their effect on host fitness. This described approach can be useful as a laboratory model to study the dynamics of bacterial adaptive evolution on the molecular level. It can also provide a strategy for screening expressed DNA libraries in search of novel genes with desirable properties.

Fox, George E.↗
NASA NTRS2012

Design of Spacecraft Missions to Remove Multiple Orbital Debris Objects

The amount of hazardous debris in Earth orbit has been increasing, posing an evergreater danger to space assets and human missions. In January of 2007, a Chinese ASAT test produced approximately 2600 pieces of orbital debris. In February of 2009, Iridium 33 collided with an inactive Russian satellite, yielding approximately 1300 pieces of debris. These recent disastrous events and the sheer size of the Earth orbiting population make clear the necessity of removing orbital debris. In fact, experts from both NASA and ESA have stated that 10 to 20 pieces of orbital debris need to be removed per year to stabilize the orbital debris environment. However, no spacecraft trajectories have yet been designed for removing multiple debris objects and the size of the debris population makes the design of such trajectories a daunting task. Designing an efficient spacecraft trajectory to rendezvous with each of a large number of orbital debris pieces is akin to the famous Traveling Salesman problem, an NP-complete combinatorial optimization problem in which a number of cities are to be visited in turn. The goal is to choose the order in which the cities are visited so as to minimize the total path distance traveled. In the case of orbital debris, the pieces of debris to be visited must be selected and ordered such that spacecraft propellant consumption is minimized or at least kept low enough to be feasible. Emergent Space Technologies, Inc. has developed specialized algorithms for designing efficient tour missions for near-Earth asteroids that may be applied to the design of efficient spacecraft missions capable of visiting large numbers of orbital debris pieces. The first step is to identify a list of high priority debris targets using the Analytical Graphics, Inc. SOCRATES website and then obtain their state information from Celestrak. The tour trajectory design algorithms will then be used to determine the itinerary of objects and v requirements. These results will shed light on how many debris pieces can be visited for various amounts of propellant, which launch vehicles can accommodate such missions, and how much margin is available for debris removal system payloads.

Barbee, Brent W.↗
NASA NTRS2012

Recursive Branching Simulated Annealing Algorithm

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Bolcar, Matthew↗
NASA NTRS2014

Three-Dimensional Normal Human Neutral Progenitor Tissue-Like Assemblies: A Model for Persistent Varicella-Zoster Virus Infection and Platform to Study Oxidate Stress and Damage in Multiple Hit Scenarios

The environment of space results in a multitude of challenges to the human physiology that present barriers to extended habitation and exploration. Over 40 years of investigation to define countermeasures to address space flight adaptation has left gaps in our knowledge regarding mitigation strategies partly due to the lack of investigative tools, monitoring strategies, and real time diagnostics to understand the central causative agent(s) responsible for physiologic adaptation and maintaining homeostasis. Spaceflight-adaptation syndrome is the combination of space environmental conditions and the synergistic reaction of the human physiology. Our work addresses the role of oxidative stress and damage (OSaD) as a negative and contributing Risk Factor (RF) in the following areas of combined spaceflight related dysregulation: i) radiation induced cellular damage [1], [2] ii) immune impacts and the inflammatory response [3], [4] and iii) varicella zoster virus (VZV) reactivation [5]. Varicella-zoster (VZV)/Chicken Pox virus is a neurotropic human alphaherpes virus resulting in varicella upon primary infection, suppressed by the immune system becomes latent in ganglionic neurons, and reactivates under stress events to re-express in zoster and possibly shingles. Our laboratory has developed a complex three-dimensional (3D) normal human neural tissue model that emulates several characteristics of the human trigeminal ganglia (TG) and allows the study of combinatorial experimentation which addresses, simultaneously, OSaD associated with Spaceflight adaptation and habitation [6]. By combining the RFs of microgravity, radiation, and viral infection we will demonstrate that living in the space environment leads to significant physiological consequences for the peripheral and subsequently the central nervous system (PNS, CNS) associated with OSaD generation and consequentially endangers long-duration and exploration-class missions.

Goodwin, Thomas J.↗
NASA NTRS2014

Three-Dimensional Normal Human Neural Progenitor Tissue-Like Assemblies: A Model for Persistent Varicell-Zoster Virus Infection and Platform to Study Viral Infectivity and Oxidative Stress and Damage

The environment of space results in a multitude of challenges to the human physiology that present barriers to extended habitation and exploration. Over 40 years of investigation to define countermeasures to address space flight adaptation has left gaps in our knowledge regarding mitigation strategies partly due to the lack of investigative tools, monitoring strategies, and real time diagnostics to understand the central causative agent(s) responsible for physiologic adaptation and maintaining homeostasis. Spaceflight-adaptation syndrome is the combination of space environmental conditions and the synergistic reaction of the human physiology. Our work addresses the role of oxidative stress and damage (OSaD) as a negative and contributing Risk Factor (RF) in the following areas of combined spaceflight related dysregulation: i) radiation induced cellular damage [1], [2] ii) immune impacts and the inflammatory response [3], [4] and iii) varicella zoster virus (VZV) reactivation [5]. Varicella-zoster (VZV)/Chicken Pox virus is a neurotropic human alphaherpesvirus resulting in varicella upon primary infection, suppressed by the immune system becomes latent in ganglionic neurons, and reactivates under stress events to re-express in zoster and possibly shingles. Our laboratory has developed a complex threedimensional (3D) normal human neural tissue model that emulates several characteristics of the human trigeminal ganglia (TG) and allows the study of combinatorial experimentation which addresses, simultaneously, OSaD associated with Spaceflight adaptation and habitation [6].

Goodwin, T. J.↗
NASA NTRS2014

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

ground stations↗
NASA NTRS2013

The Evolution of Software and Its Impact on Complex System Design in Robotic Spacecraft Embedded Systems

The growth in computer hardware performance, coupled with reduced energy requirements, has led to a rapid expansion of the resources available to software systems, driving them towards greater logical abstraction, flexibility, and complexity. This shift in focus from compacting functionality into a limited field towards developing layered, multi-state architectures in a grand field has both driven and been driven by the history of embedded processor design in the robotic spacecraft industry.The combinatorial growth of interprocess conditions is accompanied by benefits (concurrent development, situational autonomy, and evolution of goals) and drawbacks (late integration, non-deterministic interactions, and multifaceted anomalies) in achieving mission success, as illustrated by the case of the Mars Reconnaissance Orbiter. Approaches to optimizing the benefits while mitigating the drawbacks have taken the form of the formalization of requirements, modular design practices, extensive system simulation, and spacecraft data trend analysis. The growth of hardware capability and software complexity can be expected to continue, with future directions including stackable commodity subsystems, computer-generated algorithms, runtime reconfigurable processors, and greater autonomy.

software↗
NASA NTRS2017

A Dose of Reality: Radiation Analysis for Realistic Human Spacecraft

INTRODUCTION As with most computational analyses, a tradeoff exists between problem complexity, resource availability and response accuracy when modeling radiation transport from the source to a detector. The largest amount of analyst time for setting up an analysis is often spent ensuring that any simplifications made have minimal impact on the results. The vehicle shield geometry of interest is typically simplified from the original CAD design in order to reduce computation time, but this simplification requires the analyst to "re-draw" the geometry with a limited set of volumes in order to accommodate a specific radiation transport software package. The resulting low-fidelity geometry model cannot be shared with or compared to other radiation transport software packages, and the process can be error prone with increased model complexity. The work presented here demonstrates the use of the DAGMC (Direct Accelerated Geometry for Monte Carlo) Toolkit from the University of Wisconsin, to model the impacts of several space radiation sources on a CAD drawing of the US Lab module. METHODS The DAGMC toolkit workflow begins with the export of an existing CAD geometry from the native CAD to the ACIS format. The ACIS format file is then cleaned using SpaceClaim to remove small holes and component overlaps. Metadata is then assigned to the cleaned geometry file using CUBIT/Trelis from csimsoft (Registered Trademark). The DAGMC plugin script removes duplicate shared surfaces, facets the geometry to a specified tolerance, and ensures that the faceted geometry is water tight. This step also writes the material and scoring information to a standard input file format that the analyst can alter as desired prior to running the radiation transport program. The scoring results can be transformed, via python script, into a 3D format that is viewable in a standard graphics program. RESULTS The CAD model of the US Lab module of the International Space Station, inclusive of all the racks and components, was simplified to remove holes and volume overlaps. Problematic features within the drawing were also removed or repaired to prevent runtime issues. The cleaned drawing was then run through the DAGMC workflow to prepare for analysis. Pilot tests modeling transport of 1GeV proton and 800MeV/A oxygen sources show that reasonable results are converged upon in an acceptable amount of overall computation time from drawing preparation to data analysis. The FLUKA radiation transport code will next be used to model both a GCR and a trapped radiation source. These results will then be compared with measurements that have been made by the radiation instrumentation deployed inside the US Lab module. DISCUSSION Early analyses have indicated that the DAGMC workflow is a promising toolkit for running vehicle geometries of interest to NASA through multiple radiation transport codes. In addition, recent work has shown that a realistic human phantom, provided via a subcontract with the University of Florida, can be placed inside any vehicle geometry for a combinatorial analysis. This added functionality gives the user the ability to score various parameters at the organ level, and the results can then be used as input for cancer risk models.

Barzilla, J. E.↗
NASA NTRS2017

Optimal Control Surface Layout for an Aeroservoelastic Wingbox

This paper demonstrates a technique for locating the optimal control surface layout of an aeroservoelastic Common Research Model wingbox, in the context of maneuver load alleviation and active utter suppression. The combinatorial actuator layout design is solved using ideas borrowed from topology optimization, where the effectiveness of a given control surface is tied to a layout design variable, which varies from zero (the actuator is removed) to one (the actuator is retained). These layout design variables are optimized concurrently with a large number of structural wingbox sizing variables and control surface actuation variables, in order to minimize the sum of structural weight and actuator weight. Results are presented that demonstrate interdependencies between structural sizing patterns and optimal control surface layouts, for both static and dynamic aeroelastic physics.

Stanford, Bret K.↗
NASA NTRS2017

The Quantum Approximation Optimization Algorithm for MaxCut: A Fermionic View

Farhi et al. recently proposed a class of quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA), for approximately solving combinatorial optimization problems. A level-p QAOA circuit consists of steps in which a classical Hamiltonian, derived from the cost function, is applied followed by a mixing Hamiltonian. The 2p times for which these two Hamiltonians are applied are the parameters of the algorithm. As p increases, however, the parameter search space grows quickly. The success of the QAOA approach will depend, in part, on finding effective parameter-setting strategies. Here, we analytically and numerically study parameter setting for QAOA applied to MAXCUT. For level-1 QAOA, we derive an analytical expression for a general graph. In principle, expressions for higher p could be derived, but the number of terms quickly becomes prohibitive. For a special case of MAXCUT, the Ring of Disagrees, or the 1D antiferromagnetic ring, we provide an analysis for arbitrarily high level. Using a Fermionic representation, the evolution of the system under QAOA translates into quantum optimal control of an ensemble of independent spins. This treatment enables us to obtain analytical expressions for the performance of QAOA for any p. It also greatly simplifies numerical search for the optimal values of the parameters. By exploring symmetries, we identify a lower-dimensional sub-manifold of interest; the search effort can be accordingly reduced. This analysis also explains an observed symmetry in the optimal parameter values. Further, we numerically investigate the parameter landscape and show that it is a simple one in the sense of having no local optima.

quantum algorithm↗
NASA NTRS2018

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

quantum computing↗
NASA NTRS2018

Semi-Autonomous Rodent Habitat for Deep Space Exploration

NASA has flown animals to space as part of trailblazing missions and to understand the biological responses to spaceflight. Mice traveled in the Lunar Module with the Apollo 17 astronauts and now mice are frequent research subjects in LEO on the ISS. The ISS rodent missions have focused on unravelling biological mechanisms, better understanding risks to astronaut health, and testing candidate countermeasures. A critical barrier for longer-duration animal missions is the need for humans-in-the-loop to perform animal husbandry and perform routine tasks during a mission. Using autonomous or telerobotic systems to alleviate some of these tasks would enable longer-duration missions to be performed at the Deep Space Gateway. Rodent missions performed using the Gateway as a platform could address a number of critical risks identified by the Human Research Program (HRP), as well as Space Biology Program questions identified by NRC Decadal Survey on Biological and Physical Sciences in Space, (2011). HRP risk areas of potentially greatest relevance that the Gateway rodent missions can address include those related to visual impairment (VIIP) and radiation risks to central nervous system, cardiovascular disease, as well as countermeasure testing. Space Biology focus areas addressed by the Gateway rodent missions include mechanisms and combinatorial effects of microgravity and radiation. The objectives of the work proposed here are to 1) develop capability for semi-autonomous rodent research in cis-lunar orbit, 2) conduct key experiments for testing countermeasures against low gravity and space radiation. The hardware and operations system developed will enable experiments at least one month in duration, which potentially could be extended to one year in duration. To gain novel insights into the health risks to crew of deep space travel (i.e., exposure to space radiation), results obtained from Gateway flight rodents can be compared to ground control groups and separate groups of mice exposed to simulated Galactic Cosmic Radiation (at the NASA Space Radiation Lab). Results can then be compared to identical experiments conducted on the ISS. Together results from Gateway, ground-based, and ISS rodent experiments will provide novel insight into the effects of space radiation.

deep space gateway↗
NASA NTRS2017

Knowledge Base for Distributed Spacecraft Mission Design Using the Trade-Space Analysis Tool for Constellations (TAT-C)

Opportunities for multi-point measurements, greater revisit frequency, failure robustness, and improved cost effectiveness motivate consideration of Distributed Spacecraft Missions (DSMs) for future Earth science missions. However, careful analysis is required to assess the distributed sensing capabilities of a constellation compared to more mature monolithic spacecraft while also considering other important dimensions such as cost and risk. The large combinatorial DSM design space limits existing mission analysis tools and exploration methods which emphasize monolithic design variables. The Trade-space Analysis Tool for Constellations (TAT-C) under development at Goddard seeks to enumerate and evaluate alternative mission architectures to minimize cost and maximize scientific return for pre-defined goals during pre-phase A analysis.Similar to other model-centric engineering efforts, efficient data management is a significant challenge for DSM mission analysis. In TAT-C, a Knowledge Base (KB) is envisioned as a cumulative central repository of information and meta-information about DSMs. Initial KB concepts store related data for reuse within or across mission analyses; however, over time, the KB is envisioned to be an important layer to coordinate actions of both human analysts and automated design agents to search a large design space for desirable mission alternatives. Preliminary KB research builds on a modern web technology stack to provide the following functionality: 1) storage of trade-space search requests which set requirements and constraints for DSM concepts, 2) storage of analysis results which quantify performance metrics for evaluated DSM concepts, 3) a RESTful application programming interface (API) for scripted access to data from TAT-C modules, 4) web-based graphical user interface (GUI) for manual access to underlying data, and 5) access control and management restrictions relevant to data protection and security. These efforts have culminated in a prototype KB used by the research team during TAT-C development to assess opportunities for future work.

Pattern Recognition↗