Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “BOUND STATE”

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 469 records · Page 26

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗

Diagrammatic perturbation theory - N2 X1 Sigma/plus/g

The diagrammatic many-body perturbation theory is used to calculate the correlation energy of the nitrogen molecule in its electronic ground state. Using the algebraic approximation, the energy is evaluated through third order, including all many-body effects. (2/1) Pade approximants and variational upper bounds are constructed. For one of the perturbation expansions considered, the (2/1) Pade approximant leads to the recovery of 79.5 percent of the empirical correlation energy, while the variational upper bound recovers 72.0 percent. Three-body effects are examined in some detail. The relationships with previous work on N2 are discussed.

Wilson, S.↗

The Galileo single-event upset solution and risk assessment

The Galileo probe will be subject to radiation fields and energetic particle bombardment during its outward bound journey and in orbit around Jupiter and its moons. To avoid the occurrence and propagation of effects of single event upset (SEU) bit state changes induced by the bombardments attempts were made to harden the Galileo electronics against SEUs. The hazards are especially acute for Schottky diode and low-power Schottky TTL parts. The preventive action options which were scheduled are reviewed, noting the selection of CMOS chips as replacements for SEU-susceptible devices. The simulation and risk assessment that were performed to evaluate the potential success of the replacements are summarized, with emphasis on the data employed to ensure the accuracy of the assessments and the predicted effects of SEUs in the various Galileo subsystems.

Burdick, Garry M.↗

Order reduction in linear state estimation under performance constraints

The design and analysis of minimal-order state estimators for possibly time-varying linear systems, under constraints on the maximal allowable mean-square error, are considered. A global lower bound on the optimal error is derived, along with a lower bound on the minimal estimator order, needed for meeting the performance constraint. The ideal reduced-order estimator which satisfies the lower bound is derived, along with conditions for its realizability. When the ideal estimator is not realizable, its structure forms a suboptimal estimator, which maintains, in some sense, a local optimality property and is called the pseudoideal estimator. The mean-square error of the pseudoideal estimator defines upper bounds on the optimal error and on the estimator order needed for meeting the performance constraint. The lower and the upper bounds on the order define a reduced search set for the design problem. When the distance between the ideal and the pseudoideal estimators is sufficiently small in a certain numerical sense, the pseudoideal estimator may be considered optimal for practical purposes.

Baram, Yoram↗

Mercury

Papers are presented on future observations of and missions to Mercury, the photometry and polarimetry of Mercury, the surface composition of Mercury from reflectance spectrophotometry, the Goldstone radar observations of Mercury, the radar observations of Mercury, the stratigraphy and geologic history of Mercury, the geomorphology of impact craters on Mercury, and the cratering record on Mercury and the origin of impacting objects. Consideration is also given to the tectonics of Mercury, the tectonic history of Mercury, Mercury's thermal history and the generation of its magnetic field, the rotational dynamics of Mercury and the state of its core, Mercury's magnetic field and interior, the magnetosphere of Mercury, and the Mercury atmosphere. Other papers are on the present bounds on the bulk composition of Mercury and the implications for planetary formation processes, the building stones of the planets, the origin and composition of Mercury, the formation of Mercury from planetesimals, and theoretical considerations on the strange density of Mercury.

Vilas, Faith↗

Deformation of Fluid Column by Action of Axial Vibration and Some Aspects of High-Rate Thermocapillary Convection

The deformation of the fluid column by an action of a low-frequency vibration is considered. It is shown that behavior of the free fluid surface depends on the frequency of applied vibration and its amplitude. In the area of very low frequencies when fluid has time to comment on travel of bounding solid walls limiting column, the harmonical oscillations of free surface with given frequency are observed. With increase of vibration frequency the steady-state relief on free fluid surface is formed. If the amplitude of vibration is very small and the frequency corresponding to the first peak in the vibration spectrum on the Mir orbital station, the deformation of free surface tends to zero. Fluid flow induced thermocapillary effect on deformed free surface is more unstable as in the case of smooth cylindrical surface. It was shown that width of heating zone affects very essentially the flow pattern and transition to oscillatory regime of thermocapillary convection.

