Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Programming, Linear”

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 397 records · Page 22

Progress in multidisciplinary design optimization at NASA Langley

Multidisciplinary Design Optimization refers to some combination of disciplinary analyses, sensitivity analysis, and optimization techniques used to design complex engineering systems. The ultimate objective of this research at NASA Langley Research Center is to help the US industry reduce the costs associated with development, manufacturing, and maintenance of aerospace vehicles while improving system performance. This report reviews progress towards this objective and highlights topics for future research. Aerospace design problems selected from the author's research illustrate strengths and weaknesses in existing multidisciplinary optimization techniques. The techniques discussed include multiobjective optimization, global sensitivity equations and sequential linear programming.

Padula, Sharon L.↗

A multilevel cost-space approach to solving the balanced long transportation problem

We develop a multilevel scheme for solving the balanced long transportation problem, that is, given a set (c(sub kj)) of shipping costs from a set of M supply nodes S(sub k) to a set of N demand nodes D(sub j), we seek to find a set of flows, (x(sub kj)), that minimizes the total cost Sigma(sub k=1)(exp M) Sigma(sub j=1)(exp N) x(sub kj)c(sub kj). We require that the problem be balanced, that is, the total demand must equal the total supply. Solution techniques for this problem are well known from optimization and linear programming. We examine this problem, however, in order to develop principles that can then be applied to more intractible problems of optimization. We develop a multigrid scheme for solving the problem, defining the grids, relaxation, and intergrid operators. Numerical experimentation shows that this line of research may prove fruitful. Further research directions are suggested.

Cavanaugh, Kevin J.↗

Aerospace applications on integer and combinatorial optimization

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem. for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Padula, S. L.↗

Aerospace applications of integer and combinatorial optimization

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in solving combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on a large space structure and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Padula, S. L.↗

Aerospace Applications of Integer and Combinatorial Optimization

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Padula, S. L.↗

Documentation for a Structural Optimization Procedure Developed Using the Engineering Analysis Language (EAL)

This report describes a structural optimization procedure developed for use with the Engineering Analysis Language (EAL) finite element analysis system. The procedure is written primarily in the EAL command language. Three external processors which are written in FORTRAN generate equivalent stiffnesses and evaluate stress and local buckling constraints for the sections. Several built-up structural sections were coded into the design procedures. These structural sections were selected for use in aircraft design, but are suitable for other applications. Sensitivity calculations use the semi-analytic method, and an extensive effort has been made to increase the execution speed and reduce the storage requirements. There is also an approximate sensitivity update method included which can significantly reduce computational time. The optimization is performed by an implementation of the MINOS V5.4 linear programming routine in a sequential liner programming procedure.

Martin, Carl J., Jr.↗

Comparative Evaluation of Different Optimization Algorithms for Structural Design Applications

Non-linear programming algorithms play an important role in structural design optimization. Fortunately, several algorithms with computer codes are available. At NASA Lewis Research Centre, a project was initiated to assess the performance of eight different optimizers through the development of a computer code CometBoards. This paper summarizes the conclusions of that research. CometBoards was employed to solve sets of small, medium and large structural problems, using the eight different optimizers on a Cray-YMP8E/8128 computer. The reliability and efficiency of the optimizers were determined from the performance of these problems. For small problems, the performance of most of the optimizers could be considered adequate. For large problems, however, three optimizers (two sequential quadratic programming routines, DNCONG of IMSL and SQP of IDESIGN, along with Sequential Unconstrained Minimizations Technique SUMT) outperformed others. At optimum, most optimizers captured an identical number of active displacement and frequency constraints but the number of active stress constraints differed among the optimizers. This discrepancy can be attributed to singularity conditions in the optimization and the alleviation of this discrepancy can improve the efficiency of optimizers.

Patnaik, Surya N.↗

Optimal System Realization in Frequency Domain

