SEARCH · Search NASA

Results for “satisfiability problems”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,009 records · Page 56

All sources NASA NTRS DOE OSTI

NASA NTRS2002

Efficient Reformulation of the Thermoelastic Higher-order Theory for Fgms

Functionally graded materials (FGMs) are characterized by spatially variable microstructures which are introduced to satisfy given performance requirements. The microstructural gradation gives rise to continuously or discretely changing material properties which complicate FGM analysis. Various techniques have been developed during the past several decades for analyzing traditional composites and many of these have been adapted for the analysis of FGMs. Most of the available techniques use the so-called uncoupled approach in order to analyze graded structures. These techniques ignore the effect of microstructural gradation by employing specific spatial material property variations that are either assumed or obtained by local homogenization. The higher-order theory for functionally graded materials (HOTFGM) is a coupled approach developed by Aboudi et al. (1999) which takes the effect of microstructural gradation into consideration and does not ignore the local-global interaction of the spatially variable inclusion phase(s). Despite its demonstrated utility, however, the original formulation of the higher-order theory is computationally intensive. Herein, an efficient reformulation of the original higher-order theory for two-dimensional elastic problems is developed and validated. The use of the local-global conductivity and local-global stiffness matrix approach is made in order to reduce the number of equations involved. In this approach, surface-averaged quantities are the primary variables which replace volume-averaged quantities employed in the original formulation. The reformulation decreases the size of the global conductivity and stiffness matrices by approximately sixty percent. Various thermal, mechanical, and combined thermomechanical problems are analyzed in order to validate the accuracy of the reformulated theory through comparison with analytical and finite-element solutions. The presented results illustrate the efficiency of the reformulation and its advantages in analyzing functionally graded materials.

Bansal, Yogesh↗

NASA NTRS1990

Improved approximations of displacements for structural optimization

In most structural optimization problems the implicit behavior constraints are evaluated for successive modifications in the design. For each trial design, the analysis equations must be solved and the multiple repeated analyses usually involve extensive computational effort. This difficulty motivated several studies on explicit approximations of the structural behavior in terms of the design variables. The latter approach can considerably reduce the amount of computations, but the quality of the approximations might not be sufficient. Many of the approximate behavior models proposed in the past are valid only for relatively small changes in the design variables. The accuracy of the results is often insufficient for large changes in the design. The object of this study is to present efficient and high quality approximations of the structural behavior. It will be shown that the quality of the approximations can greatly be improved by combining scaling of the initial design, using intervening variables, and scaling a set of fictitious loads. Integrating these means, a powerful solution procedure can be introduced. In addition, the errors in satisfying the analysis equations can readily be evaluated. A numerical example illustrates the solution methodology and the effectiveness of the proposed approach.

Kirsch, Uri↗

NASA NTRS2004

Microfluidic Biochip Design

As humans prepare for the exploration of our solar system, there is a growing need for miniaturized medical and environmental diagnostic devices for use on spacecrafts, especially during long-duration space missions where size and power requirements are critical. In recent years, the biochip (or Lab-on-a- Chip) has emerged as a technology that might be able to satisfy this need. In generic terms, a biochip is a miniaturized microfluidic device analogous to the electronic microchip that ushered in the digital age. It consists of tiny microfluidic channels, pumps and valves that transport small amounts of sample fluids to biosensors that can perform a variety of tests on those fluids in near real time. It has the obvious advantages of being small, lightweight, requiring less sample fluids and reagents and being more sensitive and efficient than larger devices currently in use. Some of the desired space-based applications would be to provide smaller, more robust devices for analyzing blood, saliva and urine and for testing water and food supplies for the presence of harmful contaminants and microorganisms. Our group has undertaken the goal of adapting as well as improving upon current biochip technology for use in long-duration microgravity environments. In addition to developing computational models of the microfluidic channels, valves and pumps that form the basis of every biochip, we are also trying to identify potential problems that could arise in reduced gravity and develop solutions to these problems. One such problem is due to the prevalence of bubbly sample fluids in microgravity. A bubble trapped in a microfluidic channel could be detrimental to the operation of a biochip. Therefore, the process of bubble formation in microgravity needs to be studied, and a model of this process has been developed and used to understand how bubbles develop and move through biochip components. It is clear that some type of bubble filter would be necessary in Space, and several bubble filter designs are being evaluated.

