Search NASA⌕ Search

SEARCH · Search NASA

Results for “Successive 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Enabling Efficient Sparse Computations using Linear Algebra Aware Compilers

This project developed the LAPIS compiler framework, built on the Multilevel Intermediate Representation (MLIR), to optimize sparse linear algebra operations and support performance portability across diverse architectures. The main innovation of LAPIS is the Kokkos dialect, which allows for lowering codes from a high productivity language to different architectures in an elegant way. The dialect also allows the conversion of lower-level MLIR code to C++ Kokkos code, facilitating the integration of scientific machine learning (SciML) models into applications. To extend LAPIS for distributed memory architectures, a new partition dialect was created to manage the distribution of sparse tensors and express communication patterns for sparse linear algebra operations. This dialect also supports the distributed execution of operators and includes algorithmic optimizations to minimize communication to improve performance. The project also demonstrates that MLIR can enable effective linear algebra-level optimizations, improving performance on different GPUs for both sparse and dense linear algebra kernels. Key applications of LAPIS include sparse linear algebra and graph kernels, TenSQL, a relational database management solution built on GraphBLAS, and the development of subgraph isomorphism and monomorphism kernels, showcasing performance portability. In summary, the LAPIS framework supports productivity, performance, portability, and distributed memory execution, while also enabling linear algebra-level optimizations that are challenging in traditional programming languages, with successful applications ranging from simple sparse linear algebra to complex graph kernels.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

Stochastic model of the NASA/MSFC ground facility for large space structures with uncertain parameters: The maximum entropy approach, part 2

A validated technology data base is being developed in the areas of control/structures interaction, deployment dynamics, and system performance for Large Space Structures (LSS). A Ground Facility (GF), in which the dynamics and control systems being considered for LSS applications can be verified, was designed and built. One of the important aspects of the GF is to verify the analytical model for the control system design. The procedure is to describe the control system mathematically as well as possible, then to perform tests on the control system, and finally to factor those results into the mathematical model. The reduction of the order of a higher order control plant was addressed. The computer program was improved for the maximum entropy principle adopted in Hyland's MEOP method. The program was tested against the testing problem. It resulted in a very close match. Two methods of model reduction were examined: Wilson's model reduction method and Hyland's optimal projection (OP) method. Design of a computer program for Hyland's OP method was attempted. Due to the difficulty encountered at the stage where a special matrix factorization technique is needed in order to obtain the required projection matrix, the program was successful up to the finding of the Linear Quadratic Gaussian solution but not beyond. Numerical results along with computer programs which employed ORACLS are presented.

Hsia, Wei Shen↗
DOE OSTI2022

Factors Affecting Override Behavior during Demand Flexibility from High-Resolution Smart Thermostat Data

In this study, we delineate key weather and demographic predictors of override behavior in residential buildings during connected thermostats demand response events. Anticipating and reducing overrides is critical to demand flexibility (DF) program success. We use high- dimensional fixed effects linear regression techniques on a large ecobee dataset for about 5,000 enrolled households in the United States. We identify critical weather (indoor and outdoor temperature), building (housing type), and occupant (previous DF overrides and previous DF event exposure) factors influencing the override patterns of customers during thermostat demand response. We also differentiate DF events by season to understand the different indoor and outdoor conditions that might influence seasonal override rates. We found significant differences in override rates between building types, with single-family semi-detached homes generally having the highest overrides. Having a history of overrides was additionally a critical factor in predicting occupant response to future DF events. Understanding these override differences is necessary for rural electric cooperatives and emerging DF programs without access to large DR historical data. Overall, we provide critical information on technical and local demographic characteristics that may be correlated to building type to influence strategies to reduce overrides and improve the adoption of DF technologies.

connected thermostats (CTs)↗
DOE OSTI2024

Heuristic solutions to the single depot electric vehicle scheduling problem with next day operability constraints

