Search NASA⌕ Search

SEARCH · Search NASA

Results for “inequality”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

On the stability, storage capacity, and design of nonlinear continuous neural networks

The stability, capacity, and design of a nonlinear continuous neural network are analyzed. Sufficient conditions for existence and asymptotic stability of the network's equilibria are reduced to a set of piecewise-linear inequality relations that can be solved by a feedforward binary network, or by methods such as Fourier elimination. The stability and capacity of the network is characterized by the post synaptic firing rate function. An N-neuron network with sigmoidal firing function is shown to have up to 3N equilibrium points. This offers a higher capacity than the (0.1-0.2)N obtained in the binary Hopfield network. Moreover, it is shown that by a proper selection of the postsynaptic firing rate function, one can significantly extend the capacity storage of the network.

Guez, Allon↗
NASA NTRS1988

Comparing hard and soft prior bounds in geophysical inverse problems

In linear inversion of a finite-dimensional data vector y to estimate a finite-dimensional prediction vector z, prior information about X sub E is essential if y is to supply useful limits for z. The one exception occurs when all the prediction functionals are linear combinations of the data functionals. Two forms of prior information are compared: a soft bound on X sub E is a probability distribution p sub x on X which describes the observer's opinion about where X sub E is likely to be in X; a hard bound on X sub E is an inequality Q sub x(X sub E, X sub E) is equal to or less than 1, where Q sub x is a positive definite quadratic form on X. A hard bound Q sub x can be softened to many different probability distributions p sub x, but all these p sub x's carry much new information about X sub E which is absent from Q sub x, and some information which contradicts Q sub x. Both stochastic inversion (SI) and Bayesian inference (BI) estimate z from y and a soft prior bound p sub x. If that probability distribution was obtained by softening a hard prior bound Q sub x, rather than by objective statistical inference independent of y, then p sub x contains so much unsupported new information absent from Q sub x that conclusions about z obtained with SI or BI would seen to be suspect.

Backus, George E.↗
NASA NTRS1988

Performance limits for optimal microburst encounter

An effort has been made to ascertain the envelope-edges for uneventful aircraft penetrations of microburst windshears on the basis of optimal aircraft control strategies. Over 1100 such trajectories have been computed for contemporary airliners and general aviation aircraft, in the case of idealized microbursts, using a successive quadratic program trajectory optimization algorithm able to directly handle inequality constraints. Variations of optimal performance with microburst type, intensity, length scale, and location, define performance limits; these limits fall into short, intermediate, and long microburst length scale regimes. The ability to safely transit a microburst also varies strongly with microburst location.

Psiaki, Mark L.↗
NASA NTRS1988

Symbolic inversion of control relationships in model-based expert systems

Symbolic inversion is examined from several perspectives. First, a number of symbolic algebra and mathematical tool packages were studied in order to evaluate their capabilities and methods, specifically with respect to symbolic inversion. Second, the KATE system (without hardware interface) was ported to a Zenith Z-248 microcomputer running Golden Common Lisp. The interesting thing about the port is that it allows the user to have measurements vary and components fail in a non-deterministic manner based upon random value from probability distributions. Third, INVERT was studied as currently implemented in KATE, its operation documented, some of its weaknesses identified, and corrections made to it. The corrections and enhancements are primarily in the way that logical conditions involving AND's and OR's and inequalities are processed. In addition, the capability to handle equalities was also added. Suggestions were also made regarding the handling of ranges in INVERT. Last, other approaches to the inversion process were studied and recommendations were made as to how future versions of KATE should perform symbolic inversion.

Thomas, Stan↗
NASA NTRS1989

Performance optimization for rotors in hover and axial flight