Panzarella, Charles↗

NASA NTRS2018

Verification and Validation Challenges for Adaptive Flight Control of Complex Autonomous Systems

Autonomy of aerospace systems requires the ability for flight control systems to be able to adapt to complex uncertain dynamic environment. In spite of the five decades of research in adaptive control, the fact still remains that currently no adaptive control system has ever been deployed on any safety-critical or human-rated production systems such as passenger transport aircraft. The problem lies in the difficulty with the certification of adaptive control systems since existing certification methods cannot readily be used for nonlinear adaptive control systems. Research to address the notion of metrics for adaptive control began to appear in the recent years. These metrics, if accepted, could pave a path towards certification that would potentially lead to the adoption of adaptive control as a future control technology for safety-critical and human-rated production systems. Development of certifiable adaptive control systems represents a major challenge to overcome. Adaptive control systems with learning algorithms will never become part of the future unless it can be proven that they are highly safe and reliable. Rigorous methods for adaptive control software verification and validation must therefore be developed to ensure that adaptive control system software failures will not occur, to verify that the adaptive control system functions as required, to eliminate unintended functionality, and to demonstrate that certification requirements imposed by regulatory bodies such as the Federal Aviation Administration (FAA) can be satisfied. This presentation will discuss some of the technical issues with adaptive flight control and related V&V challenges.

Nguyen, Nhan T.↗

NASA NTRSDate not supplied

Implementation of a Six Degree of Freedom Precision Lunar Landing Algorithm Using Dual Quaternion Representation

In this study, a powered descent guidance algorithm using a unit dual quaternion represen- tation of the vehicle dynamics is implemented in a high-fidelity simulation and on representative flight hardware. This Dual-Quaternion Guidance (DQG) algorithm is applied to the precision lunar landing problem which levies complex constraints upon the trajectory, including state triggered attitude constraints to enable terrain-relative navigation and hazard detection as well as real-time requirements for landing site re-designation. The investigation explores DQG’s usefulness as a mission design tool as well as a real-time guidance algorithm and defines real-time performance requirements for the hazard detection and avoidance (HDA) re-targeting phase of precision lunar landing. The experiment is presented in two parts. First, DQG is implemented within a high-fidelity Monte Carlo simulation to tune the algorithm’s parameters for the simulated vehicle, to refine the mission design, and to develop guidance update timing requirements to perform the HDA maneuver. DQG generates trajectories online for the divert which are tracked by the vehicle’s inner-loop controllers to the targeted landing site. Second, DQG is run on representative hardware to demonstrate real-time operation through a divert maneuver. These results allow for rapid, flexible, optimal mission design satisfying complex constraints, and for the definition of real-time performance requirements for the HDA operations inherent in precision lunar landing. The HDA divert maneuver is found to require guidance trajectory updates in less than three seconds. DQG is found to be too slow to meet this update timing on the descent and landing computer (DLC) in its current implementation. DQG running on alternative hardware can meet the update rate requirement. Algorithm implementation improvements are also recommended which are expected to speed up computation sufficiently to meet requirements on the DLC.

GN&C↗

DOE OSTI2023

A practical approach to determine minimal quantum gate durations using amplitude-bounded quantum controls

Here, we present an iterative scheme to estimate the minimal duration in which a quantum gate can be realized while satisfying hardware constraints on the control pulse amplitudes. The scheme performs a sequence of unconstrained numerical optimal control cycles that each minimize the gate fidelity for a given gate duration alongside an additional penalty term for the control pulse amplitudes. After each cycle, the gate duration is adjusted based on the inverse of the resulting maximum control pulse amplitudes by re-scaling the dynamics to a new duration where control pulses satisfy the amplitude constraints. Those scaled controls then serve as an initial guess for the next unconstrained optimal control cycle, using the adjusted gate duration. We provide multiple numerical examples that each demonstrate fast convergence of the scheme toward a gate duration that is close to the quantum speed limit, given the control pulse amplitude bound. The proposed technique is agnostic to the underlying system and control Hamiltonian models, as well as the target unitary gate operation, making the time-scaling iteration an easy to implement and practically useful scheme for reducing the durations of quantum gate operations.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1984

