Search NASA⌕ Search

SEARCH · Search NASA

Results for “sequential linear programming”

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 73 records · Page 4

Pseudospectral convex optimization for on-ramp merging control of connected vehicles

It can be a daunting task for human drivers to merge into highways because of the intricate vehicle negotiations and potential risk within limited time and space. Connected vehicle (CV) technologies could be a solution to this problem and offer many benefits to the road safety, traffic mobility, and energy efficiency. However, real-time optimal control of CVs is still an open challenge, due to the nonlinear vehicle dynamics, non-convex fuel consumption model, and highly dynamic uncertain inter-vehicle interactions. To tackle these issues, a novel real-time optimal control approach that balances the computational efficiency and solution optimality is proposed for the purpose of onboard application. To this end, the pseudospectral collocation method is integrated with a sequential convex programming approach to develop two new optimization algorithms, which are implemented within a model predictive control (MPC) framework to allow for real-time generation of optimal merging speed profiles. One algorithm leverages the line search technique to improve convergence, and the other benefits from the trust region method for better computational efficiency. The optimality and convergence process of both proposed algorithms are investigated by comparing their solutions with a popular non-linear solver. Furthermore, simulation results show that the proposed methods outperform the benchmark in terms of computational cost, fuel consumption, and traffic efficiency. In particular, the proposed fuel-economy merging rule can save 57.1% fuel consumption on average on four different traffic volumes. Meanwhile, the proposed optimal control algorithms can reduce 2.2% travel time on average comparing to the “first-in-first-out” merging rule.

33 ADVANCED PROPULSION SYSTEMS↗

Optimal Power Flow of Radial Networks and Its Variations: A Sequential Convex Optimization Approach

This paper proposes a sequential convex optimization method to solve broader classes of optimal power flow (OPF) problems over radial networks. The non-convex branch power flow equation is decomposed as a second-order cone inequality and a non-convex constraint involving the difference of two convex functions. Provided with an initial solution offered by an inexact second-order cone programming relaxation model, this approach solves a sequence of convexified penalization problems, where concave terms are approximated by linear functions and updated in each iteration. It could recover a feasible power flow solution, which usually appears to be very close, if not equal, to the global optimal one. Two variations of the OPF problem, in which non-cost related objectives are optimized subject to power flow constraints and the convex relaxation is generally inexact, are elaborated in detail. One is the maximum loadability problem, which is formulated as a special OPF problem that seeks the maximal distance to the boundary of power flow insolvability. The proposed method is shown to outperform commercial nonlinear solvers in terms of robustness and efficiency. The other is the bi-objective OPF problem. A non-parametric scalarization model is suggested, and is further reformulated as an extended OPF problem by convexifying the objective function. It provides a single trade-off solution without any subjective preference. The proposed computation framework also helps retrieve the Pareto front of the bi-objective OPF via the e-constraint method or the normal boundary intersection method. This paper also discusses extensions for OPF problems over meshed networks based on the semidefinite programming relaxation method.

bi-objective optimization↗

Engine With Regression and Neural Network Approximators Designed

At the NASA Glenn Research Center, the NASA engine performance program (NEPP, ref. 1) and the design optimization testbed COMETBOARDS (ref. 2) with regression and neural network analysis-approximators have been coupled to obtain a preliminary engine design methodology. The solution to a high-bypass-ratio subsonic waverotor-topped turbofan engine, which is shown in the preceding figure, was obtained by the simulation depicted in the following figure. This engine is made of 16 components mounted on two shafts with 21 flow stations. The engine is designed for a flight envelope with 47 operating points. The design optimization utilized both neural network and regression approximations, along with the cascade strategy (ref. 3). The cascade used three algorithms in sequence: the method of feasible directions, the sequence of unconstrained minimizations technique, and sequential quadratic programming. The normalized optimum thrusts obtained by the three methods are shown in the following figure: the cascade algorithm with regression approximation is represented by a triangle, a circle is shown for the neural network solution, and a solid line indicates original NEPP results. The solutions obtained from both approximate methods lie within one standard deviation of the benchmark solution for each operating point. The simulation improved the maximum thrust by 5 percent. The performance of the linear regression and neural network methods as alternate engine analyzers was found to be satisfactory for the analysis and operation optimization of air-breathing propulsion engines (ref. 4).

Patnaik, Surya N.↗

Binary tree eigen solver in finite element analysis

