Search NASASearch

SEARCH · Search NASA

Results for “Continuous Optimization”

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 37 records · Page 2

Laboratory comparison of continuous vs. binary phase-mostly filters

Recent developments in spatial light modulators have led to devices which are capable of continuous phase modulation, even if only over a limited range. One of these devices, the deformable mirror device is used, to compare the relative merits of binary and partially-continuous phase filters in a specific problem of pattern recognition by optical correlation. Each filter was physically limited to only about a radiation of modulation. Researchers have predicted that for low input noise levels, continuous phase-only filters should have a higher absolute correlator peak output than the corresponding binary filters, as well as having a larger SNR. When continuous and binary filters were implemented on the DMD and they exhibited the same performance; an ad hoc filter optimization procedure was developed for use in the laboratory. The optimized continuous filter gave higher correlation peaks than did an independently optimized binary filter. Background behavior in the correlation plane was similar for the two filters, and thus the SNR showed the same improvement for the continuous filter. A phasor diagram analysis and computer simulation have explained part of the optimization procedure's success.

Monroe, Stanley E., Jr.

An algorithm for the weighting matrices in the sampled-data optimal linear regulator problem

The sampled-data optimal linear regulator problem provides a means whereby a control designer can use an understanding of continuous optimal regulator design to produce a digital state variable feedback control law which satisfies continuous system performance specifications. A basic difficulty in applying the sampled-data regulator theory is the requirement that certain digital performance index weighting matrices, expressed as complicated functions of system matrices, be computed. Infinite series representations are presented for the weighting matrices of the time-invariant version of the optimal linear sampled-data regulator problem. Error bounds are given for estimating the effect of truncating the series expressions after a finite number of terms, and a method is described for their computer implementation. A numerical example is given to illustrate the results.

Armstrong, E. S.

Research on optimization-based design

Research on optimization-based design is discussed. Illustrative examples are given for cases involving continuous optimization with discrete variables and optimization with tolerances. Approximation of computationally expensive and noisy functions, electromechanical actuator/control system design using decomposition and application of knowledge-based systems and optimization for the design of a valve anti-cavitation device are among the topics covered.

Balling, R. J.

Optimization methods for passive damper placement and tuning

The effectiveness of viscous elements in introducing damping in a structure is a function of several variables, including their number, their location in the structure, and their physical properties. In this paper several optimization problems are posed to optimize these variables. The paper investigates various metrics to define the optimization problem, and compares the damping profiles that are obtained. Both discrete and continuous optimization problems are formulated and solved, corresponding, respectively, to the problems of placement of damping elements and to the tuning of their parameters. The paper particularly emphasizes techniques to make feasible the large scale problems resulting from the optimization formulations. Numerical results involving a lightly damped tested structure are presented.

Milman, M. H.

Statistical analysis of static shape control in space structures

The article addresses the problem of efficient analysis of the statistics of initial and corrected shape distortions in space structures. Two approaches for improving efficiency are considered. One is an adjoint technique for calculating distortion shapes: the second is a modal expansion of distortion shapes in terms of pseudo-vibration modes. The two techniques are applied to the problem of optimizing actuator locations on a 55 m radiometer antenna. The adjoint analysis technique is used with a discrete-variable optimization method. The modal approximation technique is coupled with a standard conjugate-gradient continuous optimization method. The agreement between the two sets of results is good, validating both the approximate analysis and optimality of the results.

Burdisso, Ricardo A.

Application of an advanced trajectory optimization method to ramjet propelled missiles

The mission performance characteristics of ramjet-propelled missiles are highly dependent upon the trajectory flown. Integration of the trajectory profile with the ramjet propulsion system performance characteristics to achieve optimal missile performance is very complex. Past trajectory optimization methods have been extremely problem dependent and require a high degree of familiarity to achieve success. A general computer code (CTOP) has been applied to ramjet-powered missiles to compute open-loop optimal trajectories. CTOP employs Chebyshev polynomial representations of the states and controls. This allows a transformation of the continuous optimal control problem to one of parameter optimization. With this method, the trajectory boundary conditions are always satisfied. State dynamics and path constraints are enforced via penalty functions. The presented results include solutions to minimum fuel-to-climb, minimum time-to-climb, and minimum time-to-target intercept problems.

Paris, S. W.

Engineering calculations for communications systems planning

The single entry interference problem is treated for frequency sharing between the broadcasting satellite and intersatellite services near 23 GHz. It is recommended that very long (more than 120 longitude difference) intersatellite hops be relegated to the unshared portion of the band. When this is done, it is found that suitable orbit assignments can be determined easily with the aid of a set of universal curves. An attempt to develop synthesis procedures for optimally assigning frequencies and orbital slots for the broadcasting satellite service in region 2 was initiated. Several discrete programming and continuous optimization techniques are discussed.

