Search NASA⌕ Search

SEARCH · Search NASA

Results for “Nonlinear 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 685 records · Page 38

Connected Vehicle-Based Traffic Signal Coordination

This study presents a connected vehicles (CVs)-based traffic signal optimization framework for a coordinated arterial corridor. The signal optimization and coordination problem are first formulated in a centralized scheme as a mixed-integer nonlinear program (MINLP). The optimal phase durations and offsets are solved together by minimizing fuel consumption and travel time considering an individual vehicle’s trajectories. Due to the complexity of the model, we decompose the problem into two levels: an intersection level to optimize phase durations using dynamic programming (DP), and a corridor level to optimize the offsets of all intersections. In order to solve the two-level model, a prediction-based solution technique is developed. The proposed models are tested using traffic simulation under various scenarios. Compared with the traditional actuated signal timing and coordination plan, the signal timing plans generated by solving the MINLP and the two-level model can reasonably improve the signal control performance. When considering varies vehicle types under high demand levels, the proposed two-level model reduced the total system cost by 3.8% comparing to baseline actuated plan. MINLP reduced the system cost by 5.9%. It also suggested that coordination scheme was beneficial to corridors with relatively high demand levels. For intersections with major and minor street, coordination conducted for major street had little impacts on the vehicles at the minor street.

42 ENGINEERING↗

Estimation of the domain of attraction

Approaches used in estimating domain of attraction of equilibrium solution to system of nonlinear autonomous differential equation, and optimal selection of Liapunov function

LIAPUNOV FUNCTION↗

Motion Cueing Algorithm Development: Piloted Performance Testing of the Cueing Algorithms

The relative effectiveness in simulating aircraft maneuvers with both current and newly developed motion cueing algorithms was assessed with an eleven-subject piloted performance evaluation conducted on the NASA Langley Visual Motion Simulator (VMS). In addition to the current NASA adaptive algorithm, two new cueing algorithms were evaluated: the optimal algorithm and the nonlinear algorithm. The test maneuvers included a straight-in approach with a rotating wind vector, an offset approach with severe turbulence and an on/off lateral gust that occurs as the aircraft approaches the runway threshold, and a takeoff both with and without engine failure after liftoff. The maneuvers were executed with each cueing algorithm with added visual display delay conditions ranging from zero to 200 msec. Two methods, the quasi-objective NASA Task Load Index (TLX), and power spectral density analysis of pilot control, were used to assess pilot workload. Piloted performance parameters for the approach maneuvers, the vertical velocity upon touchdown and the runway touchdown position, were also analyzed but did not show any noticeable difference among the cueing algorithms. TLX analysis reveals, in most cases, less workload and variation among pilots with the nonlinear algorithm. Control input analysis shows pilot-induced oscillations on a straight-in approach were less prevalent compared to the optimal algorithm. The augmented turbulence cues increased workload on an offset approach that the pilots deemed more realistic compared to the NASA adaptive algorithm. The takeoff with engine failure showed the least roll activity for the nonlinear algorithm, with the least rudder pedal activity for the optimal algorithm.

Houck, Jacob A.↗

Introduction to Mixed Variable Optimization (MVO) [Slides]

Mixed Variable Optimization (MVO) is an optimization method that uses discrete (categorical) and continuous variables in its optimization process. This method of optimization is applicable to highly nonlinear problems where the information used in the optimization is of poor quality of has minor inaccuracies in the data sets.

97 MATHEMATICS AND COMPUTING↗

A Planning Problem Combining Calculus of Variations and Optimal Transport

We consider some variants of the classical optimal transport where not only one optimizes over couplings between some variables x and y but also over some control variables governing the evolutions of these variables with time. Such a situation is motivated by an assignment problem of tasks with workers whose characteristics can evolve with time (and be controlled). We distinguish between the coupled and decoupled case. The coupled case is a standard optimal transport with the value of some optimal control problem as cost. The decoupled case is more involved since it is nonlinear in the transport plan.

97 MATHEMATICS AND COMPUTING↗

An Efficient Parallel-in-Time Method for Optimization with Parabolic PDEs

To solve optimization problems with parabolic PDE constraints, often methods working on the reduced objective functional are used. They are computationally expensive due to the necessity of solving both the state equation and a backward-in-time adjoint equation to evaluate the reduced gradient in each iteration of the optimization method. In this study, we investigate the use of the parallel-in-time method PFASST in the setting of PDE-constrained optimization. In order to develop an efficient fully time-parallel algorithm, we discuss different options for applying PFASST to adjoint gradient computation, including the possibility of doing PFASST iterations on both the state and the adjoint equations simultaneously. Here, we also explore the additional gains in efficiency from reusing information from previous optimization iterations when solving each equation. Numerical results for both a linear and a nonlinear reaction-diffusion optimal control problem demonstrate the parallel speedup and efficiency of different approaches.

