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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Multifidelity Optimization with Transonic Flutter Constraints

This work considers static and dynamic aeroelastic optimization of a cantilevered platewing in transonic flow. Low- and high-fidelity aeroelastic predictions are fed into a standard trust region model management scheme in order to efficiently solve this expensive optimization problem with multifidelity methods. Differences in fidelity are entirely driven by different aerodynamic solvers: linear panel methods for the low-fidelity method, and inviscid CFD-based solvers for the high-fidelity response. The optimization problem utilizes shape, sizing, and trim variables to satisfy stress, trim, and flutter constraints, and is solved across a range of subsonic and transonic Mach numbers. The multifidelity method is able to provide a speed-up for all cases considered here, despite sizable inaccuracies in the low-fidelity response for transonic flows.

Bret K Stanford↗
NASA NTRS1991

Limits on the isolation of stochastic vibration for microgravity space experiments

The limitations on the isolation of stochastic vibrations for microgravity space experiments are explored. These limitations result from the restricted interior space available for vibration isolation. A one-degree-of-freedom representation of the experiment-spacecraft system is used, and an ideal vibration actuator is assumed. A kinematic representation results, and the problem becomes one of finding the minimum acceleration trajectory within a pair of stochastic walls. The wall motion is characterized by an ergodic, stationary, zero-mean, Gaussian random process with known power spectral density. The geometry of the wall trajectories is defined in terms of their significant extrema and zero crossings. This geomemtry is used in defining a composite trajectory that has a mean square acceleratiaon lower than that on the optimal path satisfying the stochastic wall inequality constraints. The optimal control problem is solved on a return path yielding the mean square acceleration in terms of the distributions of significant maxima and first-passage time of the wall process. The methodology is applied to a microgravity isolation problem to find the lower bounds on root-mean-square acceleration given the disturbance power spectral density.

Knospe, C. R.↗
NASA NTRS1986

Generalized INF-SUP condition for Chebyshev approximation of the Navier-Stokes equations

An abstract mixed problem and its approximation are studied; both are well-posed if and only if several inf-sup conditions are satisfied. These results are applied to a spectral Galerkin method for the Stokes problem in a square, when it is formulated in Chebyshev weighted Sobolev spaces. Finally, a collocation method for the Navier-Stokes equations at Chebyshev nodes is analyzed.

Bernardi, Christine↗
NASA NTRSDate not supplied

Seeing is Believing: Monitoring Future Time Temporal Logic

Runtime monitors for future-time unbounded temporal logics like RVLTL, LTL 3 and FLTL, have double-exponential (2^2^n) worst-case space complexity bounds in size of the input formula. The semantics of these logics require monitors to perform general satisfiability solving for LTL expressions, a well-studied problem whose computational complexity is NP-hard and PSPACE-complete. This paper introduces an unbounded future-time linear temporal logic defined over a lattice. We call our logic an incremental temporal logic as it can be viewed as incrementally constructing proofs about the trace. On this account, we view online runtime monitoring as a decision procedure for proofs systems about incrementally growing traces. We demonstrate that our incremental temporal logic allows monitor construction to void satisfiability solving while still soundly detecting when the property is violated in an online fashion. This enables asymptotic improvements in space complexity. As proof, we provide a procedure to construct monitors that utilize linear space and time in the size of the input formula, while remaining constant in the size of the input stream and suitable for online monitoring. We further demonstrate, through several examples, that our incremental temporal logic is straightforward to adopt and practical for runtime verification.

temporal logic↗
NASA NTRS1973

A mesh gradient technique for numerical optimization

A class of successive-improvement optimization methods in which directions of descent are defined in the state space along each trial trajectory are considered. The given problem is first decomposed into two discrete levels by imposing mesh points. Level 1 consists of running optimal subarcs between each successive pair of mesh points. For normal systems, these optimal two-point boundary value problems can be solved by following a routine prescription if the mesh spacing is sufficiently close. A spacing criterion is given. Under appropriate conditions, the criterion value depends only on the coordinates of the mesh points, and its gradient with respect to those coordinates may be defined by interpreting the adjoint variables as partial derivatives of the criterion value function. In level 2, the gradient data is used to generate improvement steps or search directions in the state space which satisfy the boundary values and constraints of the given problem.

Willis, E. A., Jr.↗
NASA NTRS1984

Large-angle maneuvers of flexible spacecraft using a closed form solution for the terminal tracking problem