Several approaches are presented to identify an experimental system model directly from frequency response data. The formulation begins with a matrix-fraction description as the model structure. Frequency weighting such as exponential weighting is introduced to solve a weighted least-squares problem to obtain the coefficient matrices for the matrix-fraction description. A multi-variable state-space model can then be formed using the coefficient matrices of the matrix-fraction description. An approach is introduced to fine-tune the model using non-linear programming methods to minimize the desired cost function. The method deals with the model in the real Schur or modal form and reassigns a subset of system poles using a nonlinear optimizer. At every optimization step, the input and output influence matrices are refined through least-squares procedures. The proposed approaches are used to identify an analytical model for a NASA testbed from experimental data.

Juang, Jer-Nan↗

Cylindrical Optic Polishing Dwell Time Optimization

The Constellation-X x-ray telescope consists of replicated grazing incidence optics. The polishing of the "master' mandrel is accomplished by moving a polishing tool along a helical path on the surface of this almost cylindrical surface. The measurement of the surface is, however, performed along "axial" scan lines which intercept this helical path. This approach to polishing and measuring permits a relatively simple scheme to be implemented for the determination of the optimal dwell times of the polishing tool. These optimal dwell times are determined by a deconvolution which approaches the problem as a linear programming problem and uses the simplex method. This approach maximizes the amount of material removed at any point subject to inequality constraints. The effects of using these "optimum" dwell times is to significantly improve the "tools" effectiveness at removing the higher spatial frequencies while staying (strictly) within the bounds and constraints imposed by the hardware. In addition the "ringing" at the edges of the optic, frequently present in deconvolution problems, is completely eliminated.

Waluschka, Eugene↗

Efficient Low-Speed Flight in a Wind Field

A new software tool was needed for flight planning of a high altitude, low speed unmanned aerial vehicle which would be flying in winds close to the actual airspeed of the vehicle. An energy modeled NLP (non-linear programming) formulation was used to obtain results for a variety of missions and wind profiles. The energy constraint derived included terms due to the wind field and the performance index was a weighted combination of the amount of fuel used and the final time. With no emphasis on time and with no winds the vehicle was found to fly at maximum lift to drag velocity, V(sub md). When flying in tail winds the velocity was less than V(sub md), while flying in head winds the velocity was higher than V(sub md). A family of solutions was found with varying times of flight and varying fuel amounts consumed which will aid the operator in choosing a flight plan depending on a desired landing time. At certain parts of the flight, the turning terms in the energy constraint equation were found to be significant. An analysis of a simpler vertical plane cruise optimal control problem was used to explain some of the characteristics of the vertical plane NLP results.

Feldman, Michael A.↗

Neural Flight Control System

The Neural Flight Control System (NFCS) was developed to address the need for control systems that can be produced and tested at lower cost, easily adapted to prototype vehicles and for flight systems that can accommodate damaged control surfaces or changes to aircraft stability and control characteristics resulting from failures or accidents. NFCS utilizes on a neural network-based flight control algorithm which automatically compensates for a broad spectrum of unanticipated damage or failures of an aircraft in flight. Pilot stick and rudder pedal inputs are fed into a reference model which produces pitch, roll and yaw rate commands. The reference model frequencies and gains can be set to provide handling quality characteristics suitable for the aircraft of interest. The rate commands are used in conjunction with estimates of the aircraft s stability and control (S&C) derivatives by a simplified Dynamic Inverse controller to produce virtual elevator, aileron and rudder commands. These virtual surface deflection commands are optimally distributed across the aircraft s available control surfaces using linear programming theory. Sensor data is compared with the reference model rate commands to produce an error signal. A Proportional/Integral (PI) error controller "winds up" on the error signal and adds an augmented command to the reference model output with the effect of zeroing the error signal. In order to provide more consistent handling qualities for the pilot, neural networks learn the behavior of the error controller and add in the augmented command before the integrator winds up. In the case of damage sufficient to affect the handling qualities of the aircraft, an Adaptive Critic is utilized to reduce the reference model frequencies and gains to stay within a flyable envelope of the aircraft.