This paper presents a transputer-based binary tree eigensolver for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on the method of recursive doubling, which parallel implementation of a number of associative operations on an arbitrary set having N elements is of the order of o(log2N), compared to (N-1) steps if implemented sequentially. The hardware used in the implementation of the binary tree consists of 32 transputers. The algorithm is written in OCCAM which is a high-level language developed with the transputers to address parallel programming constructs and to provide the communications between processors. The algorithm can be replicated to match the size of the binary tree transputer network. Parallel and sequential finite element analysis programs have been developed to solve for the set of the least-order eigenpairs using the modified subspace method. The speed-up obtained for a typical analysis problem indicates close agreement with the theoretical prediction given by the method of recursive doubling.

Akl, F. A.↗

Stacking sequence optimization of simply supported laminates with stability and strain constraints

An integer programming formulation for the design of symmetric and balanced rectangular composite laminates with simply supported boundary conditions subject to buckling and strain constraints is presented. The design variables that define the stacking sequence of the laminate are ply-identity zero-one integers. The buckling constraint is linear in terms of the ply-identity design variables, but strains are nonlinear functions of these variables. A linear approximation is developed for the strain constraints so that the problem can be solved by sequential linearization using the branch and bound algorithm. Examples of graphite-epoxy plates under biaxial compression are presented. Optimum stacking sequences obtained using the linear approximation are compared with global optimum designs obtained using a genetic search procedure.

Nagendra, S.↗

Optical and probe determination of soot concentrations in a model gas turbine combustor

An experimental program was conducted to track the variation in soot loading in a generic gas turbine combustor. The burner is a 12.7-cm dia cylindrical device consisting of six sheet-metal louvers. Determination of soot loading along the burner length is achieved by measurement at the exit of the combustor and then at upstream stations by sequential removal of liner louvers to shorten burner length. Alteration of the flow field approaching and within the shortened burners is minimized by bypassing flow in order to maintain a constant linear pressure drop. The burner exhaust flow is sampled at the burner centerline to determine soot mass concentration and smoke number. Characteristic particle size and number density, transmissivity of the exhaust flow, and local radiation from luminous soot particles in the exhaust are determined by optical techniques. Four test fuels are burned at three fuel-air ratios to determine fuel chemical property and flow temperature influences. Particulate concentration data indicate a strong oxidation mechanism in the combustor secondary zone, though the oxidation is significantly affected by flow temperature. Soot production is directly related to fuel smoke point.

Eckerle, W. A.↗

Two-dimensional inverse planning and delivery with a preclinical image guided microirradiator

Purpose: Recent advances in preclinical radiotherapy systems have provided the foundation for scaling many of the elements of clinical radiation therapy practice to the dimensions and energy demanded in small animal studies. Such systems support the technical capabilities to accurately deliver highly complex dose distributions, but methods to optimize and deliver such distributions remain in their infancy. This study developed an optimization method based on empirically measured two-dimensional dose kernel measurements to deliver arbitrary planar dose distributions on a recently developed small animal radiotherapy platform.Methods: A two-dimensional dose kernel was measured with repeated radiochromic film measurements for the circular 1 mm diameter fixed collimator of the small animal radiotherapy system at 1 cm depth in a solid water phantom. This kernel was utilized in a sequential quadratic programming optimization framework to determine optimal beam positions and weights to deliver an arbitrary desired dose distribution. The positions and weights were then translated to a set of stage motions to automatically deliver the optimized dose distribution. End-to-end efficacy of the framework was quantified through five repeated deliveries of two dosimetric challenges: (1) a 5 mm radius bullseye distribution, and (2) a “sock” distribution contained within a 9 × 13 mm bounding box incorporating rectangular, semicircular, and exponentially decaying geometric constructs and a rectangular linear dose gradient region. These two challenges were designed to gauge targeting, geometric, and dosimetric fidelity.Results: Optimization of the bullseye and sock distributions required 2.1 and 5.9 min and utilized 50 and 77 individual beams for delivery, respectively. Automated delivery of the resulting optimized distributions, validated using radiochromic film measurements, revealed an average targeting accuracy of 0.32 mm, and a dosimetric delivery error along four line profiles taken through the sock distribution of 3.9%. Mean absolute delivery error across the 0–1 Gy linear dose gradient over 7.5 mm was 0.01 Gy.Conclusions: The work presented here demonstrates the potential for complex dose distributions to be planned and automatically delivered with millimeter scale heterogeneity at submillimeter accuracy. This capability establishes the technical foundation for preclinical validation of biologically guided radiotherapy investigations and development of unique radiobiological experiments.