Performance optimization for rotors in hover and axial flight is a topic of continuing importance to rotorcraft designers. The aim of this Phase 1 effort has been to demonstrate that a linear optimization algorithm could be coupled to an existing influence coefficient hover performance code. This code, dubbed EHPIC (Evaluation of Hover Performance using Influence Coefficients), uses a quasi-linear wake relaxation to solve for the rotor performance. The coupling was accomplished by expanding of the matrix of linearized influence coefficients in EHPIC to accommodate design variables and deriving new coefficients for linearized equations governing perturbations in power and thrust. These coefficients formed the input to a linear optimization analysis, which used the flow tangency conditions on the blade and in the wake to impose equality constraints on the expanded system of equations; user-specified inequality contraints were also employed to bound the changes in the design. It was found that this locally linearized analysis could be invoked to predict a design change that would produce a reduction in the power required by the rotor at constant thrust. Thus, an efficient search for improved versions of the baseline design can be carried out while retaining the accuracy inherent in a free wake/lifting surface performance analysis.

Quackenbush, T. R.↗
NASA NTRS1989

Flutter suppression using eigenspace freedoms to meet requirements

A constrained optimization methodology has been developed which allows specific use of eigensystem freedoms to meet design requirements. A subset of the available eigenvector freedoms was employed. The eigenvector freedoms associated with a particular closed-loop eigenvalue are coefficients of basis vectors which span the subspace in which that closed-loop vector must lie. Design requirements are included as a vector of inequality constraints. The procedure was successfully applied to develop an unscheduled controller which stabilizes symmetric flutter of an aeroelastic vehicle to a dynamic pressure 44 percent above the open-loop flutter point. The design process proceeded from full-state feedback to the inclusion of a full-order observer to the selection of an eighth-order controller which preserved the full-state sensitivity characteristics. Only a subset of the design freedoms was utilized (i.e., assuming full-state feedback only four out of 26 eigenvectors were used, and no variations were made in the closed-loop eigenvalues). Utilization of additional eigensystem freedoms could further improve the controller.

Adams, William M., Jr.↗
NASA NTRS1989

Multiplier-continuation algorthms for constrained optimization

Several path following algorithms based on the combination of three smooth penalty functions, the quadratic penalty for equality constraints and the quadratic loss and log barrier for inequality constraints, their modern counterparts, augmented Lagrangian or multiplier methods, sequential quadratic programming, and predictor-corrector continuation are described. In the first phase of this methodology, one minimizes the unconstrained or linearly constrained penalty function or augmented Lagrangian. A homotopy path generated from the functions is then followed to optimality using efficient predictor-corrector continuation methods. The continuation steps are asymptotic to those taken by sequential quadratic programming which can be used in the final steps. Numerical test results show the method to be efficient, robust, and a competitive alternative to sequential quadratic programming.

Lundberg, Bruce N.↗
NASA NTRS1988

Effect of model uncertainty on failure detection - The threshold selector

The performance of all failure detection, isolation, and accomodation (DIA) algorithms is influenced by the presence of model uncertainty. A unique framework is presented to incorporate a knowledge of modeling error in the analysis and design of failure detection systems. The tools being used are very similar to those in robust control theory. A concept is introduced called the threshold selector, which is a nonlinear inequality whose solution defines the set of detectable sensor failure signals. The threshold selector represents an innovative tool for analysis and synthesis of DIA algorithms. It identifies the optimal threshold to be used in innovations-based DIA algorithms. The optimal threshold is shown to be a function of the bound on modeling errors, the noise properties, the speed of DIA filters, and the classes of reference and failure signals. The size of the smallest detectable failure is also determined. The results are applied to a multivariable turbofan jet engine example, which demonstrates improvements compared to previous studies.

Emami-Naeini, Abbas↗
NASA NTRS1989

A predictive guidance algorithm for Mars entry

This report presents the derivation, logic, and performance of a Mars entry guidance algorithm for the Mars Rover Sample Return Mission. This algorithm guides the Mars entry vehicle along an equilibrium glide trajectory designed to satisfy a set of equality and inequality constraints at chute deploy. An equilibrium glide assumption permits analytic prediction of terminal state conditions and eliminates the need for determining numeric state sensitivities. Trajectory deviations due to dispersions or uncertainties in Martian atmosphere, vehicle aerodynamics, or entry interface conditions are accommodated simply by predicting the compensating equilibrium glide profile and achieving this profile with the available lift control. This Mars Predictive Equilibrium Glide guidance scheme was tested on a range of vehicle configurations with a variety of aerodynamic, atmosphere, and trajectory dispersions with a high degree of success.