Gundy-Burlet, Karen↗

Intelligent Control Approaches for UAVs

This talk will present overviews of various intelligent control technologies currently being developed and studied at the NASA Ames Research Center as applicable to Unmanned Aerial Vehicles (UAVs), Mars flyers, and to the next generation of flight controllers for manned aircraft. The approaches being examined include: (a) direct adaptive dynamic inverse controller, (b) adaptive critic-based optimal trajectory generator; (c) optimal allocation technique based on linear programming; (4) immunized maneuvering using autopilot building blocks. These approaches can utilize, but do not require, fault detection and isolation information. Piloted and unmanned simulation studies are performed to examine if the intelligent flight control techniques adequately: 1) match flying qualities of modem fly-by-wire flight controllers under nominal conditions; 2) improve performance under failure conditions when sufficient control authority is available; and 3) achieve intelligent maneuvering capabilities for unmanned vehicles. Results obtained so far will be presented and discussed.

KrisnaKumar, Kalmanje↗

A Disturbance Rejection Approach to Actuator and Sensor Placement

For various reasons as discussed for instance in, the selection of actuator and sensor positions is still ad hoc. This is especially true for flexible structures where many candidate configurations can exist. This study is an attempt to make the selection process more methodical. One approach to actuator and sensor placement is to optimize a closed loop performance metric directly by selecting the actuators, sensors, and controller gains simultaneously. This direct approach makes sense if the desired closed loop performance is well defined. Since the individual actuator and sensor contributions to the closed loop performance metric is complex, the solution strategy usually employs non linear programming with many design and numerical iterations. A second approach is to select actuators and/or sensors based on open loop properties so that closed loop performance is indirectly optimized. Since the individual sensor and actuator contributions to the open loop metric is simple, nonlinear optimization is usually not needed. This approach will suggest efficient actuator and sensor configurations for any type of control law. The method suggested in this study falls into the latter class of approaches.

Lim, K. B.↗

Modeling and Evaluation of Miles-in-Trail Restrictions in the National Air Space

Miles-in-trail restrictions impact flights in the national air space on a daily basis and these restrictions routinely propagate between adjacent Air Route Traffic Control Centers. Since overly restrictive or ineffective miles-in-trail restrictions can reduce the overall efficiency of the national air space, decision support capabilities that model miles-in-trail restrictions should prove to be very beneficial. This paper presents both an analytical formulation and a linear programming approach for modeling the effects of miles-in-trail restrictions. A methodology for monitoring the conformance of an existing miles-in-trail restriction is also presented. These capabilities have been implemented in the Future ATM Concepts Evaluation Tool for testing purposes. To allow alternative restrictions to be evaluated in post-operations, a new mode of operation, which is referred to as the hybrid-playback mode, has been implemented in the simulation environment. To demonstrate the capabilities of these new algorithms, the miles-in-trail restrictions, which were in effect on June 27, 2002 in the New York Terminal Radar Approach Control, are examined. Results from the miles-in-trail conformance monitoring functionality are presented for the ELIOT, PARKE and WHITE departure fixes. In addition, the miles-in-trail algorithms are used to assess the impact of alternative restrictions at the PARKE departure fix.

Grabbe, Shon↗

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Ortiz, Francisco↗

Subsonic Aircraft With Regression and Neural-Network Approximators Designed

