Search NASA⌕ Search

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.

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

At least 217 records · Page 12

Time-Varying Modification of Reference Model for Adaptive Control with Performance Optimization

This paper presents a new adaptive control ap- proach that involves a performance optimization objective. The control synthesis involves the design of a performance optimizing adaptive controller from a subset of control inputs. The resulting effect of the performance optimizing adaptive controller is to modify the initial reference model into a time-varying reference model which satisfies the performance optimization requirement obtained from an optimal control problem. The time-varying reference model modification is accomplished by the real-time solutions of the time-varying Riccati and Sylvester equations coupled with the least-squares parameter estimation of the sen- sitivities of the performance metric. The effectiveness of the proposed method is demonstrated by an application of maneuver load alleviation control for a flexible aircraft.

Adaptive Control↗

Automating System Assembly of Aerospace Systems

One of the major challenges in modern aerospace designs is the integration and assembly of independently developed components. We have formalized this as the system assembly problem: from a sea of available components, which should be selected and how should they be connected, integrated, and assembled so that the overall system requirements are satisfied in a certifiable way? We present a powerful framework for automatically solving the system assembly problem directly from system requirements by using formal verification technology. We also present a case study where we applied our work to large-scale industrial examples from the Boeing Dreamliner.

Manolios, Panagiotis↗

Inverse design of a proper number, shapes, sizes, and locations of coolant flow passages

During the past several years we have developed an inverse method that allows a thermal cooling system designer to determine proper sizes, shapes, and locations of coolant passages (holes) in, say, an internally cooled turbine blade, a scram jet strut, a rocket chamber wall, etc. Using this method the designer can enforce a desired heat flux distribution on the hot outer surface of the object, while simultaneously enforcing desired temperature distributions on the same hot outer surface as well as on the cooled interior surfaces of each of the coolant passages. This constitutes an over-specified problem which is solved by allowing the number, sizes, locations and shapes of the holes to adjust iteratively until the final internally cooled configuration satisfies the over-specified surface thermal conditions and the governing equation for the steady temperature field. The problem is solved by minimizing an error function expressing the difference between the specified and the computed hot surface heat fluxes. The temperature field analysis was performed using our highly accurate boundary integral element code with linearly varying temperature along straight surface panels. Examples of the inverse design applied to internally cooled turbine blades and scram jet struts (coated and non-coated) having circular and non-circular coolant flow passages will be shown.

George S. Dulikravich↗

A New Time-Space Accurate Scheme for Hyperbolic Problems: Quasi-Explicit Case - 1

This paper presents a new discretization scheme for hyperbolic systems of conservations laws. It satisfies the TVD property and relies on the new high-resolution mechanism which is compatible with the genuinely multidimensional approach proposed recently. This work can be regarded as a first step towards extending the genuinely multidimensional approach to unsteady problems. Discontinuity capturing capabilities and accuracy of the scheme are verified by a set of numerical tests.

Sidilkover, David↗

Application of an advanced trajectory optimization method to ramjet propelled missiles

The mission performance characteristics of ramjet-propelled missiles are highly dependent upon the trajectory flown. Integration of the trajectory profile with the ramjet propulsion system performance characteristics to achieve optimal missile performance is very complex. Past trajectory optimization methods have been extremely problem dependent and require a high degree of familiarity to achieve success. A general computer code (CTOP) has been applied to ramjet-powered missiles to compute open-loop optimal trajectories. CTOP employs Chebyshev polynomial representations of the states and controls. This allows a transformation of the continuous optimal control problem to one of parameter optimization. With this method, the trajectory boundary conditions are always satisfied. State dynamics and path constraints are enforced via penalty functions. The presented results include solutions to minimum fuel-to-climb, minimum time-to-climb, and minimum time-to-target intercept problems.

Paris, S. W.↗

Planning as a Precursor to Scheduling for Space Station Payload Operations