Optimization of cascade blade mistuning under flutter and forced response constraints

In the development of modern turbomachinery, problems of flutter instabilities and excessive forced response of a cascade of blades that were encountered have often turned out to be extremely difficult to eliminate. The study of these instabilities and the forced response is complicated by the presence of mistuning; that is, small differences among the individual blades. The theory of mistuned cascade behavior shows that mistuning can have a beneficial effect on the stability of the rotor. This beneficial effect is produced by the coupling between the more stable and less stable flutter modes introduced by mistuning. The effect of mistuning on the forced response can be either beneficial or adverse. Kaza and Kielb have studied the effects of two types of mistuning on the flutter and forced response: alternate mistuning where alternte blades are identical and random mistuning. The objective is to investigate other patterns of mistuning which maximize the beneficial effects on the flutter and forced response of the cascade. Numerical optimization techniques are employed to obtain optimal mistuning patterns. The optimization program seeks to minimize the amount of mistuning required to satisfy constraints on flutter speed and forced response.

Murthy, D. V.↗

NASA NTRS2004

EHW Approach to Temperature Compensation of Electronics

Efforts are under way to apply the concept of evolvable hardware (EHW) to compensate for variations, with temperature, in the operational characteristics of electronic circuits. To maintain the required functionality of a given circuit at a temperature above or below the nominal operating temperature for which the circuit was originally designed, a new circuit would be evolved; moreover, to obtain the required functionality over a very wide temperature range, there would be evolved a number of circuits, each of which would satisfy the performance requirements over a small part of the total temperature range. The basic concepts and some specific implementations of EHW were described in a number of previous NASA Tech Briefs articles, namely, "Reconfigurable Arrays of Transistors for Evolvable Hardware" (NPO-20078), Vol. 25, No. 2 (February 2001), page 36; Evolutionary Automated Synthesis of Electronic Circuits (NPO- 20535), Vol. 26, No. 7 (July 2002), page 37; "Designing Reconfigurable Antennas Through Hardware Evolution" (NPO-20666), Vol. 26, No. 7 (July 2002), page 38; "Morphing in Evolutionary Synthesis of Electronic Circuits" (NPO-20837), Vol. 26, No. 8 (August 2002), page 31; "Mixtrinsic Evolutionary Synthesis of Electronic Circuits" (NPO-20773) Vol. 26, No. 8 (August 2002), page 32; and "Synthesis of Fuzzy-Logic Circuits in Evolvable Hardware" (NPO-21095) Vol. 26, No. 11 (November 2002), page 38. To recapitulate from the cited prior articles: EHW is characterized as evolutionary in a quasi-genetic sense. The essence of EHW is to construct and test a sequence of populations of circuits that function as incrementally better solutions of a given design problem through the selective, repetitive connection and/or disconnection of capacitors, transistors, amplifiers, inverters, and/or other circuit building blocks. The connection and disconnection can be effected by use of field-programmable transistor arrays (FPTAs). The evolution is guided by a search-andoptimization algorithm (in particular, a genetic algorithm) that operates in the space of possible circuits to find a circuit that exhibits an acceptably close approximation of the desired functionality. The evolved circuits can be tested by mathematical modeling (that is, computational simulation) only, tested in real hardware, or tested in combinations of computational simulation and real hardware.

Stoica, Adrian↗

DOE OSTI2020

Performance Simulation and Analysis of Occupancy-Based Control for Office Buildings with Variable-Air-Volume Systems

