Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear constraints”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Gesture-controlled interfaces for self-service machines and other applications

A gesture recognition interface for use in controlling self-service machines and other devices is disclosed. A gesture is defined as motions and kinematic poses generated by humans, animals, or machines. Specific body features are tracked, and static and motion gestures are interpreted. Motion gestures are defined as a family of parametrically delimited oscillatory motions, modeled as a linear-in-parameters dynamic system with added geometric constraints to allow for real-time recognition using a small amount of memory and processing time. A linear least squares method is preferably used to determine the parameters which represent each gesture. Feature position measure is used in conjunction with a bank of predictor bins seeded with the gesture parameters, and the system determines which bin best fits the observed motion. Recognizing static pose gestures is preferably performed by localizing the body/object from the rest of the image, describing that object, and identifying that description. The disclosure details methods for gesture recognition, as well as the overall architecture for using gesture recognition to control of devices, including self-service machines.

Cohen, Charles J.↗
NASA NTRS2002

Lattice Boltzmann Equation On a 2D Rectangular Grid

We construct a multi-relaxation lattice Boltzmann model on a two-dimensional rectangular grid. The model is partly inspired by a previous work of Koelman to construct a lattice BGK model on a two-dimensional rectangular grid. The linearized dispersion equation is analyzed to obtain the constraints on the isotropy of the transport coefficients and Galilean invariance for various wave propagations in the model. The linear stability of the model is also studied. The model is numerically tested for three cases: (a) a vortex moving with a constant velocity on a mesh periodic boundary conditions; (b) Poiseuille flow with an arbitras~y inclined angle with respect to the lattice orientation: and (c) a cylinder &symmetrically placed in a channel. The numerical results of these tests are compared with either analytic solutions or the results obtained by other methods. Satisfactory results are obtained for the numerical simulations.

Bouzidi, MHamed↗
NASA NTRS1988

Aerodynamic characteristics of wings designed with a combined-theory method to cruise at a Mach number of 4.5

A wind-tunnel study was conducted to determine the capability of a method combining linear theory and shock-expansion theory to design optimum camber surfaces for wings that will fly at high-supersonic/low-hypersonic speeds. Three force models (a flat-plate reference wing and two cambered and twisted wings) were used to obtain aerodynamic lift, drag, and pitching-moment data. A fourth pressure-orifice model was used to obtain surface-pressure data. All four wing models had the same planform, airfoil section, and centerbody area distribution. The design Mach number was 4.5, but data were also obtained at Mach numbers of 3.5 and 4.0. Results of these tests indicated that the use of airfoil thickness as a theoretical optimum, camber-surface design constraint did not improve the aerodynamic efficiency or performance of a wing as compared with a wing that was designed with a zero-thickness airfoil (linear-theory) constraint.

Mack, Robert J.↗
NASA NTRS1971

Analytical and experimental studies of natural vibrations modes of ring-stiffened truncated-cone shells with variable theoretical ring fixity

Experimental and analytical investigations of the vibratory behavior of ring-stiffened truncated-cone shells are described. Vibration tests were conducted on 60 deg conical shells having up to four ring stiffeners and for free-free and clamped-free edge constraints and 9 deg conical shells, for two thicknesses, each with two angle rings and for free-free, free-clamped, and clamped-clamped edge constraints. The analytical method is based on linear thin shell theory, employing the Rayleigh-Ritz method. Discrete rings are represented as composed of one or more segments, each of which is a short truncated-cone shell of uniform thickness. Equations of constraint are used to join a ring and shell along a circumferential line connection. Excellent agreement was obtained for comparisons of experimental and calculated frequencies.

Naumann, E. C.↗
NASA NTRS2011

Multi-Maneuver Clohessy-Wiltshire Targeting