Tigges, M. A.↗
NASA NTRS1988

A method for designing robust multivariable feedback systems

A new methodology is developed for the synthesis of linear, time-invariant (LTI) controllers for multivariable LTI systems. The aim is to achieve stability and performance robustness of the feedback system in the presence of multiple unstructured uncertainty blocks; i.e., to satisfy a frequency-domain inequality in terms of the structured singular value. The design technique is referred to as the causality recovery methodology (CRM). Starting with an initial (nominally) stabilizing compensator, the CRM produces a closed-loop system whose performance-robustness is at least as good as, and hopefully superior to, that of the original design. The robustness improvement is obtained by solving an infinite-dimensional, convex optimization program. A finite-dimensional implementation of the CRM was developed, and it was applied to a multivariate design example.

Milich, David A.↗
NASA NTRS1989

Abort landing guidance trajectories in the presence of windshear

The flight trajectory of abort landing in the presence of windshear is examined with reference to flight in a vertical plane. It is assumed that the only control is the angle of attack. Inequality constraints are imposed on both the angle of attack and its time derivative. Numerical results are obtained for several combinations of windshear intensities and initial altitudes. Guidance trajectories are considered, approximating the optimal trajectories and using local information on the state of the aircraft, the initial altitude, and the total wind velocity difference. Results are presented for optimal trajectories, guidance trajectories, simplified guidance trajectories, constant pitch trajectories, and maximum angle of attack trajectories.

Miele, A.↗
NASA NTRS1989

The stability analysis of magnetohydrodynamic equilibria - Comparing the thermodynamic approach with the energy principle

This paper is a contribution to the stability analysis of current-carrying plasmas, i.e., plasma systems that are forced by external mchanisms to carry a nonrelaxing electrical current. Under restriction to translationally invariant configurations, the thermodynamic stability criterion for a multicomponent plasma is rederived within the framework of nonideal MHD. The chosen dynamics neglects scalar resistivity, but allows for other types of dissipation effects both in Ohm's law and in the equation of motion. In the second section of the paper, the thermodynamic stability criterion is compared with the ideal MHD based energy principle of Bernstein et al. With the help of Schwarz's inequality, it is shown that the former criterion is always more 'pessimistic' than the latter, i.e., that thermodynamic stability implies stability according to the MHD principle, but not vice versa. This reuslt confirms the physical plausible idea that dissipational effects tend to weaken the stability properties of current-carrying plasma equilibria by breaking the constraints of ideal MHD and allowing for possibly destabilizing effects such as magnetic field line reconfiguration.

Brinkmann, R. P.↗
NASA NTRS1990

Singular perturbation analysis of AOTV-related trajectory optimization problems