The problem of maneuvering a flexible spacecraft through a large-angle while requiring a sub-vector of the terminal state to exactly satisfy a set of terminal constraints is considered. The necessary conditions for this problem lead to three coupled nonlinear Riccati-like differential equations, which are solved in closed form. Example maneuvers are presented where control-rate penalties have been included in the performance index, in order to smooth the closed-loop control commands. Furthermore, example maneuvers are presented for both fixed and free and condition problem.

Juan, J.-N.↗
NASA NTRS1995

Existence of frozen-in coordinate systems

The 'frozen-in' coordinate systems were first introduced in the works on 'reconnection' and 'magnetic barrier' theories (see review by M.l.Pudovkin and V.S.Semenov, Space Sci. Rev. 41,1 1985). The idea was to utilize the mathematical apparatus developed for 'general relativity' theory to simplify obtaining solutions to the ideal MHD equations set. Magnetic field (B), plasma velocity (v), and their vector product were used as coordinate vectors. But there exist no stationary solutions of ideal MHD set that satisfies the required boundary conditions at infinity (A.D.Chertkov, Solar Wind Seven Conf.,Pergamon Press,1992,165) having non-zero vector product of v and B where v and B originate from the same sphere. The existence of a solution is the hidden mine of the mentioned theories. The solution is constructed in the coordinate system, which is unknown and indeterminate before obtaining this solution. A substitution of the final solution must be done directly into the initial MHD set in order to check the method. One can demonstrate that 'solutions' of Petschek's problem, obtained by 'frozen-in' coordinate systems, does not satisfy just the 'frozen-in' equation, i.e. induction equation. It stems from the fact that Petschek's 're-connection' model, treated as a boundary problem, is over determined. This problem was incorrectly formulated.

Chertkov, A. D.↗
NASA NTRS1992

Fuzzy sets, rough sets, and modeling evidence: Theory and Application. A Dempster-Shafer based approach to compromise decision making with multiattributes applied to product selection

The Dempster-Shafer theory of evidence is applied to a multiattribute decision making problem whereby the decision maker (DM) must compromise with available alternatives, none of which exactly satisfies his ideal. The decision mechanism is constrained by the uncertainty inherent in the determination of the relative importance of each attribute element and the classification of existing alternatives. The classification of alternatives is addressed through expert evaluation of the degree to which each element is contained in each available alternative. The relative importance of each attribute element is determined through pairwise comparisons of the elements by the decision maker and implementation of a ratio scale quantification method. Then the 'belief' and 'plausibility' that an alternative will satisfy the decision maker's ideal are calculated and combined to rank order the available alternatives. Application to the problem of selecting computer software is given.

Dekorvin, Andre↗
NASA NTRS2015

Global Optimization of Interplanetary Trajectories in the Presence of Realistic Mission Contraints

Interplanetary missions are often subject to difficult constraints, like solar phase angle upon arrival at the destination, velocity at arrival, and altitudes for flybys. Preliminary design of such missions is often conducted by solving the unconstrained problem and then filtering away solutions which do not naturally satisfy the constraints. However this can bias the search into non-advantageous regions of the solution space, so it can be better to conduct preliminary design with the full set of constraints imposed. In this work two stochastic global search methods are developed which are well suited to the constrained global interplanetary trajectory optimization problem.

Design↗
NASA NTRS1992

Distance estimation and collision prediction for on-line robotic motion planning

An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem is incorporated into the framework of an in-line motion-planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning, the deterministic problem where the information about the objects is assumed to be certain is examined. L(1) or L(infinity) norms are used to represent distance and the problem becomes a linear programming problem. The stochastic problem is formulated where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: First, filtering of the distance between the robot and the moving object at the present time. Second, prediction of the minimum distance in the future in order to predict the collision time.

Kyriakopoulos, K. J.↗
NASA NTRS1991

Distance estimation and collision prediction for on-line robotic motion planning

An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem has been incorporated in the framework of an in-line motion planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning the deterministic problem, where the information about the objects is assumed to be certain is examined. If instead of the Euclidean norm, L(sub 1) or L(sub infinity) norms are used to represent distance, the problem becomes a linear programming problem. The stochastic problem is formulated, where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: (1) filtering of the minimum distance between the robot and the moving object, at the present time; and (2) prediction of the minimum distance in the future, in order to predict possible collisions with the moving obstacles and estimate the collision time.

Kyriakopoulos, K. J.↗
NASA NTRS2007

Deep Space Network Scheduling Using Evolutionary Computational Methods