Orbital rendezvous involves execution of a sequence of maneuvers by a chaser vehicle to bring the chaser to a desired state relative to a target vehicle while meeting intermediate and final relative constraints. Intermediate and final relative constraints are necessary to meet a multitude of requirements such as to control approach direction, ensure relative position is adequate for operation of space-to-space communication systems and relative sensors, provide fail-safe trajectory features, and provide contingency hold points. The effect of maneuvers on constraints is often coupled, so the maneuvers must be solved for as a set. For example, maneuvers that affect orbital energy change both the chaser's height and downrange position relative to the target vehicle. Rendezvous designers use experience and rules-of-thumb to design a sequence of maneuvers and constraints. A non-iterative method is presented for targeting a rendezvous scenario that includes a sequence of maneuvers and relative constraints. This method is referred to as Multi-Maneuver Clohessy-Wiltshire Targeting (MM_CW_TGT). When a single maneuver is targeted to a single relative position, the classic CW targeting solution is obtained. The MM_CW_TGT method involves manipulation of the CW state transition matrix to form a linear system. As a starting point for forming the algorithm, the effects of a series of impulsive maneuvers on the state are derived. Simple and moderately complex examples are used to demonstrate the pattern of the resulting linear system. The general form of the pattern results in an algorithm for formation of the linear system. The resulting linear system relates the effect of maneuver components and initial conditions on relative constraints specified by the rendezvous designer. Solution of the linear system includes the straight-forward inverse of a square matrix. Inversion of the square matrix is assured if the designer poses a controllable scenario - a scenario where the the constraints can be met by the sequence of maneuvers. Matrices in the linear system are dependent on selection of maneuvers and constraints by the designer, but the matrices are independent of the chaser's initial conditions. For scenarios where the sequence of maneuvers and constraints are fixed, the linear system can be formed and the square matrix inverted prior to real-time operations. Example solutions are presented for several rendezvous scenarios to illustrate the utility of the method. The MM_CW_TGT method has been used during the preliminary design of rendezvous scenarios and is expected to be useful for iterative methods in the generation of an initial guess and corrections.

Dannemiller, David P.↗
NASA NTRS1971

Parameter identification using a creeping-random-search algorithm

A creeping-random-search algorithm is applied to different types of problems in the field of parameter identification. The studies are intended to demonstrate that a random-search algorithm can be applied successfully to these various problems, which often cannot be handled by conventional deterministic methods, and, also, to introduce methods that speed convergence to an extremal of the problem under investigation. Six two-parameter identification problems with analytic solutions are solved, and two application problems are discussed in some detail. Results of the study show that a modified version of the basic creeping-random-search algorithm chosen does speed convergence in comparison with the unmodified version. The results also show that the algorithm can successfully solve problems that contain limits on state or control variables, inequality constraints (both independent and dependent, and linear and nonlinear), or stochastic models.

Parrish, R. V.↗
NASA NTRS1972

The optimal control of merging aircraft-derivation of the hybrid air traffic controller.

The Federal Aviation Administration has initiated a program to automate its existing manual air traffic handling procedures. One procedure, whose automation is expected to increase controller efficiency by 2.6 to 2.9 times, is known as aircraft merging. This procedure is concerned with the merging of N aircraft, which are distributed among K feeder routes, into one or more final routes. The question of obtaining an exactly realizable and easily implementable automatic controller for merging is discussed. The optimal control of a linear system with state and control constraints is considered.

Schatz, J. G.↗
NASA NTRS1975

Input design for identification of aircraft stability and control derivatives

An approach for designing inputs to identify stability and control derivatives from flight test data is presented. This approach is based on finding inputs which provide the maximum possible accuracy of derivative estimates. Two techniques of input specification are implemented for this objective - a time domain technique and a frequency domain technique. The time domain technique gives the control input time history and can be used for any allowable duration of test maneuver, including those where data lengths can only be of short duration. The frequency domain technique specifies the input frequency spectrum, and is best applied for tests where extended data lengths, much longer than the time constants of the modes of interest, are possible. These technqiues are used to design inputs to identify parameters in longitudinal and lateral linear models of conventional aircraft. The constraints of aircraft response limits, such as on structural loads, are realized indirectly through a total energy constraint on the input. Tests with simulated data and theoretical predictions show that the new approaches give input signals which can provide more accurate parameter estimates than can conventional inputs of the same total energy. Results obtained indicate that the approach has been brought to the point where it should be used on flight tests for further evaluation.

Gupta, N. K.↗
NASA NTRS1976

Indirect synthesis of multidegree-of-freedom transient systems

The indirect synthesis method is developed and shown to be capable of leading a near-optimal design of multidegree-of-freedom and multidesign-element transient nonlinear dynamical systems. The basis of the approach is to select the open design parameters such that the response of the portion of the system being designed approximates the limiting performances solution. The limiting performance problem can be formulated as one of linear programming by replacing all portions of the system subject to transient disturbances by control forces and supposing that the remaining portions are linear as are the overall kinematic constraints. One then selects the design parameters that respond most closely to the limiting performance solution, which can be achieved by unconstrained curve-fitting techniques.