Levis, C. A.

A survey of methods of feasible directions for the solution of optimal control problems

Three methods of feasible directions for optimal control are reviewed. These methods are an extension of the Frank-Wolfe method, a dual method devised by Pironneau and Polack, and a Zontendijk method. The categories of continuous optimal control problems are shown as: (1) fixed time problems with fixed initial state, free terminal state, and simple constraints on the control; (2) fixed time problems with inequality constraints on both the initial and the terminal state and no control constraints; (3) free time problems with inequality constraints on the initial and terminal states and simple constraints on the control; and (4) fixed time problems with inequality state space contraints and constraints on the control. The nonlinear programming algorithms are derived for each of the methods in its associated category.

Polak, E.

A method for nonlinear optimization with discrete design variables

A numerical method is presented for the solution of nonlinear discrete optimization problems. The applicability of discrete optimization to engineering design is discussed, and several standard structural optimization problems are solved using discrete design variables. The method uses approximation techniques to create subproblems suitable for linear mixed-integer programming methods. The method employs existing software for continuous optimization and integer programming.

Olsen, Gregory R.

Piloted Evaluation of a Fault Recovery System for an Aircraft with Distributed Electric Propulsion

Electrified aircraft powertrains contain multiple tightly coupled subsystems, making them much more complex than traditional aircraft propulsion systems, both in terms of integration and control. Electrification enables aircraft to have multiple distributed thrust-producing fans that the flight control system can utilize for enhanced maneuverability, further increasing the control complexity. The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept aircraft that leverages this technology. SUSAN is a series/parallel partial hybrid electric single-aisle transport aircraft that takes advantage of its electrified powertrain to provide fuel burn and emissions benefits when compared to the state-of-the-art. Achieving these benefits requires an appropriately designed control architecture that coordinates the various powertrain and flight control subsystems. As such, the SUSAN aircraft is designed with a high level of automation, allowing it to properly manage coupled subsystems and react rapidly to failures and anomalies. To do this effectively, algorithms that perform component health management, fault detection, isolation, and accommodation, and continuous optimization, must be developed, tested, validated, and implemented. This paper describes a piloted evaluation of such an algorithm in scenarios with multiple fan failures, performed in a flight simulator, demonstrating failure recovery and continued safe operation up to the limits of the powertrain. These scenarios are subsequently related to certification requirements.

Electrified Aircraft Propulsion

Piloted Evaluation of a Fault Recovery System for an Aircraft with Distributed Electric Propulsion

Electrified aircraft powertrains contain multiple tightly coupled subsystems, making them much more complex than traditional aircraft propulsion systems, both in terms of integration and control. Electrification enables aircraft to have multiple distributed thrust-producing fans that the flight control system can utilize for enhanced maneuverability, further increasing the control complexity. The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept aircraft that leverages this technology. SUSAN is a series/parallel partial hybrid electric single-aisle transport aircraft that takes advantage of its electrified powertrain to provide fuel burn and emissions benefits when compared to the state-of-the-art. Achieving these benefits requires an appropriately designed control architecture that coordinates the various powertrain and flight control subsystems. As such, the SUSAN aircraft is designed with a high level of automation, allowing it to properly manage coupled subsystems and react rapidly to failures and anomalies. To do this effectively, algorithms that perform component health management, fault detection, isolation, and accommodation, and continuous optimization, must be developed, tested, validated, and implemented. This paper describes a piloted evaluation of such an algorithm in scenarios with multiple fan failures, performed in a flight simulator, demonstrating failure recovery and continued safe operation up to the limits of the powertrain. These scenarios are subsequently related to certification requirements.

Electrified Aircraft Propulsion

Piloted Evaluation of a Fault Recovery System for an Aircraft with Distributed Electric Propulsion

Electrified aircraft powertrains contain multiple tightly coupled subsystems, making them much more complex than traditional aircraft propulsion systems, both in terms of integration and control. Electrification enables aircraft to have multiple distributed thrust-producing fans that the flight control system can utilize for enhanced maneuverability, further increasing the control complexity. The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept aircraft that leverages this technology. SUSAN is a series/parallel partial hybrid electric single-aisle transport aircraft that takes advantage of its electrified powertrain to provide fuel burn and emissions benefits when compared to the state-of-the-art. Achieving these benefits requires an appropriately designed control architecture that coordinates the various powertrain and flight control subsystems. As such, the SUSAN aircraft is designed with a high level of automation, allowing it to properly manage coupled subsystems and react rapidly to failures and anomalies. To do this effectively, algorithms that perform component health management, fault detection, isolation, and accommodation, and continuous optimization, must be developed, tested, validated, and implemented. This paper describes a piloted evaluation of such an algorithm in scenarios with multiple fan failures, performed in a flight simulator, demonstrating failure recovery and continued safe operation up to the limits of the powertrain. These scenarios are subsequently related to certification requirements.