The paper presents the specific approach taken to formulate the problem in terms of gene encoding, fitness function, and genetic operations. The genome is encoded such that a subset of the scheduling constraints is automatically satisfied. Several fitness functions are formulated to emphasize different aspects of the scheduling problem. The optimal solutions of the different fitness functions demonstrate the trade-off of the scheduling problem and provide insight into a conflict resolution process.

Deep Space Network (DSN)↗
NASA NTRS1974

Electromagnetic and scalar diffraction by a right-angled wedge with a uniform surface impedance

The diffraction of an electromagnetic wave by a perfectly-conducting right-angled wedge with one surface covered by a dielectric slab or absorber is considered. The effect of the coated surface is approximated by a uniform surface impedance. The solution of the normally incident electromagnetic problem is facilitated by introducing two scalar fields which satisfy a mixed boundary condition on one surface of the wedge and a Neumann of Dirichlet boundary condition on the other. A functional transformation is employed to simplify the boundary conditions so that eigenfunction expansions can be obtained for the resulting Green's functions. The eigenfunction expansions are transformed into the integral representations which then are evaluated asymptotically by the modified Pauli-Clemmow method of steepest descent. A far zone approximation is made to obtain the scattered field from which the diffraction coefficient is found for scalar plane, cylindrical or sperical wave incident on the edge. With the introduction of a ray-fixed coordinate system, the dyadic diffraction coefficient for plane or cylindrical EM waves normally indicent on the edge is reduced to the sum of two dyads which can be written alternatively as a 2 X 2 diagonal matrix.

Hwang, Y. M.↗
NASA NTRS1992

Quantum spatial propagation of squeezed light in a degenerate parametric amplifier

Differential equations which describe the steady state spatial evolution of nonclassical light are established using standard quantum field theoretic techniques. A Schroedinger equation for the state vector of the optical field is derived using the quantum analog of the slowly varying envelope approximation (SVEA). The steady state solutions are those that satisfy the time independent Schroedinger equation. The resulting eigenvalue problem then leads to the spatial propagation equations. For the degenerate parametric amplifier this method shows that the squeezing parameter obey nonlinear differential equations coupled by the amplifier gain and phase mismatch. The solution to these differential equations is equivalent to one obtained from the classical three wave mixing steady state solution to the parametric amplifier with a nondepleted pump.

Deutsch, Ivan H.↗
NASA NTRS1995

Technology Transfer: Marketing Tomorrow's Technology

The globalization of the economy and the end of the Cold War have triggered many changes in the traditional practices of U.S. industry. To effectively apply the resources available to the United States, the federal government has firmly advocated a policy of technology transfer between private industry and government labs, in this case the National Aeronautics and Space Administration (NASA). NASA Administrator Daniel Goldin is a strong proponent of this policy and has organized technology transfer or commercialization programs at each of the NASA field centers. Here at Langley Research Center, the Technology Applications Group (TAG) is responsible for facilitating the transfer of Langley developed research and technology to U.S. industry. Entering the program, I had many objectives for my summer research with TAG. Certainly, I wanted to gain a more thorough understanding of the concept of technology transfer and Langley's implementation of a system to promote it to both the Langley community and the community at large. Also, I hoped to become more familiar with Langley's research capabilities and technology inventory available to the public. More specifically, I wanted to learn about the technology transfer process at Langley. Because my mentor is a member of Materials and Manufacturing marketing sector of the Technology Transfer Team, another overriding objective for my research was to take advantage of his work and experience in materials research to learn about the Advanced Materials Research agency wide and help market these developments to private industry. Through the various projects I have been assigned to work on in TAG, I have successfully satisfied the majority of these objectives. Work on the Problem Statement Process for TAG as well as the development of the Advanced Materials Research Brochure have provided me with the opportunity to learn about the technology transfer process from the outside looking in and the inside looking out. Because TAG covers all of the research efforts conducted at Langley, my studies with TAG were ab!e to provide me an excellent overview of Langley's contribution to the aeronautics industry.

Tcheng, Erene↗
NASA NTRS1997

Dynamic Forms: Application to Aircraft Guidance - Part 2