61 RADIATION PROTECTION AND DOSIMETRY↗

Sequential Service Restoration for Unbalanced Distribution Systems and Microgrids

The resilience and reliability of modern power systems are threatened by increasingly severe weather events and cyber-physical security events. An effective restoration methodology is desired to optimally integrate emerging smart grid technologies and pave the way for developing self-healing smart grids. In this paper, a sequential service restoration (SSR) framework is proposed to generate restoration solutions for distribution systems and microgrids in the event of large-scale power outages. The restoration solution contains a sequence of control actions that properly coordinate switches, distributed generators, and switchable loads to form multiple isolated microgrids. The SSR can be applied for three-phase unbalanced distribution systems and microgrids and can adapt to various operation conditions. Mathematical models are introduced for three-phase unbalanced power flow, voltage regulators, transformers, and loads. Furthermore, the SSR problem is formulated as a mixed-integer linear programming model, and its effectiveness is evaluated via the modified IEEE 123 node test feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NEUTRON-IRRADIATION–INDUCED DAMAGE ASSESSMENT IN CONCRETE USING COMBINED PHASE CHARACTERIZATION AND NONLINEAR FAST FOURIER TRANSFORM SIMULATION

Understanding irradiation effects in concrete cavities of light water reactors is critical to the long-term operation (60+ years) of US nuclear power plants. Susceptibility of concrete to neutron irradiation greatly varies as a function of its constituents: coarse aggregates, sand, and hardened cement paste (hcp). In particular, higher irradiation–susceptibility of aggregates was found to be a direct function of radiation-induced volumetric expansion (RIVE), or the propensity of aggregates to swell as a function of mineral contents, structures and textures. Irradiation-induced amorphization is accompanied by significant swelling, especially in silicates. For example, the maximum volumetric expansions of quartz and feldspars have been shown to be as large as ≈ 18% and ≈ 8%, respectively, while the change of density in calcite remains rather low (≈ 0.3–0.5%). High swelling is associated with a high number of covalent bonds (Si–O) and a high degree of polymerization of [SiO4] tetrahedrons. Differential RIVEs between rock-forming minerals cause high stresses and may potentially develop cracking within the aggregates at the interface between aggregates and the hcp and within the hcp. Modeling neutron-irradiation effects in concrete requires addressing the problem at a scale that captures both the details of the aggregates’ mineralogy and texture, which is <~ 100 μm, and the representative size of concrete, which is ~ 10 cm. This requires high-resolution, large mapping capabilities. To this end, the US Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) Program developed an original tool suite called Microstructure Oriented Scientific Analysis of Irradiated Concrete (MOSAIC) in which Nonlinear 2D-fast Fourier transform (FFT) techniques are employed to model mechanical or irradiation-induced cracking of high-resolution complex microstructures derived from combined mapping techniques, including micro x-ray fluorescence (m-XRF), energy-dispersive x-ray spectroscopy (EDS), electron backscatter diffraction (EBSD), ellipsometry, and scanning electron microscopy (SEM). Irradiated mineral properties are derived from the Irradiated Minerals, Aggregate and Concrete (IMAC) database, which includes available relevant literature data. Rigorous coupled damage-creep simulations are obtained through sequential linear analysis. Illustrations of actual accelerated irradiation-damage propagation in a complex microstructures are presented herein.

Le Pape, Yann↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (control-lable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources: Preprint

Integration of a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problem requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs) including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperformed other benchmark controllers regarding computation time without compromising operational performance.

DER↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗

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.↗

Software for Checking Statecharts

HiVy is a software tool set that enables verification through model checking of designs represented as finite-state machines or statecharts. HiVy provides automated translation of (1) statecharts created by use of the MathWorks Stateflow program to (2) Promela, the input language of the Spin model checker, which can then be used to verify, or trace logical errors in, distributed software systems. HiVy can operate directly on Stateflow models, or its abstract syntax of hierarchical sequential automata (HSA) can be used independently as an intermediate format for translation to Promela. In a typical design application, HiVy parses and reformats Stateflow model file data using the programs SfParse and sf2hsa, respectively. If the parsing effort is successful, an abstract syntax tree is delivered into a file named with the extension .hsa. If the design comprises several model files, they may be merged into one .hsa file before translation into Promela. Stateflow scope is preserved, and name clashes are avoided in the merge process. The HiVy program hsa2pr translates the model from the intermediate HSA format into Promela. Additionally, HiVy provides through translation a list of all statechart model propositions that are the means for formalizing linear temporal logic (LTL) properties about the model for Spin verification.