Feonychev, Alexander I.↗

Adaptive Multi-Agent Systems for Constrained Optimization

Product Distribution (PD) theory is a new framework for analyzing and controlling distributed systems. Here we demonstrate its use for distributed stochastic optimization. First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (probability distribution of) the joint state of the agents. When the game in question is a team game with constraints, that equilibrium optimizes the expected value of the team game utility, subject to those constraints. The updating of the Lagrange parameters in the Lagrangian can be viewed as a form of automated annealing, that focuses the MAS more and more on the optimal pure strategy. This provides a simple way to map the solution of any constrained optimization problem onto the equilibrium of a Multi-Agent System (MAS). We present computer experiments involving both the Queen s problem and K-SAT validating the predictions of PD theory and its use for off-the-shelf distributed adaptive optimization.

Macready, William↗

Cauchy Drag Estimation For Low Earth Orbiters

Recent work on minimum variances estimators based on Cauchy distributions appear relevant to orbital drag estimation. Samples form Cauchy distributions which are part of a class of heavy-tailed distributions, are characterized by long stretches of fairly small variation, punctuated by large variations that are many times larger than could be expected from a Gaussian. Such behavior can occur when solar storms perturb the atmosphere. In this context, the present work describes an embedding of the scalar Idan-Speyer Cauchy Estimator to estimate density corrections, within an Extended Kalman Filter that estimates the state of a low Earth orbiter. In contrast to the baseline Kalman approach, the larger formal errors of the present approach fully and conservatively bound the predictive error distribution, even in the face of unanticipated density disturbances of hundreds of percent.

Low Earth↗

Extraction-Separation Performance and Dynamic Modeling of Orion Test Vehicles with Adams Simulation: 2nd Edition

NASA's Orion Capsule Parachute Assembly System (CPAS) project has advanced into the third generation of its parachute test campaign and requires technically comprehensive modeling capabilities to simulate multi-body dynamics (MBD) of test articles released from a C-17. Safely extracting a 30,000 lbm mated test article from a C-17 and performing stable mid-air separation maneuvers requires an understanding of the interaction between elements in the test configuration and how they are influenced by extraction parachute performance, aircraft dynamics, aerodynamics, separation dynamics, and kinetic energy experienced by the system. During the real-time extraction and deployment sequences, these influences can be highly unsteady and difficult to bound. An avionics logic window based on time, pitch, and pitch rate is used to account for these effects and target a favorable separation state in real time. The Adams simulation has been employed to fine-tune this window, as well as predict and reconstruct the coupled dynamics of the Parachute Test Vehicle (PTV) and Cradle Platform Separation System (CPSS) from aircraft extraction through the mid-air separation event. The test-technique for the extraction of CPAS test articles has evolved with increased complexity and requires new modeling concepts to ensure the test article is delivered to a stable test condition for the programmer phase. Prompted by unexpected dynamics and hardware malfunctions in drop tests, these modeling improvements provide a more accurate loads prediction by incorporating a spring-damper line-model derived from the material properties. The qualification phase of CPAS testing is on the horizon and modeling increasingly complex test-techniques with Adams is vital to successfully qualify the Orion parachute system for human spaceflight.

Fraire, Usbaldo, Jr.↗

A Time-Regularized Multiple Gravity-Assist Low-Thrust Bounded-Impulse Model for Trajectory Optimization