Variable-air-volume (VAV) systems are used in many office buildings. The minimum airflow rate setting of VAV terminal boxes has a significant impact on both energy consumption and indoor air quality. Conventional controls usually have the terminal’s minimum airflow rate at a constant (e.g., 30% or more of the terminal design airflow rate), irrespective of the occupancy status, which may cause problems, such as excessive simultaneous heating and cooling, under ventilation, and thermal comfort issues. This paper examines the potential of energy savings from occupancy-based controls (OBCs). The sensed occupancy information, either occupant presence or people count, is used to determine the airflow rate of terminal boxes, the thermostat setpoints, and the lighting control. Using EnergyPlus, a whole-building energy modeling software, the energy savings of OBC strategies are evaluated for representative existing medium office buildings in the U.S. The simulation results show that the conventional OBC, based on occupant presence sensing, can save 8% of whole-building energy use in Miami (hot climate) for systems without air-side economizer and about 13% in both Baltimore (mixed climate) and Chicago (cold climate). Comparatively, the advanced OBC, based on people counting, can save 8% in Miami to 23% in Baltimore for systems with economizers. The outdoor-air fraction of the supply air from air-handling units significantly affects the potential energy savings from the advanced OBC strategy. In addition to energy savings, the advanced OBC satisfies the zone ventilation during all occupied hours over the whole year.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2020

Realizable hyperuniform and nonhyperuniform particle configurations with targeted spectral functions via effective pair interactions

The capacity to identify realizable many-body configurations associated with targeted functional forms for the pair correlation function $g_2(r)$ or its corresponding structure factor $\textit{S(k)}$ is of great fundamental and practical importance. While there are obvious necessary conditions that a prescribed structure factor at number density ρ must satisfy to be configurationally realizable, sufficient conditions are generally not known due to the infinite degeneracy of configurations with different higher-order correlation functions. A major aim of this paper is to expand our theoretical knowledge of the class of pair correlation functions or structure factors that are realizable by classical disordered ensembles of particle configurations, including exotic “hyperuniform” varieties. We first introduce a theoretical formalism that provides a means to draw classical particle configurations from canonical ensembles with certain pairwise-additive potentials that could correspond to targeted analytical functional forms for the structure factor. This formulation enables us to devise an improved algorithm to construct systematically canonical-ensemble particle configurations with such targeted pair statistics, whenever realizable. As a proof of concept, we test the algorithm by targeting several different structure factors across dimensions that are known to be realizable and one hyperuniform target that is known to be nontrivially unrealizable. Our algorithm succeeds for all realizable targets and appropriately fails for the unrealizable target, demonstrating the accuracy and power of the method to numerically investigate the realizability problem. Subsequently, we also target several families of structure-factor functions that meet the known necessary realizability conditions but are not known to be realizable by disordered hyperuniform point configurations, including $\textit{d}$-dimensional Gaussian structure factors, $\textit{d}$-dimensional generalizations of the two-dimensional one-component plasma (OCP), and the $\textit{d}$-dimensional Fourier duals of the previous OCP cases. Moreover, we also explore unusual nonhyperuniform targets, including “hyposurficial” and “antihyperuniform” examples. In all of these instances, the targeted structure factors are achieved with high accuracy, suggesting that they are indeed realizable by equilibrium configurations with pairwise interactions at positive temperatures. Remarkably, we also show that the structure factor of nonequilibrium perfect glass, specified by two-, three-, and four-body interactions, can also be realized by equilibrium pair interactions at positive temperatures. In this work, our findings lead us to the conjecture that any realizable structure factor corresponding to either a translationally invariant equilibrium or nonequilibrium system can be attained by an equilibrium ensemble involving only effective pair interactions. Our investigation not only broadens our knowledge of analytical functional forms for $g_2(r)$ and $\textit{S(k)}$ associated with disordered point configurations across dimensions but also deepens our understanding of many-body physics. Moreover, our work can be applied to the design of materials with desirable physical properties that can be tuned by their pair statistics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2026

Requirements Description of DASSH-F