The problem of real time guidance and optimal control of Aeroassisted Orbit Transfer Vehicles (AOTV's) was addressed using singular perturbation theory as an underlying method of analysis. Trajectories were optimized with the objective of minimum energy expenditure in the atmospheric phase of the maneuver. Two major problem areas were addressed: optimal reentry, and synergetic plane change with aeroglide. For the reentry problem, several reduced order models were analyzed with the objective of optimal changes in heading with minimum energy loss. It was demonstrated that a further model order reduction to a single state model is possible through the application of singular perturbation theory. The optimal solution for the reduced problem defines an optimal altitude profile dependent on the current energy level of the vehicle. A separate boundary layer analysis is used to account for altitude and flight path angle dynamics, and to obtain lift and bank angle control solutions. By considering alternative approximations to solve the boundary layer problem, three guidance laws were derived, each having an analytic feedback form. The guidance laws were evaluated using a Maneuvering Reentry Research Vehicle model and all three laws were found to be near optimal. For the problem of synergetic plane change with aeroglide, a difficult terminal boundary layer control problem arises which to date is found to be analytically intractable. Thus a predictive/corrective solution was developed to satisfy the terminal constraints on altitude and flight path angle. A composite guidance solution was obtained by combining the optimal reentry solution with the predictive/corrective guidance method. Numerical comparisons with the corresponding optimal trajectory solutions show that the resulting performance is very close to optimal. An attempt was made to obtain numerically optimized trajectories for the case where heating rate is constrained. A first order state variable inequality constraint was imposed on the full order AOTV point mass equations of motion, using a simple aerodynamic heating rate model.

Calise, Anthony J.↗
NASA NTRS1990

A kinetic equation with kinetic entropy functions for scalar conservation laws

A nonlinear kinetic equation is constructed and proved to be well-adapted to describe general multidimensional scalar conservation laws. In particular, it is proved to be well-posed uniformly in epsilon - the microscopic scale. It is also shown that the proposed kinetic equation is equipped with a family of kinetic entropy functions - analogous to Boltzmann's microscopic H-function, such that they recover Krushkov-type entropy inequality on the macroscopic scale. Finally, it is proved by both - BV compactness arguments in the one-dimensional case, that the local density of kinetic particles admits a continuum limit, as it converges strongly with epsilon below 0 to the unique entropy solution of the corresponding conservation law.

Perthame, Benoit↗
NASA NTRS1989

Optimum control forces for multibody systems with intermittent motion

The objective is to address the continuity of motion when a dynamical system is suddenly subjected to constraint conditions. Motion discontinuity due to the initial constraint violation is avoided by prior control forces that adjust the motion and yield velocity and acceleration consistent at the point of application of the constraint. The optimum control forces are determined for a specified control interval. The method proposed provides an optimum adjustment of the system's motion and assures that the stresses developed at the system components are kept within acceptable limits. The procedures developed will be illustrated making use of inequality constraints applied to obstacle avoidance problems in robotics.

Ider, Sitki Kemal↗
NASA NTRS1989

An algorithm for the solution of dynamic linear programs

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Psiaki, Mark L.↗
NASA NTRS1990

The CFL condition for spectral approximations to hyperbolic initial-boundary value problems

The stability of spectral approximations to scalar hyperbolic initial-boundary value problems with variable coefficients are studied. Time is discretized by explicit multi-level or Runge-Kutta methods of order less than or equal to 3 (forward Euler time differencing is included), and spatial discretizations are studied by spectral and pseudospectral approximations associated with the general family of Jacobi polynomials. It is proved that these fully explicit spectral approximations are stable provided their time-step, delta t, is restricted by the CFL-like condition, delta t less than Const. N(exp-2), where N equals the spatial number of degrees of freedom. We give two independent proofs of this result, depending on two different choices of approximate L(exp 2)-weighted norms. In both approaches, the proofs hinge on a certain inverse inequality interesting for its own sake. The result confirms the commonly held belief that the above CFL stability restriction, which is extensively used in practical implementations, guarantees the stability (and hence the convergence) of fully-explicit spectral approximations in the nonperiodic case.

Gottlieb, David↗
NASA NTRS1989

Obstacle avoidance for redundant robots using configuration control

The article presents a new and simple solution to the obstacle avoidance problem for redundant robots. In the proposed approach, called configuraiton control, the redundancy is utilized to configure the robot so as to satisfy a set of kinematic inequality constraints representing obstacle avoidance, while the end-effector is tracking a desired trajectory. The robot control scheme is very simple, and uses on-line adaptation to eliminate the need for the complex dynamic model and parameter values of the robot. Several simulation results for a four-link planar robot are presented to illustrate the versatility of the approach. These include reaching around a stationary obstacle, simultaneous avoidance of two obstacles, robot reconfiguration to avoid a moving obstacle, and avoidance of rectangular obstacles.

Colbaugh, R.↗