This study focuses on the single depot electric vehicle scheduling problem (SDEVSP) within the broader context of the vehicle scheduling problem (VSP). By developing an effective scheduling model using mixed-integer linear programming, we generate bus blocks that accommodate electric vehicles (EVs), ensuring successful completion of each block while considering recharging requirements between blocks and during off-hours. Next day operability constraints are also incorporated, allowing for seamless repetition of blocks on subsequent days. The SDEVSP is known to be computationally complex, deriving optimal solutions unattainable for large-scale problems within reasonable timeframes. To address this, we propose a two-step solution approach: first solving the single depot VSP, and then addressing the block chaining problem (BCP) using the blocks generated in the first step. The BCP focuses on optimizing block combinations to facilitate recharging between consecutive blocks, considering operational constraints. Further, a case study conducted reveals that nearly 100% electrification for Chicago, IL and Austin, TX transit buses is viable yet requires 1.6 EVs at 150-mile range per diesel vehicle.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS2016

Use of the NLP10x10 Sequential Quadratic Programming Algorithm To Solve Rotorcraft Hub Loads Minimisation Problems

Previous research and experimentation on the use of a non-linear programming constrained optimisation technique to define an optimal control vector for rotorcraft applications indicated that use of this methodology was feasible and desirable in many cases. In particular, use of non-linear programming methods that solve a sequence of related quadratic-programming sub-problems were used successfully to solve these problems. Accordingly, a licence for one of the latest versions of Professor Klaus Schittkowskis very successful Sequential Quadratic Programming NLPQLP software was obtained and used to experiment with and analyse typical optimisation problems of the type encountered in various rotorcraft wind tunnel and flight tests. This research resulted in the development of the general NLPQLP Computation System that could be used to solve problems of the type encountered in various rotorcraft applications where there is a linear dependence of the measurement vector on the control vector, and where equality andor inequality constraints might be imposed. This development was accomplished on a mainframe computer not part of actual wind tunnel andor flight-test experiment, but in a format which was transferable to wind tunnel lap-top computers. Emphasis was directed toward obtaining efficiency, robustness and speed in computation.The System was developed in support of the five-bladed SMART Rotor Active Flap Rotor Hub Loads analytical minimisation research. The design and development of the Computation System was tailored to address the particular requirements of the problem to minimise a performance metric function of measured hub load harmonic angular couple components by optimising the control vector harmonic flap angular couple components subject to constraints on the amplitudes of these control vector harmonic flap angular couple components. In addition, to facilitate real time wind tunnel experimentation, the ability to rapidly selectchange the particular hub load harmonic angular couple components andor the particular control vector harmonic angular couple components to be considered in the optimisation procedure was provided in the System. This capability allows the singling out of particular hub load frequencies andor particular flap angle frequencies to be analysed during testing operations. The System was used very successfully for the SMART Active Flap Rotor Hub minimisation problems considered in the study, the results of which were presented at the American Helicopter Society Fifth Decennial Aeromechanics Specialist Conference in January 2014. Excellent agreement between cases initiated with best guess starting estimates for the control vector elements and cases initiated with zero control vector starting element estimates resulted, indicating the robustness of the NLP10x10 algorithm.

Rotorcraft Hub Loads↗
NASA NTRS1986

Parallel scheduling of recursively defined arrays

A new method of automatic generation of concurrent programs which constructs arrays defined by sets of recursive equations is described. It is assumed that the time of computation of an array element is a linear combination of its indices, and integer programming is used to seek a succession of hyperplanes along which array elements can be computed concurrently. The method can be used to schedule equations involving variable length dependency vectors and mutually recursive arrays. Portions of the work reported here have been implemented in the PS automatic program generation system.

Myers, T. J.↗
DOE OSTI2024

Power Sharing-Based Framework for Allocating Automatic Generation Control in Distributed Energy Resources: Preprint

The recent proliferation of distributed energy resources (DERs) in the power network along with the retirement of conventional generators has made it challenging to regulate system frequency. In this paper, we present a centralized control framework to leverage the potential of DERs in the distribution network in provisioning secondary frequency control services to the grid. The proposed framework is based on network volt-watt sensitivity analysis and takes into account DER operational and network-imposed constraints to allocate the automatic generation control (AGC) request among the aggregated units. The proposed framework was implemented on the IEEE 8500-node test feeder and results were validated against a standard linear programming-based scheme. Numerical results indicate that the proposed framework can successfully utilize the available power production headroom of the network to meet the AGC request while maintaining nodal voltages within acceptable limits.

distributed energy resources↗
NASA NTRS1980

Geomagnetic field modeling by optimal recursive filtering