The paper describes a method for guiding a dynamic system through a given set of points. The paradigm is a fully automatic aircraft subject to air traffic control (ATC). The ATC provides a sequence of waypoints through which the aircraft trajectory must pass. The waypoints typically specify time, position, and velocity. The guidance problem is to synthesize a system state trajectory that satisfies both the ATC and aircraft constraints. Complications arise because the controlled process is multidimensional, multiaxis, nonlinear, highly coupled, and the state space is not flat. In addition, there is a multitude of operating modes, which may number in the hundreds. Each such mode defines a distinct state space model of the process by specifying the state space coordinatization, the partition of the controls into active controls and configuration controls, and the output map. Furthermore, mode transitions are required to be smooth. The proposed guidance algorithm is based on the inversion of the pure feedback approximation, followed by correction for the effects of zero dynamics. The paper describes the structure and major modules of the algorithm, and the performance is illustrated by several example aircraft maneuvers.

Meyer, George↗
NASA NTRS1996

An Open Computing Infrastructure that Facilitates Integrated Product and Process Development from a Decision-Based Perspective

Computer applications for design have evolved rapidly over the past several decades, and significant payoffs are being achieved by organizations through reductions in design cycle times. These applications are overwhelmed by the requirements imposed during complex, open engineering systems design. Organizations are faced with a number of different methodologies, numerous legacy disciplinary tools, and a very large amount of data. Yet they are also faced with few interdisciplinary tools for design collaboration or methods for achieving the revolutionary product designs required to maintain a competitive advantage in the future. These organizations are looking for a software infrastructure that integrates current corporate design practices with newer simulation and solution techniques. Such an infrastructure must be robust to changes in both corporate needs and enabling technologies. In addition, this infrastructure must be user-friendly, modular and scalable. This need is the motivation for the research described in this dissertation. The research is focused on the development of an open computing infrastructure that facilitates product and process design. In addition, this research explicitly deals with human interactions during design through a model that focuses on the role of a designer as that of decision-maker. The research perspective here is taken from that of design as a discipline with a focus on Decision-Based Design, Theory of Languages, Information Science, and Integration Technology. Given this background, a Model of IPPD is developed and implemented along the lines of a traditional experimental procedure: with the steps of establishing context, formalizing a theory, building an apparatus, conducting an experiment, reviewing results, and providing recommendations. Based on this Model, Design Processes and Specification can be explored in a structured and implementable architecture. An architecture for exploring design called DREAMS (Developing Robust Engineering Analysis Models and Specifications) has been developed which supports the activities of both meta-design and actual design execution. This is accomplished through a systematic process which is comprised of the stages of Formulation, Translation, and Evaluation. During this process, elements from a Design Specification are integrated into Design Processes. In addition, a software infrastructure was developed and is called IMAGE (Intelligent Multidisciplinary Aircraft Generation Environment). This represents a virtual apparatus in the Design Experiment conducted in this research. IMAGE is an innovative architecture because it explicitly supports design-related activities. This is accomplished through a GUI driven and Agent-based implementation of DREAMS. A HSCT design has been adopted from the Framework for Interdisciplinary Design Optimization (FIDO) and is implemented in IMAGE. This problem shows how Design Processes and Specification interact in a design system. In addition, the problem utilizes two different solution models concurrently: optimal and satisfying. The satisfying model allows for more design flexibility and allows a designer to maintain design freedom. As a result of following this experimental procedure, this infrastructure is an open system that it is robust to changes in both corporate needs and computer technologies. The development of this infrastructure leads to a number of significant intellectual contributions: 1) A new approach to implementing IPPD with the aid of a computer; 2) A formal Design Experiment; 3) A combined Process and Specification architecture that is language-based; 4) An infrastructure for exploring design; 5) An integration strategy for implementing computer resources; and 6) A seamless modeling language. The need for these contributions is emphasized by the demand by industry and government agencies for the development of these technologies.

Hale, Mark A.↗
NASA NTRS1996

Guidance of Nonlinear Systems

The paper describes a method for guiding a dynamic system through a given set of points. The paradigm is a fully automatic aircraft subject to air traffic control (ATC). The ATC provides a sequence of way points through which the aircraft trajectory must pass. The way points typically specify time, position, and velocity. The guidance problem is to synthesize a system state trajectory which satisfies both the ATC and aircraft constraints. Complications arise because the controlled process is multi-dimensional, multi-axis, nonlinear, highly coupled, and the state space is not flat. In addition, there is a multitude of possible operating modes, which may number in the hundreds. Each such mode defines a distinct state space model of the process by specifying the state space coordination, the partition of the controls into active controls and configuration controls, and the output map. Furthermore, mode transitions must be smooth. The guidance algorithm is based on the inversion of the pure feedback approximations, which is followed by iterative corrections for the effects of zero dynamics. The paper describes the structure and modules of the algorithm, and the performance is illustrated by several example aircraft maneuvers.

Meyer, George↗