Chen, Y. H.↗
NASA NTRS1990

Optimization of linear, controlled structures

An approach to the integrated design of linear controlled structures, which is being investigated as part of NASA's controlled structures interaction (CSI) methodology development program, is presented. The approach is integrated in the sense that the structure and its controller are simultaneously designed. The design methodology uses constrained nonlinear optimization procedures based on analytically obtained gradients of the structural responses. Design of the controller is based on the so-called Q-parameterization theory, which parameterizes all closed-loop input/output maps achievable with stabiizing linear controllers. Very general objective and constraint functions are possible, and structural shape can be included in the design variables. This method has been partially implemented and demonstrated; early findings are reported.

Hunziker, K. Scott↗
NASA NTRS1958

Drag Minimization for Wings and Bodies in Supersonic Flow

The minimization of inviscid fluid drag is studied for aerodynamic shapes satisfying the conditions of linearized theory, and subject to imposed constraints on lift, pitching moment, base area, or volume. The problem is transformed to one of determining two-dimensional potential flows satisfying either Laplace's or Poisson's equations with boundary values fixed by the imposed conditions. A general method for determining integral relations between perturbation velocity components is developed. This analysis is not restricted in application to optimum cases; it may be used for any supersonic wing problem.

Heaslet, Max A↗
NASA NTRS1989

Optimal selection of space transportation fleet to meet multi-mission space program needs

A space program that spans several decades will be comprised of a collection of missions such as low earth orbital space station, a polar platform, geosynchronous space station, lunar base, Mars astronaut mission, and Mars base. The optimal selection of a fleet of several recoverable and expendable launch vehicles, upper stages, and interplanetary spacecraft necessary to logistically establish and support these space missions can be examined by means of a linear integer programming optimization model. Such a selection must be made because the economies of scale which comes from producing large quantities of a few standard vehicle types, rather than many, will be needed to provide learning curve effects to reduce the overall cost of space transportation if these future missions are to be affordable. Optimization model inputs come from data and from vehicle designs. Each launch vehicle currently in existence has a launch history, giving rise to statistical estimates of launch reliability. For future, not-yet-developed launch vehicles, theoretical reliabilities corresponding to the maturity of the launch vehicles' technology and the degree of design redundancy must be estimated. Also, each such launch vehicle has a certain historical or estimated development cost, tooling cost, and a variable cost. The cost of a launch used in this paper includes the variable cost plus an amortized portion of the fixed and development costs. The integer linear programming model will have several constraint equations based on assumptions of mission mass requirements, volume requirements, and number of astronauts needed. The model will minimize launch vehicle logistic support cost and will select the most desirable launch vehicle fleet.

Morgenthaler, George W.↗
NASA NTRS1999

Ames Optimized TCA Configuration

Configuration design at Ames was carried out with the SYN87-SB (single block) Euler code using a 193 x 49 x 65 C-H grid. The Euler solver is coupled to the constrained (NPSOL) and the unconstrained (QNMDIF) optimization packages. Since the single block grid is able to model only wing-body configurations, the nacelle/diverter effects were included in the optimization process by SYN87's option to superimpose the nacelle/diverter interference pressures on the wing. These interference pressures were calculated using the AIRPLANE code. AIRPLANE is an Euler solver that uses a unstructured tetrahedral mesh and is capable of computations about arbitrary complete configurations. In addition, the buoyancy effects of the nacelle/diverters were also included in the design process by imposing the pressure field obtained during the design process onto the triangulated surfaces of the nacelle/diverter mesh generated by AIRPLANE. The interference pressures and nacelle buoyancy effects are added to the final forces after each flow field calculation. Full details of the (recently enhanced) ghost nacelle capability are given in a related talk. The pseudo nacelle corrections were greatly improved during this design cycle. During the Ref H and Cycle 1 design activities, the nacelles were only translated and pitched. In the cycle 2 design effort the nacelles can translate vertically, and pitch to accommodate the changes in the lower surface geometry. The diverter heights (between their leading and trailing edges) were modified during design as the shape of the lower wing changed, with the drag of the diverter changing accordingly. Both adjoint and finite difference gradients were used during optimization. The adjoint-based gradients were found to give good direction in the design space for configurations near the starting point, but as the design approached a minimum, the finite difference gradients were found to be more accurate. Use of finite difference gradients was limited by the CPU time limit available on the Cray machines. A typical optimization run using finite difference gradients can use only 30 to 40 design variables and one optimization iteration within the 8 hour queue limit for the chosen grid size and convergence level. The efficiency afforded by the adjoint method allowed for 50-120 design variables and 5-10 optimization iterations in the 8 hour queue. Geometric perturbations to the wing and fuselage were made using the Hicks/Henne (HH) shape functions. The HH functions were distributed uniformly along the chords of the wing defining sections and lofted linearly. During single-surface design, constraints on thickness and volume at selected wing stations were imposed. Both fuselage camber and cross-sectional area distributions were permitted to change during design. The major disadvantage to the use of these functions is the inherent surface waviness produced by repeated use of such functions. Many smoothing operations were required following optimization runs to produce a configuration with reasonable smoothness. Wagner functions were also used on the wing sections but were never used on the fuselage. The Wagner functions are a family of increasingly oscillatory functions that have also been used extensively in airfoil design. The leading and trailing edge regions of the wing were designed by use of polynomial and monomial functions respectively. Twist was attempted but was abandoned because of little performance improvement available from changing the baseline twist.