Pingree, Paula↗

Heterogenous Acceleration for Linear Algebra in Multi-coprocessor Environments

We present an efficient and scalable programming model for the development of linear algebra in heterogeneous multi-coprocessor environments. The model incorporates some of the current best design and implementation practices for the heterogeneous acceleration of dense linear algebra (DLA). Examples are given as the basis for solving linear systems' algorithms - the LU, QR, and Cholesky factorizations. To generate the extreme level of parallelism needed for the efficient use of coprocessors, algorithms of interest are redesigned and then split into well-chosen computational tasks. The tasks execution is scheduled over the computational components of a hybrid system of multi-core CPUs and coprocessors using a light-weight runtime system. The use of lightweight runtime systems keeps scheduling overhead low, while enabling the expression of parallelism through otherwise sequential code. This simplifies the development efforts and allows the exploration of the unique strengths of the various hardware components.

Luszczek, Piotr R↗

DCS-Neural-Network Program for Aircraft Control and Testing

A computer program implements a dynamic-cell-structure (DCS) artificial neural network that can perform such tasks as learning selected aerodynamic characteristics of an airplane from wind-tunnel test data and computing real-time stability and control derivatives of the airplane for use in feedback linearized control. A DCS neural network is one of several types of neural networks that can incorporate additional nodes in order to rapidly learn increasingly complex relationships between inputs and outputs. In the DCS neural network implemented by the present program, the insertion of nodes is based on accumulated error. A competitive Hebbian learning rule (a supervised-learning rule in which connection weights are adjusted to minimize differences between actual and desired outputs for training examples) is used. A Kohonen-style learning rule (derived from a relatively simple training algorithm, implements a Delaunay triangulation layout of neurons) is used to adjust node positions during training. Neighborhood topology determines which nodes are used to estimate new values. The network learns, starting with two nodes, and adds new nodes sequentially in locations chosen to maximize reductions in global error. At any given time during learning, the error becomes homogeneously distributed over all nodes.

Jorgensen, Charles C.↗

Inverse sequential procedures for the monitoring of time series

Climate changes traditionally have been detected from long series of observations and long after they happened. The 'inverse sequential' monitoring procedure is designed to detect changes as soon as they occur. Frequency distribution parameters are estimated both from the most recent existing set of observations and from the same set augmented by 1,2,...j new observations. Individual-value probability products ('likelihoods') are then calculated which yield probabilities for erroneously accepting the existing parameter(s) as valid for the augmented data set and vice versa. A parameter change is signaled when these probabilities (or a more convenient and robust compound 'no change' probability) show a progressive decrease. New parameters are then estimated from the new observations alone to restart the procedure. The detailed algebra is developed and tested for Gaussian means and variances, Poisson and chi-square means, and linear or exponential trends; a comprehensive and interactive Fortran program is provided in the appendix.

Radok, Uwe↗

PETSc/TAO Users Manual (Rev. 3.19)

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and opti mization that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started). PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than packages such as MATLAB or a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or lldb, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than “rolling them” yourself. For many tasks a package such as MATLAB is often the best tool; PETSc is not intended for the classes of problems for which effective MATLAB code can be written. There are several packages, built on PETSc, that may satisfy your needs without requiring directly using PETSc. We recommend reviewing these packages functionality before starting to code directly with PETSc. PETSc can be used to provide a “MPI parallel linear solver” in an otherwise sequential, or OpenMP parallel code. This approach cannot provide extremely large improvements in the application time by utilizing large numbers of MPI processes but can still improve the performance. Certainly all parts of a previously sequential code need not be parallelized but the matrix generation portion must be parallelized to expect true scalability to large numbers of MPI processes. See PCMPI for details on how to utilize the PETSc MPI linear solver server. Since PETSc is under continued development, small changes in usage and calling sequences of routines will occur. PETSc has been supported for twenty-five years; see mailing list information on our website for information on contacting support.

97 MATHEMATICS AND COMPUTING↗