Contemporary schedulers attempt to solve the problem of best fitting a set of activities into an available timeframe while still satisfying the necessary constraints. This approach produces results which are optimized for the region of time the scheduler is able to process, satisfying the near term goals of the operation. In general the scheduler is not able to reason about the activities which precede or follow the window into which it is inputs to scheduling so that the intermediate placing activities. This creates a problem for operations which are composed of many activities spanning long durations (which exceed the scheduler's reasoning horizon) such as the continuous operations environment for payload operations on the Space Station. Not only must the near term scheduling objectives be met, but somehow the results of near term scheduling must be made to support the attainment of long term goals.

Howell, Eric↗

Visualization and efficient generation of constrained high-dimensional theoretical parameter spaces

We describe a set of novel methods for efficiently sampling high-dimensional parameter spaces of physical theories defined at high energies, but constrained by experimental measurements made at lower energies. Often, theoretical models such as supersymmetry are defined by many parameters, $\mathcal{O}$(10 – 100), expressed at high energies, while relevant experimental constraints are often defined at much lower energies, preventing them from directly ruling out portions of the space. Instead, the low-energy constraints define a complex, potentially non-contiguous subspace of the theory parameters. Naive scanning of the theory space for points which satisfy the low-energy constraints is hopelessly inefficient due to the high dimensionality, and the inverse problem is considered intractable. As a result, many theoretical spaces remain under-explored. We introduce a class of modified generative autoencoders, which attack this problem by mapping the high-dimensional parameter space to a structured low-dimensional latent space, allowing for easy visualization and efficient generation of theory points which satisfy experimental constraints. An extension without dimensional compression, which focuses on limiting potential information loss, is also introduced.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A quadratic programming flux correction method for high-order DG discretizations of S transport

In this work, we present a new flux-fixup approach for arbitrarily high-order discontinuous Galerkin (DG) discretizations of the S N transport equation, and we demonstrate the compatibility of this approach with the Variable Eddington Factor (VEF) method. The new fixup approach is sweep-compatible: during a transport sweep (block Gauss-Seidel iteration in which the scattering source is lagged), a local quadratic programming (QP) problem is solved in each spatial element to ensure that the solution satisfies certain physical constraints, including local particle balance. In this paper, we describe two choices of physical constraints, resulting in two variants of the method: QP Zero (QPZ) and QP Maximum Principle (QPMP). In QPZ, the finite element coefficients of the solution are constrained to be nonnegative. In QPMP, they are constrained to adhere to an approximate discrete maximum principle. There are two primary takeaways in this paper. First, when the positive Bernstein basis is used for DG discretization, the QPMP method eliminates negativities, preserves high-order accuracy for smooth problems, and significantly dampens unphysical oscillations in the solution. The latter feature – the dampening of unphysical oscillations – is an improvement upon standard, simpler fixup approaches such as the approach described in (denoted as the “zero and rescale” (ZR) method in this paper). This improvement comes at a moderate computational cost, but it is not prohibitive. Our results show that, even in an unrealistic worst-case scenario where 83% of the spatial elements require a fixup, the computational cost of performing a transport sweep with fixup is only ~31% greater than performing one without fixup. The second takeaway is that the VEF method can be used to accelerate the convergence of transport sweeps even when a fixup is applied. When optically thick regions are present, transport sweeps converge slowly, regardless of whether a fixup is applied, and acceleration is needed. However, attempting to apply standard diffusion synthetic acceleration (DSA) to fixed-up transport sweeps results in divergence for optically thick problems. Our results show that the same is not true for VEF. When VEF is combined with fixed-up transport sweeps, the result is a scheme that produces a nonnegative solution, converges independently of the mean free path, and, in the case of the QPMP fixup, adheres to an approximate discrete maximum principle.

97 MATHEMATICS AND COMPUTING↗

On recontamination and directional-bias problems in Monte Carlo simulation of PDF turbulence models

Turbulent combustion can not be simulated adequately by conventional moment closure turbulent models. The probability density function (PDF) method offers an attractive alternative: in a PDF model, the chemical source terms are closed and do not require additional models. Because the number of computational operations grows only linearly in the Monte Carlo scheme, it is chosen over finite differencing schemes. A grid dependent Monte Carlo scheme following J.Y. Chen and W. Kollmann has been studied in the present work. It was found that in order to conserve the mass fractions absolutely, one needs to add further restrictions to the scheme, namely alpha(sub j) + gamma(sub j) = alpha(sub j - 1) + gamma(sub j + 1). A new algorithm was devised that satisfied this restriction in the case of pure diffusion or uniform flow problems. Using examples, it is shown that absolute conservation can be achieved. Although for non-uniform flows absolute conservation seems impossible, the present scheme has reduced the error considerably.

Hsu, Andrew T.↗

On recontamination and directional-bias problems in Monte Carlo simulation of PDF turbulence models

Turbulent combustion can not be simulated adequately by conventional moment closure turbulence models. The difficulty lies in the fact that the reaction rate is in general an exponential function of the temperature, and the higher order correlations in the conventional moment closure models of the chemical source term can not be neglected, making the applications of such models impractical. The probability density function (pdf) method offers an attractive alternative: in a pdf model, the chemical source terms are closed and do not require additional models. A grid dependent Monte Carlo scheme was studied, since it is a logical alternative, wherein the number of computer operations increases only linearly with the increase of number of independent variables, as compared to the exponential increase in a conventional finite difference scheme. A new algorithm was devised that satisfies a restriction in the case of pure diffusion or uniform flow problems. Although for nonuniform flows absolute conservation seems impossible, the present scheme has reduced the error considerably.

Hsu, Andrew T.↗

Stability of orthotropic stiffened composite plates.

It is pointed out that the buckling problem of a plate with restrictions resulting from boundary conditions is suited for an application of Lagrangian multipliers. An approach used by Budiansky and Hu (1946) is extended to the study of orthotropic stiffened plates. The variations of the total energy with respect to the three deformation components are considered. The equilibrium equations and the boundary conditions are obtained. It is shown that the deflection functions must satisfy the equilibrium equations. The Lagrangian multipliers are then used to solve stability problems on the basis of the total energy involved, the equilibrium equations, and the boundary conditions. The theoretical analysis is supplemented by an experimental investigation.

Chiu, K. D.↗

Dynamic Asset Allocation with Expected Shortfall via Quantum Annealing

Recent advances in quantum hardware offer new approaches to solve various optimization problems that can be computationally expensive when classical algorithms are employed. We propose a hybrid quantum-classical algorithm to solve a dynamic asset allocation problem where a target return and a target risk metric (expected shortfall) are specified. We propose an iterative algorithm that treats the target return as a constraint in a Markowitz portfolio optimization model, and dynamically adjusts the target return to satisfy the targeted expected shortfall. The Markowitz optimization is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem. The use of the expected shortfall risk metric enables the modeling of extreme market events. We compare the results from D-Wave’s 2000Q and Advantage quantum annealers using real-world financial data. Both quantum annealers are able to generate portfolios with more than 80% of the return of the classical optimal solutions, while satisfying the expected shortfall. We observe that experiments on assets with higher correlations tend to perform better, which may help to design practical quantum applications in the near term.

97 MATHEMATICS AND COMPUTING↗

Combined design of structures and controllers for optimal maneuverability

Approaches to the combined design of structures and controllers for achieving optimal maneuverability are presented. A maneuverability index which directly reflects the minimum time required to perform a given set of maneuvers is introduced. By designing the flexible appendages, the maneuver time of the spacecraft is minimized under the constraints of structural properties, and post maneuver spillover is kept within a specified bound. The spillover reduction is achieved by making use of an appropriate reduced order model. The distributed parameter design problem is approached using assumed shape functions, and finite element analysis with dynamic reduction. Solution procedures have been investigated. Approximate design methods have been developed to overcome the computational difficulties. Some new constraints on the modal frequencies of the spacecraft are introduced in the original optimization problem to facilitate the solution process. It is shown that the global optimal design may be obtained by tuning the natural frequencies to satisfy specific constraints. Researchers quantify the difference between a lower bound to the solution for maneuver time associated with the original problem and the estimate obtained from the modified problem, for a specified application requirement. Numerical examples are presented to demonstrate the capability of this approach.

Ling, Jer↗

Grand unification at the cosmological collider with chemical potential

We introduce a tree-level chemical potential mechanism for spin-1 particles within cosmological collider physics, allowing them to be detected in primordial non-Gaussianities for masses above the inflationary Hubble scale. We apply this mechanism to orbifold grand unification and the massive unification partners of the standard model gauge bosons. Our mechanism requires at least a pair of massive vector fields which are singlets of the standard model, a condition which is satisfied in the classic “trinification” scenario. Assuming that the gauge hierarchy problem is solved by supersymmetry, gauge coupling running points to unification partners at ~ 10$^{15}$ GeV. We show that, within high-scale inflation, chemical potential enhancement can lead to observably strong signals for trinification partners in future cosmological surveys.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Shuttle mission simulator hardware conceptual design report

The detailed shuttle mission simulator hardware requirements are discussed. The conceptual design methods, or existing technology, whereby those requirements will be fulfilled are described. Information of a general nature on the total design problem plus specific details on how these requirements are to be satisfied are reported. The configuration of the simulator is described and the capabilities for various types of training are identified.

Burke, J. F.↗

Evaluation of S-Band FM Direct Link Signal and System Design

The adequacy of the S-band FM downlink as part of space shuttle orbiter communication links, was assessed to satisfy all known requirements during all mission phases. Some potential performance problems are described and corrective actions are recommended when appropriate.

Source record↗

Energy conserving norms for the solution of hyperbolic systems of partial differential equations

The hyperbolic system of partial differential equations with a real constant square coefficient matrix A is considered. The problem of finding an energy conserving norm for the solution of the system is reduced to the problem of characterizing those matrices appearing in the boundary conditions which satisfy two specific matrix equations. Necessary and sufficient conditions on the coefficient matrix A and the matrices appearing in boundary conditions are derived for an energy conserving norm. The conditions serve as criteria on a given system which determine whether or not the solution will have its energy conserved in some norm. Examples of specific systems and boundary conditions are also provided.

Gunzburger, M. D.↗

A boundary element method for unsteady viscous flows

A potential vorticity method for the analysis of unsteady viscous incompressible flow past arbitrarily shaped objects is discussed which is based on the Helmholtz decomposition. It is found that the correct boundary condition to be imposed is on the normal component of the velocity for the cases of both inviscid and viscous flows. The no-slip condition is shown to be automatically satisfied for viscous flows. Numerical solutions for two-dimensional flow problems are given for attached flows in addition to those involving separation. The vorticity is confined, at least for the case of symmetric flows, to a small region in the immediate vicinity of the body, making possible the minimization of the number of node points in the field, and hence the computational time, without loss of accuracy.

Bharadvaj, B. K.↗