Five individual 5 year mini-batch geomagnetic models were generated and two computer programs were developed to process the models. The first program computes statistics (mean sigma, weighted sigma) on the changes in the first derivatives (linear terms) of the spherical harmonic coefficients between mini-batches. The program ran successfully. The statistics are intended for use in computing the state noise matrix required in the information filter. The second program is the information filter. Most subroutines used in the filter were tested, but the coefficient statistics must be analyzed before the filter is run.

Source record↗
NASA NTRS2009

A Mixed Integer Linear Program for Airport Departure Scheduling

Aircraft departing from an airport are subject to numerous constraints while scheduling departure times. These constraints include wake-separation constraints for successive departures, miles-in-trail separation for aircraft bound for the same departure fixes, and time-window or prioritization constraints for individual flights. Besides these, emissions as well as increased fuel consumption due to inefficient scheduling need to be included. Addressing all the above constraints in a single framework while allowing for resequencing of the aircraft using runway queues is critical to the implementation of the Next Generation Air Transport System (NextGen) concepts. Prior work on airport departure scheduling has addressed some of the above. However, existing methods use pre-determined runway queues, and schedule aircraft from these departure queues. The source of such pre-determined queues is not explicit, and could potentially be a subjective controller input. Determining runway queues and scheduling within the same framework would potentially result in better scheduling. This paper presents a mixed integer linear program (MILP) for the departure-scheduling problem. The program takes as input the incoming sequence of aircraft for departure from a runway, along with their earliest departure times and an optional prioritization scheme based on time-window of departure for each aircraft. The program then assigns these aircraft to the available departure queues and schedules departure times, explicitly considering wake separation and departure fix restrictions to minimize total delay for all aircraft. The approach is generalized and can be used in a variety of situations, and allows for aircraft prioritization based on operational as well as environmental considerations. We present the MILP in the paper, along with benefits over the first-come-first-serve (FCFS) scheme for numerous randomized problems based on real-world settings. The MILP results in substantially reduced delays as compared to FCFS, and the magnitude of the savings depends on the queue and departure fix structure. The MILP assumes deterministic aircraft arrival times at the runway queues. However, due to taxi time uncertainty, aircraft might arrive either earlier or later than these deterministic times. Thus, to incorporate this uncertainty, we present a method for using the MILP with "overlap discounted rolling planning horizon". The approach is based on valuing near-term decision results more than future ones. We develop a model of taxitime uncertainty based on real-world data, and then compare the baseline FCFS delays with delays using the above MILP in a simple rolling-horizon method and in the overlap discounted scheme.

Gupta, Gautam↗
NASA NTRS1982

Design trade-offs for a multispectral linear array (MLA) instrument

The NASA Landsat program with imagery produced by the Multispectral Scanner has been thoroughly successful. The second generation of Landsat is represented by the Thematic Mapper, while the MLA sensor belongs to a third generation. It is pointed out that the strength of the MLA concept emanates from the pushbroom image-formation approach, which offers some fundamental improvements over opto-mechanically scanned instruments. The increased dwell time of the MLA sensor can be employed to improve signal-to-noise, spectral resolution, and spatial resolution simultaneously. Problems regarding design tradeoffs are considered, taking into account instrument sizing, configuration tradeoffs, optical design tradeoffs, aspects of spectral separation and registration, and radiometric accuracy and calibration tradeoffs. A description is provided of the instrument concept to which the design tradeoffs have led.

Mika, A. M.↗
DOE OSTI2022

Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment

Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s

AC power flow↗
NASA NTRS1976

NASA-Ames three-dimensional potential flow analysis system (POTFAN) equation solver code (SOLN) version 1

A computer program known as SOLN was developed as an independent segment of the NASA-Ames three-dimensional potential flow analysis systems of linear algebraic equations. Methods used include: LU decomposition, Householder's method, a partitioning scheme, and a block successive relaxation method. Due to the independent modular nature of the program, it may be used by itself and not necessarily in conjunction with other segments of the POTFAN system.

Davis, J. E.↗
NASA NTRS1985

Design of suboptimal regulators for nonlinear systems

An optimal feedback control law is preferred for the regulation of a deterministic nonlinear system. In this paper, a practical, iterative design method leading to a sequence of suboptimal control laws with successively improved performance is presented. The design method requires the determination of an upper bound to the performance of each successive control law. This is obtained by solving a partial differential inequality by means of a linear programming technique. Robustness properties and the application of the design method to the control of a robot manipulator arm are also presented.