This report reviews the modeling and simulation capabilities of Argonne National Laboratory’s DASSH code that is used in present reactor analysis activities. These capabilities will be used to establish the set of verification tasks necessary to verify DASSH for use on commercial projects. A similar approach was taken for the PERSENT, REBUS and DIF3D software packages. The DASSH program is a thermal analysis code designed to rapidly allow a reactor design engineer to obtain flow rates requirements that satisfy peak temperature constraints in the domain. DASSH is a follow-on development to the SE2-ANL software and SUPERENERGY-2 software that it is based upon. DASSH was designed to account for both neutron and gamma heating and is inherently connected to the GAMSOR part of the ARC suite of fast reactor analysis software. SE2-ANL is a developed piece of software from the 1980s while DASSH is a modern implementation with notable improvements in geometry handling. The most important upgrade of DASSH relative to SE2-ANL is that it can analyze multiple time points in a single run where SE2-ANL can only treat a single time point. This allows the user to understand the impact of and search the flow distribution for the entire operational period of a reactor design considering pressure drop, peak coolant and fuel temperatures, and thermal striping. DASSH has three input paths that have to be verified. The first input path builds the geometry and power distribution based upon the DIF3D model but ignores the gamma heating aspects of the problem. The second input path also builds the geometry from the DIF3D model but it takes the neutron and gamma heating distributions from GAMSOR. The third input path is to take the geometry and power distribution directly from user input (i.e. not coupled to DIF3D or GAMSOR). DASSH also has many built in correlations for material properties along with a user defined specification of the fuel, structure, and coolant properties. There are correlations for flow split, mixing, pressure drop, and heat transfer coefficients (subchannel rather than a direct methodology). In total, verification of DASSH will require an extensive testing to cover all possible user features of the software.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

NASA NTRS2007

Enhanced Elliptic Grid Generation

An enhanced method of elliptic grid generation has been invented. Whereas prior methods require user input of certain grid parameters, this method provides for these parameters to be determined automatically. "Elliptic grid generation" signifies generation of generalized curvilinear coordinate grids through solution of elliptic partial differential equations (PDEs). Usually, such grids are fitted to bounding bodies and used in numerical solution of other PDEs like those of fluid flow, heat flow, and electromagnetics. Such a grid is smooth and has continuous first and second derivatives (and possibly also continuous higher-order derivatives), grid lines are appropriately stretched or clustered, and grid lines are orthogonal or nearly so over most of the grid domain. The source terms in the grid-generating PDEs (hereafter called "defining" PDEs) make it possible for the grid to satisfy requirements for clustering and orthogonality properties in the vicinity of specific surfaces in three dimensions or in the vicinity of specific lines in two dimensions. The grid parameters in question are decay parameters that appear in the source terms of the inhomogeneous defining PDEs. The decay parameters are characteristic lengths in exponential- decay factors that express how the influences of the boundaries decrease with distance from the boundaries. These terms govern the rates at which distance between adjacent grid lines change with distance from nearby boundaries. Heretofore, users have arbitrarily specified decay parameters. However, the characteristic lengths are coupled with the strengths of the source terms, such that arbitrary specification could lead to conflicts among parameter values. Moreover, the manual insertion of decay parameters is cumbersome for static grids and infeasible for dynamically changing grids. In the present method, manual insertion and user specification of decay parameters are neither required nor allowed. Instead, the decay parameters are determined automatically as part of the solution of the defining PDEs. Depending on the shape of the boundary segments and the physical nature of the problem to be solved on the grid, the solution of the defining PDEs may provide for rates of decay to vary along and among the boundary segments and may lend itself to interpretation in terms of one or more physical quantities associated with the problem.

Kaul, Upender K.↗

NASA NTRS2015

Use of Generalized Fluid System Simulation Program (GFSSP) for Teaching and Performing Senior Design Projects at the Educational Institutions