Cliff, Susan E.↗
NASA NTRS2010

Aircraft Trajectory Optimization and Contrails Avoidance in the Presence of Winds

There are indications that persistent contrails can lead to adverse climate change, although the complete effect on climate forcing is still uncertain. A flight trajectory optimization algorithm with fuel and contrails models, which develops alternative flight paths, provides policy makers the necessary data to make tradeoffs between persistent contrails mitigation and aircraft fuel consumption. This study develops an algorithm that calculates wind-optimal trajectories for cruising aircraft while avoiding the regions of airspace prone to persistent contrails formation. The optimal trajectories are developed by solving a non-linear optimal control problem with path constraints. The regions of airspace favorable to persistent contrails formation are modeled as penalty areas that aircraft should avoid and are adjustable. The tradeoff between persistent contrails formation and additional fuel consumption is investigated, with and without altitude optimization, for 12 city-pairs in the continental United States. Without altitude optimization, the reduction in contrail travel times is gradual with increase in total fuel consumption. When altitude is optimized, a two percent increase in total fuel consumption can reduce the total travel times through contrail regions by more than six times. Allowing further increase in fuel consumption does not seem to result in proportionate decrease in contrail travel times.

Ng, Hok K.↗
NASA NTRS2014

Rate-Compatible Protograph LDPC Codes

Digital communication coding methods resulting in rate-compatible low density parity-check (LDPC) codes built from protographs. Described digital coding methods start with a desired code rate and a selection of the numbers of variable nodes and check nodes to be used in the protograph. Constraints are set to satisfy a linear minimum distance growth property for the protograph. All possible edges in the graph are searched for the minimum iterative decoding threshold and the protograph with the lowest iterative decoding threshold is selected. Protographs designed in this manner are used in decode and forward relay channels.

Nguyen, Thuy V.↗
NASA NTRSDate not supplied

Planning Satellite Swarm Measurements for Climate Models: Comparing Dynamic Constraint Processing and MILP Methods

We present D-SHIELD, a challenging climate science application to plan coordinated measurements (observations) for a constellation of satellites, each containing two different sensors, each with 61 pointing angle options. The L-band and P-band radar sensors collect data fed into a soil moisture model which tracks and predicts soil moisture across 1.67 million Ground Positions (GP). Soil moisture is an important predictor of wildfires, and then a predictor of floods, landslides and debris flow after a fire. Each measurement covers multiple GP due to the sensor footprint. Each GP has a "model error" which represents the uncertainty of the the soil moisture state prediction. Model error changes at different rates for each GP as the time since last observation increases and after significant events like rain. The planner's goal is to select measurements which maximize soil moisture model improvement (reduce model uncertainty). This problem is combinatorically explosive, involving many degrees of freedom for planner choices. Good domain heuristics can find solutions within a reasonable time for our application needs but cannot be proven optimal. In this paper we compare two different planning approaches to this problem: Dynamic Constraint Processing (DCP) and Mixed Integer Linear Programming (MILP). We match inputs and metrics for both DCP and MILP algorithms to enable a direct apples-to-apples comparison. We demonstrate and discuss the trades between DCP flexibility and performance vs. MILP's promise of provable optimality.

Rich Levinson↗