97 MATHEMATICS AND COMPUTING↗

Optimal inference with chaotic dynamics

Nonlinear mappings that exhibit chaotic, seemingly random, evolution have appeal as models of dynamic systems. Their deterministic evolution, vis-a-vis Markov evolutions, results in much simpler optimal detection and estimation algorithms. The variation of a chaotic parameter (mu) results in diverse evolutions, suggesting a simple but rich source of model variations. For the specific mapping examined, this latter possibility is problematic due to the extreme sensitivity on mu of the evolution in the chaotic regime.

Harger, R. O.↗

Optimized design of a hypersonic nozzle

Conventional procedures for designing nozzles involve the design of an inviscid contour (using the method of characteristics) that is corrected with a displacement thickness calculated from boundary-layer theory. However, nozzles designed using this classical procedure have been shown to exhibit poor flow quality at Mach numbers characteristic of hypersonic applications. The nozzle to be designed will be a part of the NASA HYPULSE facility which is being used for hypervelocity flight research. Thus, the flow quality of the nozzle is a critical question that needs to be addressed. Design of nozzles for hypersonic applications requires a proper assessment of the effects of the thick boundary layer on the inviscid flowfield. Since the flow field is largely supersonic, the parabolized form of the Navier-Stokes (PNS) equations can be used. The requirement of a uniform flow at the exit plane of the nozzle can be used to define an objective function as part of an optimization procedure. The design procedure used in this study involves the coupling of a nonlinear (least-squares) optimization algorithm with an efficient, explicit PNS solver. The thick boundary layers growing on the walls of the nozzle limit the extent of the usable core region (region with uniform flow) for testing models (especially rectangular). In order to maximize the region of uniform flow, it was decided to have the exit plane of this nozzle to be (nearly) rectangular. Thus, an additional constraint on the nozzle shape resulted, namely the nozzle will have a shape transitioning from a circular one at the inlet to that of a rectangle at the exit. In order to provide for a smooth shape transition, the cross sectional contour of the nozzle is defined by a superellipse. The nozzle is taken to be a meter in length. The axial variations of the major and minor radii of the superellipse are governed by cubic splines. The design parameters are the coefficients of the splines associated with the local nozzle wall slopes. Extensive calculations have been made (with a three-dimensional Euler code) to understand the effects of various parameters such as location of the knot points of the spline function, different ways of characterizing the uniformity of the flow in the exit plane, as well as the effect of constraining the area of the nozzle to be invariant. Turbulent flow (measurements indicate that the flow at the nozzle inlet is turbulent) calculations are now being performed (with the inviscidly designed nozzle contours) to assess the flow quality.

Krishnamurthy, Ramesh↗

Double Emittance Exchanger as a Bunch Compressor for the MaRIE XFEL electron beam line at 1GeV

We demonstrate an alternative realization of a bunch compressor (specifically the second bunch compressor for the MaRIE XFEL beamline, 1GeV electron energy) using a double emittance exchanger (EEX) and a telescope in the transverse phase space.We compare our results with a traditional bunch compressor realized via chicane, taking into account the nonlinear dynamics, Coherent Synchrotron Radiation (CSR) and Space Charge (SC) effects. In particular, we use the Elegant code for tracking particles through the beam line and analyze the eigen-emittances evolution to separate the influence of the CSR/SC effects from the nonlinear dynamics effects. We optimize the scheme parameters to reach a desirable compression factor and minimize the emittance growth. We observe dominant CSR-effects in our scheme resulting in critical emittance growth and introduce alternative version of an emittance exchanger with a reduced number of bending magnets to minimize the impact of CSR effects.

43 PARTICLE ACCELERATORS↗

The Sizing and Optimization Language (SOL): A computer language to improve the user/optimizer interface

The nonlinear mathematical programming method (formal optimization) has had many applications in engineering design. A figure illustrates the use of optimization techniques in the design process. The design process begins with the design problem, such as the classic example of the two-bar truss designed for minimum weight as seen in the leftmost part of the figure. If formal optimization is to be applied, the design problem must be recast in the form of an optimization problem consisting of an objective function, design variables, and constraint function relations. The middle part of the figure shows the two-bar truss design posed as an optimization problem. The total truss weight is the objective function, the tube diameter and truss height are design variables, with stress and Euler buckling considered as constraint function relations. Lastly, the designer develops or obtains analysis software containing a mathematical model of the object being optimized, and then interfaces the analysis routine with existing optimization software such as CONMIN, ADS, or NPSOL. This final state of software development can be both tedious and error-prone. The Sizing and Optimization Language (SOL), a special-purpose computer language whose goal is to make the software implementation phase of optimum design easier and less error-prone, is presented.