This paper describes the experience of the authors in using the Generalized Fluid System Simulation Program (GFSSP) in teaching Design of Thermal Systems class at University of Alabama in Huntsville. GFSSP is a finite volume based thermo-fluid system network analysis code, developed at NASA/Marshall Space Flight Center, and is extensively used in NASA, Department of Defense, and aerospace industries for propulsion system design, analysis, and performance evaluation. The educational version of GFSSP is freely available to all US higher education institutions. The main purpose of the paper is to illustrate the utilization of this user-friendly code for the thermal systems design and fluid engineering courses and to encourage the instructors to utilize the code for the class assignments as well as senior design projects. The need for a generalized computer program for thermofluid analysis in a flow network has been felt for a long time in aerospace industries. Designers of thermofluid systems often need to know pressures, temperatures, flow rates, concentrations, and heat transfer rates at different parts of a flow circuit for steady state or transient conditions. Such applications occur in propulsion systems for tank pressurization, internal flow analysis of rocket engine turbopumps, chilldown of cryogenic tanks and transfer lines, and many other applications of gas-liquid systems involving fluid transients and conjugate heat and mass transfer. Computer resource requirements to perform time-dependent, three-dimensional Navier-Stokes computational fluid dynamic (CFD) analysis of such systems are prohibitive and therefore are not practical. Available commercial codes are generally suitable for steady state, single-phase incompressible flow. Because of the proprietary nature of such codes, it is not possible to extend their capability to satisfy the above-mentioned needs. Therefore, the Generalized Fluid System Simulation Program (GFSSP1) has been developed at NASA Marshall Space Flight Center (MSFC) as a general fluid flow system solver capable of handling phase changes, compressibility, mixture thermodynamics and transient operations. It also includes the capability to model external body forces such as gravity and centrifugal effects in a complex flow network. The objectives of GFSSP development are: a) to develop a robust and efficient numerical algorithm to solve a system of equations describing a flow network containing phase changes, mixing, and rotation; and b) to implement the algorithm in a structured, easy-to-use computer program. The analysis of thermofluid dynamics in a complex network requires resolution of the system into fluid nodes and branches, and solid nodes and conductors as shown in Figure 1. Figure 1 shows a schematic and GFSSP flow circuit of a counter-flow heat exchanger. Hot nitrogen gas is flowing through a pipe, colder nitrogen is flowing counter to the hot stream in the annulus pipe and heat transfer occurs through metal tubes. The problem considered is to calculate flowrates and temperature distributions in both streams. GFSSP has a unique data structure, as shown in Figure 2, that allows constructing all possible arrangements of a flow network with no limit on the number of elements. The elements of a flow network are boundary nodes where pressure and temperature are specified, internal nodes where pressure and temperature are calculated, and branches where flowrates are calculated. For conjugate heat transfer problems, there are three additional elements: solid node, ambient node, and conductor. The solid and fluid nodes are connected with solid-fluid conductors. GFSSP solves the conservation equations of mass and energy, and equation of state in internal nodes to calculate pressure, temperature and resident mass. The momentum conservation equation is solved in branches to calculate flowrate. It also solves for energy conservation equations to calculate temperatures of solid nodes. The equations are coupled and nonlinear; therefore, they are solved by an iterative numerical scheme. GFSSP employs a unique numerical scheme known as simultaneous adjustment with successive substitution (SASS), which is a combination of Newton-Raphson and successive substitution methods. The mass and momentum conservation equations and the equation of state are solved by the Newton-Raphson method while the conservation of energy and species are solved by the successive substitution method. GFSSP is linked with two thermodynamic property programs, GASP2 and WASP3 and GASPAK4, that provide thermodynamic and thermophysical properties of selected fluids. Both programs cover a range of pressure and temperature that allows fluid properties to be evaluated for liquid, liquid-vapor (saturation), and vapor region. GASP and WASP provide properties of 12 fluids. GASPAK includes a library of 36 fluids. GFSSP has three major parts. The first part is the graphical user interface (GUI), visual thermofluid analyzer of systems and components (VTASC). VTASC allows users to create a flow circuit by a 'point and click' paradigm. It creates the GFSSP input file after the completion of the model building process. GFSSP's GUI provides the users a platform to build and run their models. It also allows post-processing of results. The network flow circuit is first built using three basic elements: boundary node, internal node, and branch.

Majumdar, A. K.↗

NASA NTRS2011

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

NASA NTRS1994

Task scheduling in dataflow computer architectures