At the NASA Glenn Research Center, NASA Langley Research Center's Flight Optimization System (FLOPS) and the design optimization testbed COMETBOARDS with regression and neural-network-analysis approximators have been coupled to obtain a preliminary aircraft design methodology. For a subsonic aircraft, the optimal design, that is the airframe-engine combination, is obtained by the simulation. The aircraft is powered by two high-bypass-ratio engines with a nominal thrust of about 35,000 lbf. It is to carry 150 passengers at a cruise speed of Mach 0.8 over a range of 3000 n mi and to operate on a 6000-ft runway. The aircraft design utilized a neural network and a regression-approximations-based analysis tool, along with a multioptimizer cascade algorithm that uses sequential linear programming, sequential quadratic programming, the method of feasible directions, and then sequential quadratic programming again. Optimal aircraft weight versus the number of design iterations is shown. The central processing unit (CPU) time to solution is given. It is shown that the regression-method-based analyzer exhibited a smoother convergence pattern than the FLOPS code. The optimum weight obtained by the approximation technique and the FLOPS code differed by 1.3 percent. Prediction by the approximation technique exhibited no error for the aircraft wing area and turbine entry temperature, whereas it was within 2 percent for most other parameters. Cascade strategy was required by FLOPS as well as the approximators. The regression method had a tendency to hug the data points, whereas the neural network exhibited a propensity to follow a mean path. The performance of the neural network and regression methods was considered adequate. It was at about the same level for small, standard, and large models with redundancy ratios (defined as the number of input-output pairs to the number of unknown coefficients) of 14, 28, and 57, respectively. In an SGI octane workstation (Silicon Graphics, Inc., Mountainview, CA), the regression training required a fraction of a CPU second, whereas neural network training was between 1 and 9 min, as given. For a single analysis cycle, the 3-sec CPU time required by the FLOPS code was reduced to milliseconds by the approximators. For design calculations, the time with the FLOPS code was 34 min. It was reduced to 2 sec with the regression method and to 4 min by the neural network technique. The performance of the regression and neural network methods was found to be satisfactory for the analysis and design optimization of the subsonic aircraft.

Patnaik, Surya N.↗

Decentralized Formation Flying Control in a Multiple-Team Hierarchy

This paper presents the prototype of a system that addresses these objectives-a decentralized guidance and control system that is distributed across spacecraft using a multiple-team framework. The objective is to divide large clusters into teams of manageable size, so that the communication and computational demands driven by N decentralized units are related to the number of satellites in a team rather than the entire cluster. The system is designed to provide a high-level of autonomy, to support clusters with large numbers of satellites, to enable the number of spacecraft in the cluster to change post-launch, and to provide for on-orbit software modification. The distributed guidance and control system will be implemented in an object-oriented style using MANTA (Messaging Architecture for Networking and Threaded Applications). In this architecture, tasks may be remotely added, removed or replaced post-launch to increase mission flexibility and robustness. This built-in adaptability will allow software modifications to be made on-orbit in a robust manner. The prototype system, which is implemented in MATLAB, emulates the object-oriented and message-passing features of the MANTA software. In this paper, the multiple-team organization of the cluster is described, and the modular software architecture is presented. The relative dynamics in eccentric reference orbits is reviewed, and families of periodic, relative trajectories are identified, expressed as sets of static geometric parameters. The guidance law design is presented, and an example reconfiguration scenario is used to illustrate the distributed process of assigning geometric goals to the cluster. Next, a decentralized maneuver planning approach is presented that utilizes linear-programming methods to enact reconfiguration and coarse formation keeping maneuvers. Finally, a method for performing online collision avoidance is discussed, and an example is provided to gauge its performance.

Mueller, Joseph .↗

Mission Operations Planning with Preferences: An Empirical Study

This paper presents an empirical study of some nonexhaustive approaches to optimizing preferences within the context of constraint-based, mixed-initiative planning for mission operations. This work is motivated by the experience of deploying and operating the MAPGEN (Mixed-initiative Activity Plan GENerator) system for the Mars Exploration Rover Mission. Responsiveness to the user is one of the important requirements for MAPGEN, hence, the additional computation time needed to optimize preferences must be kept within reasonabble bounds. This was the primary motivation for studying non-exhaustive optimization approaches. The specific goals of rhe empirical study are to assess the impact on solution quality of two greedy heuristics used in MAPGEN and to assess the improvement gained by applying a linear programming optimization technique to the final solution.

Bresina, John L.↗