ARPA E GO Competition
A Nonlinear Programming SC-ACOPF Framework with Parallel Computing Capabilities
SEARCH · Search NASA
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.
A Nonlinear Programming SC-ACOPF Framework with Parallel Computing Capabilities
This paper proposes and implements a long-term deterministic capacity expansion model for the co-optimization of electric and natural gas infrastructures. It determines the required investments in generation units, transmission lines and pipelines for meeting future demands, while representing electricity and natural gas flows using DC Power Flow and Weymouth equations, respectively. A Mixed Integer Nonlinear Programming (MINLP) problem is developed, from which a linearized version is derived. A 26 node integrated gas-electric system for the Eastern Region of the United States is used to demonstrate the model’s capabilities. Results show that the model provides an accurate operational representation of the integrated system, and, therefore, enhances the expansion planning process.
Penetration of the power grid by renewable energy sources, distributed storage, and distributed generators is becoming increasingly common. Increased utilization of these distributed energy resources (DERs) has given rise to additional protection coordination concerns, particularly where they are utilized in an unbalanced manner or where loading among phases is unbalanced. Digital relays such as the SEL-751 (produced by Schweitzer Engineering Laboratories, Pullman, WA, USA) series have the capability of being set on a per-phase basis. This capability is underutilized in common practice. Additionally, in optimization algorithms for determining relay settings, the time-overcurrent characteristics (TOCs) of relays are generally not treated as variables and are assigned before running the optimization algorithm. In this paper, TOC options themselves are treated as discrete variables to be considered in the optimization algorithm. A mixed integer nonlinear programming problem (MINLP) is set up where the goal is to minimize relay operating times. A genetic algorithm (GA) approach is implemented in MATLAB where two cases are considered. In the first case, the TOC and Time dial setting (TDS) of each relay is set on a three-phase basis. In the second case, per-phase settings are considered. Relay TDSs and TOCs are both considered as simultaneous discrete control variables. Despite the stochastic nature of using per-phase settings for unbalanced systems is found to generally allow for shorter operating times. However, for relatively balanced systems, it is best to use three-phase settings if computation time is of importance.
This document presents a master–slave methodology for solving the problem of optimal operation of photovoltaic (PV) distributed generators (DGs) in direct current (DC) networks. This problem was modeled using a nonlinear programming model (NLP) that considers the minimization of three different objective functions in a daily operation of the system. The first one corresponds to the minimization of the total operational cost of the system, including the energy purchasing cost to the conventional generators and maintenance costs of the PV sources; the second objective function corresponds to the reduction of the energy losses associated with the transport of energy in the network, and the third objective function is related to the minimization of the total emissions of CO2 by the conventional generators installed on the DC grid. The minimization of these objective functions is achieved by using a master–slave optimization approach through the application of the Vortex Search algorithm combined with a matrix hourly power flow. To evaluate the effectiveness and robustness of the proposed approach, two test scenarios were used, which correspond to a grid-connected and a standalone network located in two different regions of Colombia. The grid-connected system emulates the behavior of the solar resource and power demand of the city of Medellín-Antioquia, and the standalone network corresponds to an adaptation of the generation and demand curves for the municipality of Capurganá-Choco. A numerical comparison was performed with four optimization methodologies reported in the literature: particle swarm optimization, multiverse optimizer, crow search algorithm, and salp swarm algorithm. The results obtained demonstrate that the proposed optimization approach achieved excellent solutions in terms of response quality, repeatability, and processing times.
Ill conditioning effects eliminated in nonlinear programming algorithms for optimal controls
Fixed time pursuit-evasion problems for dynamic systems solved with nonlinear programming algorithms
Second order necessary conditions of optimality with straightforward application to nonlinear programming of optimal control problems
Computer control of nonlinear systems with varying performance specifications, using Popov stability and nonlinear programming
Convergence of centers algorithm for solving nonlinear programming problems
The problem of determining the optimal design for a Mars roving vehicle is considered. A system model is generated by consideration of the physical constraints on the design parameters and the requirement that the system be deliverable to the Mars surface. An expression which evaluates system performance relative to mission goals as a function of the design parameters only is developed. The use of nonlinear programming techniques to optimize the design is proposed and an example considering only two of the vehicle subsystems is formulated and solved.
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.
This paper presents the theory and a technique for compensator improvement. Several definitions in regard to relative stability are presented along with some frequency response limitations and characteristics of a large space vehicle. A nonlinear programming algorithm for obtaining an improved solution for a strict constraint problem is developed and the necessary partial derivatives for applying the algorithm to compensator improvement are derived. Finally, for illustrating the effectiveness of the algorithm, the frequency response of a large space vehicle is improved.
Demonstration of the applicability of methods of centers and of methods of feasible directions to optimal control problems. Presented experimental results show that extensions of Frank-Wolfe (1956), Zoutendijk (1960), and Pironneau-Polak (1971) algorithms for nonlinear programming problems can be quite efficient in solving optimal control problems.
The problem of systematically determining the optimal design for an unmanned Mars-roving vehicle is considered. A system model, identifying all feasible designs, is generated by consideration of the physical constraints on the design parameters, and the requirement that the system be deliverable to the Mars surface. An expression which evaluates system performance relative to mission goals is developed. The model and objective function together allow simulation of the effects of design trade-offs upon system performance for all feasible designs. Nonlinear programming techniques are utilized to identify the optimal design.
The use of a retroflecting satellite and a laser rangefinder to navigate a Martian roving vehicle is considered in this paper. It is shown that a simple system can be employed to perform this task. An error analysis is performed on the navigation equations and it is shown that the error inherent in the scheme proposed can be minimized by the proper choice of measurement geometry. A nonlinear programming approach is used to minimize the navigation error subject to constraints that are due to geometric and laser requirements. The problem is solved for a particular set of laser parameters and the optimal solution is presented.
The value of improving information for forecasting future crop harvests was investigated. Emphasis was placed upon establishing practical evaluation procedures firmly based in economic theory. The analysis was applied to the case of U.S. domestic wheat consumption. Estimates for a cost of storage function and a demand function for wheat were calculated. A model of market determinations of wheat inventories was developed for inventory adjustment. The carry-over horizon is computed by the solution of a nonlinear programming problem, and related variables such as spot and future price at each stage are determined. The model is adaptable to other markets. Results are shown to depend critically on the accuracy of current and proposed measurement techniques. The quantitative results are presented parametrically, in terms of various possible values of current and future accuracies.
This paper discusses numerical aspects of computing maximum likelihood estimates for linear dynamical systems in state-vector form. Different gradient-based nonlinear programming methods are discussed in a unified framework and their applicability to maximum likelihood estimation is examined. The problems due to singular Hessian or singular information matrix that are common in practice are discussed in detail and methods for their solution are proposed. New results on the calculation of state sensitivity functions via reduced order models are given. Several methods for speeding convergence and reducing computation time are also discussed.
The philosophy and the mathematical basis of the nonlinear programming algorithm underlying the development of the COEBRA program were given. A User's Manual was given in a separate document. The purpose of this work was to convert the COEBRA program from the CDC 6400/6500 digital computer system to the UNIVAC 1108 at the George C. Marshall Space Flight Center and to provide an instruction manual on the use of the program.