Dataflow computers provide a platform for the solution of a large class of computational problems, which includes digital signal processing and image processing. Many typical applications are represented by a set of tasks which can be repetitively executed in parallel as specified by an associated dataflow graph. Research in this area aims to model these architectures, develop scheduling procedures, and predict the transient and steady state performance. Researchers at NASA have created a model and developed associated software tools which are capable of analyzing a dataflow graph and predicting its runtime performance under various resource and timing constraints. These models and tools were extended and used in this work. Experiments using these tools revealed certain properties of such graphs that require further study. Specifically, the transient behavior at the beginning of the execution of a graph can have a significant effect on the steady state performance. Transformation and retiming of the application algorithm and its initial conditions can produce a different transient behavior and consequently different steady state performance. The effect of such transformations on the resource requirements or under resource constraints requires extensive study. Task scheduling to obtain maximum performance (based on user-defined criteria), or to satisfy a set of resource constraints, can also be significantly affected by a transformation of the application algorithm. Since task scheduling is performed by heuristic algorithms, further research is needed to determine if new scheduling heuristics can be developed that can exploit such transformations. This work has provided the initial development for further long-term research efforts. A simulation tool was completed to provide insight into the transient and steady state execution of a dataflow graph. A set of scheduling algorithms was completed which can operate in conjunction with the modeling and performance tools previously developed. Initial studies on the performance of these algorithms were done to examine the effects of application algorithm transformations as measured by such quantities as number of processors, time between outputs, time between input and output, communication time, and memory size.

Katsinis, Constantine↗

DOE OSTI2025

Decoding the Desorption Mechanism of 2LiH:1Mg(NH2)2 Using Metal Borohydrides

The complex metal hydride 2LiH:1Mg(NH2)2 has emerged as a promising material for stationary hydrogen storage applications, such as seasonal storage or energy backup systems, due to its high volumetric and gravimetric capacities and robust reversibility. However, its widespread adoption is hindered by sluggish reaction rates, performance degradation upon cycling, and improper end-use cases. To address these problems and better understand the desorption pathway, we used metal borohydrides (MBH4; M = Li–Cs) as chemical probes. A thorough analysis of the bulk behavior of all six materials, including hydrogen cycling experiments, X-ray absorption spectroscopy, FTIR, pXRD, solid-state NMR, and ab initio DFT simulations, shows that the borohydride additives decrease the activation energy of hydrogen release by about 20 kJ/mol for MBH4@2:1 materials versus pristine. Furthermore, more surface-sensitive studies show that the amide-to-imide desorption pathway in these materials, while essentially complete in the bulk, is incomplete in the near-surface region, suggesting an “inverse core–shell” desorption mechanism for amide dehydrogenation to imide. The kinetic enhancements produced by MBH4 additives (M = K, Rb, and Cs) are attributed to the destabilization of the amide N–H bond and interaction with the LiH/Mg(NH2)2 interface to promote H–H bond formation. An inverse core-shell mechanism is also operative in the hydrogen desorption for the 2LiH:1LiNH2 system, suggesting this may be a general feature of amides. Given the fast dehydrogenation rate and large gravimetric capacity, these materials satisfy these requirements for telecom backups and seasonal microgrid storage applications.

Absorption↗

DOE OSTI2026

Conus-Wide Mapping of Water Availability and Cost

Background: New demands for water can be satisfied through a variety of source options. In some basins surface and/or groundwater may be available through permitting with the state water management agency (termed unappropriated water), alternatively water might be purchased and transferred out of its current use to another (termed appropriated water), or non-traditional water sources can be captured and treated (e.g., wastewater). The relative availability and cost of each source are key factors in the development decision. Unfortunately, these measures are location dependent with no consistent or comparable set of data available for evaluating competing water sources. With the help of water managers, water availability was mapped for over 2500 watersheds throughout CONUS. These values are unique in that they account for institutional factors (i.e., water rights, compacts, treaties, instream flows) that locally limit water use. Five water sources were individually examined, including unappropriated surface water, unappropriated groundwater, appropriated water, municipal wastewater and brackish groundwater. Associated costs to acquire, convey and treat the water, as necessary, for each of the five sources were estimated. These metrics were developed to support regional water planning and policy analysis with initial application to electric transmission planning in the western US. Problem: These data were originally developed in 20141 and updated in 20182. New datasets on which these data depend have been published. As such, there is need to update the water availability and cost data. There is also need to map this same data to a county resolution and to publish the data in a more accessible place. Organization of the dataset: Data are organized according to five primary water sources: • Unappropriated fresh surface water • Unappropriated fresh groundwater • Appropriated water • Recycled wastewater, and • Brackish water