The multiple gravity assist low-thrust (MGALT) trajectory model combines the medium-fidelity Sims-Flanagan bounded-impulse transcription with a patched-conics flyby model and is an important tool for preliminary trajectory design. While this model features fast state propagation via Kepler's equation and provides a pleasingly accurate estimation of the total mass budget for the eventual flight-suitable integrated trajectory it does suffer from one major drawback, namely its temporal spacing of the control nodes. We introduce a variant of the MGALT transcription that utilizes the generalized anomaly from the universal formulation of Kepler's equation as a decision variable in addition to the trajectory phase propagation time. This results in two improvements over the traditional model. The first is that the maneuver locations are equally spaced in generalized anomaly about the orbit rather than time. The second is that the Kepler propagator now has the generalized anomaly as its independent variable instead of time and thus becomes an iteration-free propagation method. The new algorithm is outlined, including the impact that this has on the computation of Jacobian entries for numerical optimization, and a motivating application problem is presented that illustrates the improvements that this model has over the traditional MGALT transcription.

Optimization↗

A Time-Regularized, Multiple Gravity-Assist Low-Thrust, Bounded-Impulse Model for Trajectory Optimization

The multiple gravity assist low-thrust (MGALT) trajectory model combines the medium-fidelity Sims-Flanagan bounded-impulse transcription with a patched-conics flyby model and is an important tool for preliminary trajectory design. While this model features fast state propagation via Keplers equation and provides a pleasingly accurate estimation of the total mass budget for the eventual flight suitable integrated trajectory it does suffer from one major drawback, namely its temporal spacing of the control nodes. We introduce a variant of the MGALT transcription that utilizes the generalized anomaly from the universal formulation of Keplers equation as a decision variable in addition to the trajectory phase propagation time. This results in two improvements over the traditional model. The first is that the maneuver locations are equally spaced in generalized anomaly about the orbit rather than time. The second is that the Kepler propagator now has the generalized anomaly as its independent variable instead of time and thus becomes an iteration-free propagation method. The new algorithm is outlined, including the impact that this has on the computation of Jacobian entries for numerical optimization, and a motivating application problem is presented that illustrates the improvements that this model has over the traditional MGALT transcription.

Optimization↗

Runway Configuration Management with Offline Reinforcement Learning

Runway configuration management (RCM) is a challenging task, and it affects the efficiency of the National Airspace System (NAS) and airport surface operations significantly. Each airport, depending on the geometry, capacity, local climate patterns, etc. has multiple configurations for the runway usage for arriving and departing flights. Many factors such as the incoming/outgoing traffic load, wind direction and speed, convective weather, cloud ceiling and other environmental factors might affect the choice of a runway configuration at any point in time. However, other factors such as safety measures and regulations, noise abatement, capacity of each configuration, and preference of the air traffic controllers (ATCs) can also play a significant role in selecting the configuration. A sub-optimal selection of the runway configuration, or delay in making configuration changes might result in significant increase in taxi times for aircraft on the surface of the airport, fuel and energy use of the aircraft, and maintenance costs. It can also lead to safety concerns, such as an aircraft performing one or more go-arounds before being able to land. All these factors make RCM an extremely important and challenging decision-making process for the ATCs. The current state of practice sets the runway configuration by the ATCs based on relevant information available at the time including weather, traffic, noise abatement, safety bounds, etc. This makes the decision-making process subjective based on the accuracy of the available information and the bias in human decision making. Unfortunately, this approach yields poor results (e.g., significant delays) if the predicted outcomes are uncertain and their relative impact is not well understood. This is especially evident when the uncertainty increases the size of possible predicted outcomes (combinatorial explosion in possible scenarios) that cannot be handled by human reasoning. On the other hand, an automated approach based on machine intelligence can make use of historical data and search through all (or significant amount of) possible scenarios under uncertainty and make well-informed decisions.

Milad Memarzadeh↗

Entropy and chemical change. 1: Characterization of product (and reactant) energy distributions in reactive molecular collisions: Information and enthropy deficiency