Balaram, J.↗
NASA NTRS2016

Use of the NLPQLP Sequential Quadratic Programming Algorithm to Solve Rotorcraft Aeromechanical Constrained Optimisation Problems

Optimization of the control vector, configuration and aerodynamic surface design potentially offers significant performance enhancement to rotorcraft systems. These analyses indicated that non-linear programming methods that solve a sequence of related quadratic-programming sub-problems could be used successfully to solve these problems. Accordingly, a license for one of the latest versions of Professor Schittkowski's very successful Sequential Quadratic Programming NLPQLP software was obtained and used to experiment and analyze typical optimization problems of the type encountered in various rotorcraft wind tunnel and flight tests. Emphasis was directed toward obtaining efficiency, robustness and speed in computation.

Use of the NLPQLP↗
NASA NTRS1976

Applications Study of Aero-Maneuvering Orbit-to-Orbit Shuttle (AMOOS), Executive Summary

Preliminary designs and the supporting analysis for both the Aeromaneuvering Orbit-to-Orbit Shuttle (AMOOS) and the Aeromaneuvering Recovery System (AMRS) are presented. The AMOOS design is shown to yield from twice to almost three times the high energy, round-trip payloads as a purely propulsive vehicle of the same weight. Typically AMOOS can perform a crew rotation mission to equatorial geosynchronous orbit in one space shuttle launch. The flight test program analysis modeled parameters such as maximum dynamic pressure, heating rates, guidance, stability and recovery. Two model flight schedules were developed, one consisting of four flights and the other of two flights. The former is considered a very low risk, high information return program whereas the latter is a minimal cost program consistent with reasonable data returns and chance of success. The AMOOS and AMRS guidance scheme developed using linear regulator theory proved a precise and accurate guidance scheme. Both it and a classical linear system's based scheme were evaluated using 65 simulated trajectories in which the position in the entry corridor and the atmospheric density were varied randomly.

White, J.↗
NASA NTRS2015

Ultimately Reliable Pyrotechnic Systems

This paper presents the methods by which NASA has designed, built, tested, and certified pyrotechnic devices for high reliability operation in extreme environments and illustrates the potential applications in the oil and gas industry. NASA's extremely successful application of pyrotechnics is built upon documented procedures and test methods that have been maintained and developed since the Apollo Program. Standards are managed and rigorously enforced for performance margins, redundancy, lot sampling, and personnel safety. The pyrotechnics utilized in spacecraft include such devices as small initiators and detonators with the power of a shotgun shell, detonating cord systems for explosive energy transfer across many feet, precision linear shaped charges for breaking structural membranes, and booster charges to actuate valves and pistons. NASA's pyrotechnics program is one of the more successful in the history of Human Spaceflight. No pyrotechnic device developed in accordance with NASA's Human Spaceflight standards has ever failed in flight use. NASA's pyrotechnic initiators work reliably in temperatures as low as -420 F. Each of the 135 Space Shuttle flights fired 102 of these initiators, some setting off multiple pyrotechnic devices, with never a failure. The recent landing on Mars of the Opportunity rover fired 174 of NASA's pyrotechnic initiators to complete the famous '7 minutes of terror.' Even after traveling through extreme radiation and thermal environments on the way to Mars, every one of them worked. These initiators have fired on the surface of Titan. NASA's design controls, procedures, and processes produce the most reliable pyrotechnics in the world. Application of pyrotechnics designed and procured in this manner could enable the energy industry's emergency equipment, such as shutoff valves and deep-sea blowout preventers, to be left in place for years in extreme environments and still be relied upon to function when needed, thus greatly enhancing safety and operational availability.

Scott, John H.↗
NASA NTRS2007

Safety Verification of a Fault Tolerant Reconfigurable Autonomous Goal-Based Robotic Control System

Fault tolerance and safety verification of control systems are essential for the success of autonomous robotic systems. A control architecture called Mission Data System (MDS), developed at the Jet Propulsion Laboratory, takes a goal-based control approach. In this paper, a method for converting goal network control programs into linear hybrid systems is developed. The linear hybrid system can then be verified for safety in the presence of failures using existing symbolic model checkers. An example task is simulated in MDS and successfully verified using HyTech, a symbolic model checking software for linear hybrid systems.

goal network↗