Tidwell, Vincent [Pacific Northwest National Labor↗

NASA NTRS2000

Autonomy Architectures for a Constellation of Spacecraft

Until the past few years, missions typically involved fairly large expensive spacecraft. Such missions have primarily favored using older proven technologies over more recently developed ones, and humans controlled spacecraft by manually generating detailed command sequences with low-level tools and then transmitting the sequences for subsequent execution on a spacecraft controller. This approach toward controlling a spacecraft has worked spectacularly on previous missions, but it has limitations deriving from communications restrictions - scheduling time to communicate with a particular spacecraft involves competing with other projects due to the limited number of deep space network antennae. This implies that a spacecraft can spend a long time just waiting whenever a command sequence fails. This is one reason why the New Millennium program has an objective to migrate parts of mission control tasks onboard a spacecraft to reduce wait time by making spacecraft more robust. The migrated software is called a "remote agent" and has 4 components: a mission manager to generate the high level goals, a planner/scheduler to turn goals into activities while reasoning about future expected situations, an executive/diagnostics engine to initiate and maintain activities while interpreting sensed events by reasoning about past and present situations, and a conventional real-time subsystem to interface with the spacecraft to implement an activity's primitive actions. In addition to needing remote planning and execution for isolated spacecraft, a trend toward multiple-spacecraft missions points to the need for remote distributed planning and execution. The past few years have seen missions with growing numbers of probes. Pathfinder has its rover (Sojourner), Cassini has its lander (Huygens), and the New Millenium Deep Space 3 (DS3) proposal involves a constellation of 3 spacecraft for interferometric mapping. This trend is expected to continue to progressively larger fleets. For example, one mission proposed to succeed DS3 would have 18 spacecraft flying in formation in order to detect earth-sized planets orbiting other stars. A proposed magnetospheric constellation would involve 5 to 500 spacecraft in Earth orbit to measure global phenomena within the magnetosphere. This work describes and compares three autonomy architectures for a system that continuously plans to control a fleet of spacecraft using collective mission goals instead of goals or command sequences for each spacecraft. A fleet of self-commanding spacecraft would autonomously coordinate itself to satisfy high level science and engineering goals in a changing partially-understood environment making feasible the operation of tens or even a hundred spacecraft (such as for interferometry or plasma physics missions). The easiest way to adapt autonomous spacecraft research to controlling constellations involves treating the constellation as a single spacecraft. Here one spacecraft directly controls the others as if they were connected. The controlling "master" spacecraft performs all autonomy reasoning, and the slaves only have real-time subsystems to execute the master's commands and transmit local telemetry/observations. The executive/diagnostics module starts actions and the master's real-time subsystem controls the action either locally or remotely through a slave. While the master/slave approach benefits from conceptual simplicity, it relies on an assumption that the master spacecraft's executive can continuously monitor the slaves' real-time subsystems, and this relies on high-bandwidth highly-reliable communications. Since unintended results occur fairly rarely, one way to relax the bandwidth requirements involves only monitoring unexpected events in spacecraft. Unfortunately, this disables the ability to monitor for unexpected events between spacecraft and leads to a host of coordination problems among the slaves. Also, failures in the communications system can result in losing slaves. The other two architectures improve robustness while reducing communications by progressively distributing more of the other three remote agent components across the constellation. In a teamwork architecture, all spacecraft have executives and real-time subsystems - only the leader has the planner/scheduler and mission manager. Finally, distributing all remote agent components leads to a peer-to-peer approach toward constellation control.

Barrett, Anthony↗