Optimal means of characterizing the distribution of product energy states resulting from reactive collisions of molecules with restricted distributions of initial states are considered, along with those for characterizing the particular reactant state distribution which yields a given set of product states at a specified total energy. It is suggested to represent the energy-dependence of global-type results in the form of square-faced bar plots, and of data for specific-type experiments as triangular-faced prismatic plots. The essential parameters defining the internal state distribution are isolated, and the information content of such a distribution is put on a quantitative basis. The relationship between the information content, the surprisal, and the entropy of the continuous distribution is established. The concept of an entropy deficiency, which characterizes the specificity of product state formation, is suggested as a useful measure of the deviance from statistical behavior. The degradation of information by experimental averaging is considered, leading to bounds on the entropy deficiency.

Bernstein, R. B.↗

Vibrational relaxation and dissociation in nitrogen

Calculations of the vibrational and dissociation transition probabilities are made for N2-N2 and N2-N collisions by means of a semiclassical N-state approximation. The flaws in previous techniques are reviewed, with special attention given to the prediction of overtones. The method presented ignores the effects of molecular rotation and employs a revised extended Rydberg intermolecular potential to describe diatom-diatom and diatom-atom collisions. The collision velocities investigated exhibit probabilities of less than unity by means of the N-state method. The continuum is quantized to treat dissociation, and the collision results demonstrate probability enhancements for V-V-T transitions in both bound-bound and bound-free transitions. The technique is of particular interest for the theoretical modeling of reentry flows such as those encountered in aerobraking maneuvers.

Varghese, Philip L.↗

Landsat-4 (TDRSS-user) orbit determination using batch least-squares and sequential methods

TDRSS user orbit determination is analyzed using a batch least-squares method and a sequential estimation method. It was found that in the batch least-squares method analysis, the orbit determination consistency for Landsat-4, which was heavily tracked by TDRSS during January 1991, was about 4 meters in the rms overlap comparisons and about 6 meters in the maximum position differences in overlap comparisons. The consistency was about 10 to 30 meters in the 3 sigma state error covariance function in the sequential method analysis. As a measure of consistency, the first residual of each pass was within the 3 sigma bound in the residual space.

Oza, D. H.↗

Adaptive, Distributed Control of Constrained Multi-Agent Systems

Product Distribution (PO) theory was recently developed as a broad framework for analyzing and optimizing distributed systems. Here we demonstrate its use for adaptive distributed control of Multi-Agent Systems (MASS), i.e., for distributed stochastic optimization using MAS s. First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (Probability dist&&on on the joint state of the agents. When the game in question is a team game with constraints, that equilibrium optimizes the expected value of the team game utility, subject to those constraints. One common way to find that equilibrium is to have each agent run a Reinforcement Learning (E) algorithm. PD theory reveals this to be a particular type of search algorithm for minimizing the Lagrangian. Typically that algorithm i s quite inefficient. A more principled alternative is to use a variant of Newton's method to minimize the Lagrangian. Here we compare this alternative to RL-based search in three sets of computer experiments. These are the N Queen s problem and bin-packing problem from the optimization literature, and the Bar problem from the distributed RL literature. Our results confirm that the PD-theory-based approach outperforms the RL-based scheme in all three domains.

Bieniawski, Stefan↗

Refinement of Timoshenko Beam Theory for Composite and Sandwich Beams Using Zigzag Kinematics

A new refined theory for laminated-composite and sandwich beams that contains the kinematics of the Timoshenko Beam Theory as a proper baseline subset is presented. This variationally consistent theory is derived from the virtual work principle and employs a novel piecewise linear zigzag function that provides a more realistic representation of the deformation states of transverse shear flexible beams than other similar theories. This new zigzag function is unique in that it vanishes at the top and bottom bounding surfaces of a beam. The formulation does not enforce continuity of the transverse shear stress across the beam s cross-section, yet is robust. Two major shortcomings that are inherent in the previous zigzag theories, shear-force inconsistency and difficulties in simulating clamped boundary conditions, and that have greatly limited the utility of these previous theories are discussed in detail. An approach that has successfully resolved these shortcomings is presented herein. This new theory can be readily extended to plate and shell structures, and should be useful for obtaining accurate estimates of structural response of laminated composites.

Tessler, Alexander↗