Lucas, S. H.↗

Study of Integrable and Quasi-Integrable Sextupole Lattice

In order to maximize beam lifetime in circular particle accelerators, the nonlinear beam optics are optimized to maximize the dynamic aperture of the beam. The dynamic aperture (DA), which is a 6-D phase space volume of stable trajectories, depends on the strength of the nonlinearities in the machine, and is calculated via particle tracking. Current DA optimization processes include multi-objective genetic algorithm optimizers, and relies on minimizing the magnitudes of resonance driving terms (RDT), which are calculated from the nonlinear contribution to the one-turn-map. The process of searching through the parameter space for an ideal combination that maximizes DA is computationally strenuous. By setting up the sextupole channel such that it is resembles a symplectic integrator of a smooth Hamiltonian, with only a few sextupoles we are able to closely reproduce phase space trajectories of a smooth Hamiltonian up to the hyperbolic point. No chaos and resonances are observed if phase advance per one sextupole magnet in the channel does not exceed ~0.12x2 pi. Therefore, an important property of the suggested approach is the intrinsic elimination of the resonances, and minimization of corresponding RDTs.

43 PARTICLE ACCELERATORS↗

Joint analysis of Dark Energy Survey Year 3 data and CMB lensing from SPT and P l a n c k . II. Cross-correlation measurements and cosmological constraints

Cross-correlations of galaxy positions and galaxy shears with maps of gravitational lensing of the cosmic microwave background (CMB) are sensitive to the distribution of large-scale structure in the Universe. Such cross-correlations are also expected to be immune to some of the systematic effects that complicate correlation measurements internal to galaxy surveys. We present measurements and modeling of the cross-correlations between galaxy positions and galaxy lensing measured in the first three years of data from the Dark Energy Survey with CMB lensing maps derived from a combination of data from the 2500 deg 2 SPT-SZ survey conducted with the South Pole Telescope and full-sky data from the Planck satellite. The CMB lensing maps used in this analysis have been constructed in a way that minimizes biases from the thermal Sunyaev Zel’dovich effect, making them well suited for cross-correlation studies. The total signal-to-noise of the cross-correlation measurements is 23.9 (25.7) when using a choice of angular scales optimized for a linear (nonlinear) galaxy bias model. Here we use the cross-correlation measurements to obtain constraints on cosmological parameters. For our fiducial galaxy sample, which consist of four bins of magnitude-selected galaxies, we find constraints of Ω m =0.272$^{+0.032}_{-0.052}$ and S 8 ≡σ8$\sqrt{Ω_m/0.3}$=0.736$^{+0.032}_{-0.028}$ (Ω m =0.245$^{+0.026}_{-0.044}$ and S 8 =0.734$^{+0.035}_{-0.028}$) when assuming linear (nonlinear) galaxy bias in our modeling. Considering only the cross-correlation of galaxy shear with CMB lensing, we find Ω m =0.270$^{+0.043}_{-0.061}$ and S 8 =0.740$^{+0.034}_{-0.029}$. Our constraints on S8 are consistent with recent cosmic shear measurements, but lower than the values preferred by primary CMB measurements from Planck.

79 ASTRONOMY AND ASTROPHYSICS↗

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Motion Cueing Algorithm Development: Human-Centered Linear and Nonlinear Approaches

While the performance of flight simulator motion system hardware has advanced substantially, the development of the motion cueing algorithm, the software that transforms simulated aircraft dynamics into realizable motion commands, has not kept pace. Prior research identified viable features from two algorithms: the nonlinear "adaptive algorithm", and the "optimal algorithm" that incorporates human vestibular models. A novel approach to motion cueing, the "nonlinear algorithm" is introduced that combines features from both approaches. This algorithm is formulated by optimal control, and incorporates a new integrated perception model that includes both visual and vestibular sensation and the interaction between the stimuli. Using a time-varying control law, the matrix Riccati equation is updated in real time by a neurocomputing approach. Preliminary pilot testing resulted in the optimal algorithm incorporating a new otolith model, producing improved motion cues. The nonlinear algorithm vertical mode produced a motion cue with a time-varying washout, sustaining small cues for longer durations and washing out large cues more quickly compared to the optimal algorithm. The inclusion of the integrated perception model improved the responses to longitudinal and lateral cues. False cues observed with the NASA adaptive algorithm were absent. The neurocomputing approach was crucial in that the number of presentations of an input vector could be reduced to meet the real time requirement without degrading the quality of the motion cues.

Houck, Jacob A.↗

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous- enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