Electrified Aircraft Propulsion

Combinatorial Multiobjective Optimization Using Genetic Algorithms

The research proposed in this document investigated multiobjective optimization approaches based upon the Genetic Algorithm (GA). Several versions of the GA have been adopted for multiobjective design, but, prior to this research, there had not been significant comparisons of the most popular strategies. The research effort first generalized the two-branch tournament genetic algorithm in to an N-branch genetic algorithm, then the N-branch GA was compared with a version of the popular Multi-Objective Genetic Algorithm (MOGA). Because the genetic algorithm is well suited to combinatorial (mixed discrete / continuous) optimization problems, the GA can be used in the conceptual phase of design to combine selection (discrete variable) and sizing (continuous variable) tasks. Using a multiobjective formulation for the design of a 50-passenger aircraft to meet the competing objectives of minimizing takeoff gross weight and minimizing trip time, the GA generated a range of tradeoff designs that illustrate which aircraft features change from a low-weight, slow trip-time aircraft design to a heavy-weight, short trip-time aircraft design. Given the objective formulation and analysis methods used, the results of this study identify where turboprop-powered aircraft and turbofan-powered aircraft become more desirable for the 50 seat passenger application. This aircraft design application also begins to suggest how a combinatorial multiobjective optimization technique could be used to assist in the design of morphing aircraft.

Crossley, William A.

Bell-Curve Based Evolutionary Strategies for Structural Optimization

Evolutionary methods are exceedingly popular with practitioners of many fields; more so than perhaps any optimization tool in existence. Historically Genetic Algorithms (GAs) led the way in practitioner popularity. However, in the last ten years Evolutionary Strategies (ESs) and Evolutionary Programs (EPS) have gained a significant foothold. One partial explanation for this shift is the interest in using GAs to solve continuous optimization problems. The typical GA relies upon a cumbersome binary representation of the design variables. An ES or EP, however, works directly with the real-valued design variables. For detailed references on evolutionary methods in general and ES or EP in specific see Back and Dasgupta and Michalesicz. We call our evolutionary algorithm BCB (bell curve based) since it is based upon two normal distributions.

Kincaid, Rex K.

Discrete versus continuous: Enhancing battery optimization in capacity expansion models

This study compares two battery modeling approaches for capacity expansion models: discrete-duration and continuous-duration formulations. In the discrete approach, battery duration is fixed, and power capacity is optimized. In the continuous approach, both power and energy capacities are decision variables, allowing storage duration to be optimized endogenously. Although both discrete-duration and continuous-duration battery formulations are used in long-term power system planning models, the literature has provided limited direct, systematic comparisons of their implications within a common modeling framework. To address this gap, this study implements both approaches in the Regional Energy Deployment System (ReEDS TM ) capacity expansion model using two resource adequacy methods, across a range of future system conditions, and with varying battery cost projections. Results show continuous-duration and high-resolution discrete approaches produce similar capacity expansion outcomes. The continuous formulation achieves faster runtimes compared to discrete-duration runs with many discrete-duration options. However, the discrete-duration approach allows users to choose to have limited fidelity for storage duration options, which in some cases can outperform the continuous formulation. The continuous formulation has the lowest overall system costs, indicating its ability to fine-tune storage duration to better meet specific system needs. This study's findings provide a side-by-side evaluation of discrete and continuous battery modeling approaches and offer guidance for improving the representation of real-world systems, flexibility, and computational efficiency for representing energy storage in long-term power system planning models.

25 ENERGY STORAGE

Mixed Integer Programming and Heuristic Scheduling for Space Communication

Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

Lee, Charles H.

Bell-Curve Based Evolutionary Strategies for Structural Optimization

Evolutionary methods are exceedingly popular with practitioners of many fields; more so than perhaps any optimization tool in existence. Historically Genetic Algorithms (GAs) led the way in practitioner popularity (Reeves 1997). However, in the last ten years Evolutionary Strategies (ESs) and Evolutionary Programs (EPS) have gained a significant foothold (Glover 1998). One partial explanation for this shift is the interest in using GAs to solve continuous optimization problems. The typical GA relies upon a cumber-some binary representation of the design variables. An ES or EP, however, works directly with the real-valued design variables. For detailed references on evolutionary methods in general and ES or EP in specific see Back (1996) and Dasgupta and Michalesicz (1997). We call our evolutionary algorithm BCB (bell curve based) since it is based upon two normal distributions.

Kincaid, Rex K.