Search NASA⌕ Search

SEARCH · Search NASA

Results for “convex programs”

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 217 records · Page 12

Performance Measurement, Visualization and Modeling of Parallel and Distributed Programs

This paper presents a methodology for debugging the performance of message-passing programs on both tightly coupled and loosely coupled distributed-memory machines. The AIMS (Automated Instrumentation and Monitoring System) toolkit, a suite of software tools for measurement and analysis of performance, is introduced and its application illustrated using several benchmark programs drawn from the field of computational fluid dynamics. AIMS includes (i) Xinstrument, a powerful source-code instrumentor, which supports both Fortran77 and C as well as a number of different message-passing libraries including Intel's NX Thinking Machines' CMMD, and PVM; (ii) Monitor, a library of timestamping and trace -collection routines that run on supercomputers (such as Intel's iPSC/860, Delta, and Paragon and Thinking Machines' CM5) as well as on networks of workstations (including Convex Cluster and SparcStations connected by a LAN); (iii) Visualization Kernel, a trace-animation facility that supports source-code clickback, simultaneous visualization of computation and communication patterns, as well as analysis of data movements; (iv) Statistics Kernel, an advanced profiling facility, that associates a variety of performance data with various syntactic components of a parallel program; (v) Index Kernel, a diagnostic tool that helps pinpoint performance bottlenecks through the use of abstract indices; (vi) Modeling Kernel, a facility for automated modeling of message-passing programs that supports both simulation -based and analytical approaches to performance prediction and scalability analysis; (vii) Intrusion Compensator, a utility for recovering true performance from observed performance by removing the overheads of monitoring and their effects on the communication pattern of the program; and (viii) Compatibility Tools, that convert AIMS-generated traces into formats used by other performance-visualization tools, such as ParaGraph, Pablo, and certain AVS/Explorer modules.

Yan, Jerry C.↗

Structural optimization of an alternate design for the space shuttle solid rocket booster field joint

A structural optimization procedure is used to determine the shape of an alternate design for the shuttle solid rocket booster field joint. In contrast to the tang and clevis design of the existing joint, this alternate design consists of two flanges bolted together. Configurations with 150 studs of 1 1/8 in. diameter and 135 studs of 1 3/16 in. diameter are considered. Using a nonlinear programming procedure, the joint weight is minimized under constraints on either von Mises or maximum normal stresses, joint opening and geometry. The procedure solves the design problem by replacing it by a sequence of approximate (convex) subproblems; the pattern of contact between the joint halves is determined every few cycles by a nonliner displacement analysis. The minimum weight design has 135 studs of 1 3/16 in. diameter and is designed under constraints on normal stresses. It weighs 1144 lb per joint more than the current tang and clevis design.

Barthelemy, J.-F. M.↗

Structural optimization of an alternate design for the Space Shuttle solid rocket booster field joint

A structural optimization procedure is used to determine the shape of an alternate design for the Shuttle's solid rocket booster field joint. In contrast to the tang and clevis design of the existing joint, this alternate design consists of two flanges bolted together. Configurations with 150 studs of 1 1/8 in diameter and 135 studs of 1 3/16 in diameter are considered. Using a nonlinear programming procedure, the joint weight is minimized under constraints on either von Mises or maximum normal stresses, joint opening and geometry. The procedure solves the design problem by replacing it by a sequence of approximate (convex) subproblems; the pattern of contact between the joint halves is determined every few cycles by a nonlinear displacement analysis. The minimum weight design has 135 studs of 1 3/16 in diameter and is designed under constraints on normal stresses. It weighs 1144 lb per joint more than the current tang and clevis design.

Barthelemy, Jean-Francois M.↗

Optimizing Vehicle Fleet and Assignment for Concentrating Solar Power Plant Heliostat Washing

Concentrating solar power central-receiver plants use thousands of sun-tracking mirrors, i.e., heliostats, to reflect sunlight to a central receiver, which collects and uses the heat to generate electricity. Over time, soiling reduces the reflectivity of the heliostats and, therefore, the efficiency of the system. Current industry practice sends vehicles to wash heliostats in an ad hoc fashion. We present a mixed-integer nonlinear program that determines wash vehicle fleet size, mix, and assignment of wash crews to heliostats to minimize the sum of (i) the revenues lost due to heliostat soiling, (ii) the costs of hiring wash crews and operating the vehicles, and (iii) the costs of purchasing wash vehicles. We establish conditions for convexity of the objective function, and then propose a decomposition method that enables near-optimal solutions to the wash vehicle fleet sizing and assignment problem on the order of a couple of minutes. Furthermore, these solutions yield hundreds of thousands of dollars in savings per year over current industry practices.

14 SOLAR ENERGY↗

Exact Convex Relaxation of Optimal Power Flow in Radial Networks

The optimal power flow (OPF) problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. It is nonconvex. We prove that a global optimum of OPF can be obtained by solving a second-order cone program, under a mild condition after shrinking the OPF feasible set slightly, for radial power networks. The condition can be checked a priori, and holds for the IEEE 13, 34, 37, 123-bus networks and two real-world networks.

Gan, LW↗

Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation

Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.

97 MATHEMATICS AND COMPUTING↗

Study on the application of NASA energy management techniques for control of a terrestrial solar water heating system

This paper addresses the potential for enhanced solar system performance through sophisticated control of the collector loop flow rate. Computer simulations utilizing the TRNSYS solar energy program were performed to study the relative effect on system performance of eight specific control algorithms. Six of these control algorithms are of the proportional type: two are concave exponentials, two are simple linear functions, and two are convex exponentials. These six functions are typical of what might be expected from future, more advanced, controllers. The other two algorithms are of the on/off type and are thus typical of existing control devices. Results of extensive computer simulations utilizing actual weather data indicate that proportional control does not significantly improve system performance. However, it is shown that thermal stratification in the liquid storage tank may significantly improve performance.

Swanson, T. D.↗

Distance estimation and collision prediction for on-line robotic motion planning

An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem is incorporated into the framework of an in-line motion-planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning, the deterministic problem where the information about the objects is assumed to be certain is examined. L(1) or L(infinity) norms are used to represent distance and the problem becomes a linear programming problem. The stochastic problem is formulated where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: First, filtering of the distance between the robot and the moving object at the present time. Second, prediction of the minimum distance in the future in order to predict the collision time.

Kyriakopoulos, K. J.↗

Sensor System and Observer Algorithm Co-Design For Modern Internal Combustion Engine Air Management Based on H2 Optimization

This paper outlines a novel sensor selection and observer design algorithm for linear time-invariant systems with both process and measurement noise based on H 2 optimization to optimize the tradeoff between the observer error and the number of required sensors. The optimization problem is relaxed to a sequence of convex optimization problems that minimize the cost function consisting of the H 2 norm of the observer error and the weighted l 1 norm of the observer gain. An LMI formulation allows for efficient solution via semi-definite programing. The approach is applied here, for the first time, to a turbo-charged spark-ignited engine using exhaust gas circulation to determine the optimal sensor sets for real-time intake manifold burnt gas mass fraction estimation. Simulation with the candidate estimator embedded in a high fidelity engine GT-Power model demonstrates that the optimal sensor sets selected using this algorithm have the best H 2 estimation performance. Sensor redundancy is also analyzed based on the algorithm results. This algorithm is applicable for any type of modern internal combustion engines to reduce system design time and experimental efforts typically required for selecting optimal sensor sets.

Zhang, Xu↗

NASTRAN migration to UNIX

COSMIC/NASTRAN, as it is supported and maintained by COSMIC, runs on four main-frame computers - CDC, VAX, IBM and UNIVAC. COSMIC/NASTRAN on other computers, such as CRAY, AMDAHL, PRIME, CONVEX, etc., is available commercially from a number of third party organizations. All these computers, with their own one-of-a-kind operating systems, make NASTRAN machine dependent. The job control language (JCL), the file management, and the program execution procedure of these computers are vastly different, although 95 percent of NASTRAN source code was written in standard ANSI FORTRAN 77. The advantage of the UNIX operating system is that it has no machine boundary. UNIX is becoming widely used in many workstations, mini's, super-PC's, and even some main-frame computers. NASTRAN for the UNIX operating system is definitely the way to go in the future, and makes NASTRAN available to a host of computers, big and small. Since 1985, many NASTRAN improvements and enhancements were made to conform to the ANSI FORTRAN 77 standards. A major UNIX migration effort was incorporated into COSMIC NASTRAN 1990 release. As a pioneer work for the UNIX environment, a version of COSMIC 89 NASTRAN was officially released in October 1989 for DEC ULTRIX VAXstation 3100 (with VMS extensions). A COSMIC 90 NASTRAN version for DEC ULTRIX DECstation 3100 (with RISC) is planned for April 1990 release. Both workstations are UNIX based computers. The COSMIC 90 NASTRAN will be made available on a TK50 tape for the DEC ULTRIX workstations. Previously in 1988, an 88 NASTRAN version was tested successfully on a SiliconGraphics workstation.

Chan, Gordon C.↗

Performance Analysis of A Dual Quaternion Guidance Algorithm Applicable During Lunar Approach With A Hazard Avoidance Maneuver

There is currently a need for advanced guidance and targeting algorithms that can provide real-time trajectories in the presence of state and vehicle constraints during powered descent. The Safe & Precise Landing Integrated Capabilities Evolution (SPLICE) program aims to mature Hazard Detection (HD) technology along with advanced navigation and guidance algorithms. This paper will report the overall performance of the SPLICE Dual Quaternion Guidance (DQG) algorithm which is a 6-Degree-of-Freedom (6-DOF) convex optimization-based guidance algorithm that can enforce multiple vehicle and state constraints required for Hazard Detection Lidar (HDL) scans during the approach phase. DQG was tested in a closed-loop lunar descent simulation with realistic HDL sensing constraints in a Monte Carlo assessment of 1000 dispersed runs.

Guidance↗

The Configuration Space Toolkit (C-Space Toolkit or CSTK) Ver. 2.5 beta

The C-Space Toolkit provides a software library that makes it easier to program motion planning, simulation, robotics, and virtual reality codes using the Configuration Space abstraction. Key functionality (1) enables the user to special create representations of movable and stationary rigid geometric objects, and (2) perform fast distance, interference (clash) detection, collision detection, closest-feature pairs, and contact queries in terms of object configuration. Not only can queries be computed at any given point in configuration space, but they can be done exactly over linear-translational path segments and approximately for rotational path segments. Interference detection and distance computations can be done with respect to the Minkowski sum of the original geometry and a piece of convex geometry. The Toolkit takes as raw model input (1) collections of convex polygons that form the boundaries of models and (2) convex polyhedra, cones, cylinders, and discs that are models and model components. Configurations are given in terms of homogeneous transforms. A simple OpenGL-based system for displaying and animating the geometric objects is included in the implementation. This version, 2.5 Beta, incorporates feature additions and enhancements, improvements in algorithms, improved robustness, bug fixes and cleaned-up source code, better compliance with standards and recent programming convention, changes to the build process for the software, support for more recent hardware and software platforms, and improvements to documentation and source-code comments.

Chen, Pang-Chieh↗

Manual for automatic generation of finite element models of spiral bevel gears in mesh

The goal of this research is to develop computer programs that generate finite element models suitable for doing 3D contact analysis of faced milled spiral bevel gears in mesh. A pinion tooth and a gear tooth are created and put in mesh. There are two programs: Points.f and Pat.f to perform the analysis. Points.f is based on the equation of meshing for spiral bevel gears. It uses machine tool settings to solve for an N x M mesh of points on the four surfaces, pinion concave and convex, and gear concave and convex. Points.f creates the file POINTS.OUT, an ASCI file containing N x M points for each surface. (N is the number of node points along the length of the tooth, and M is nodes along the height.) Pat.f reads POINTS.OUT and creates the file tl.out. Tl.out is a series of PATRAN input commands. In addition to the mesh density on the tooth face, additional user specified variables are the number of finite elements through the thickness, and the number of finite elements along the tooth full fillet. A full fillet is assumed to exist for both the pinion and gear.

Bibel, G. D.↗

Evaluating the effects of real power losses in optimal power flow based storage integration

This study proposes a DC optimal power flow (DCOPF) with losses formulation (the `-DCOPF+S problem) and uses it to investigate the role of real power losses in OPF based grid-scale storage integration. We derive the `- DCOPF+S problem by augmenting a standard DCOPF with storage (DCOPF+S) problem to include quadratic real power loss approximations. This procedure leads to a multi-period nonconvex quadratically constrained quadratic program, which we prove can be solved to optimality using either a semidefinite or second order cone relaxation. Our approach has some important benefits over existing models. It is more computationally tractable than ACOPF with storage (ACOPF+S) formulations and the provably exact convex relaxations guarantee that an optimal solution can be attained for a feasible problem. Adding loss approximations to a DCOPF+S model leads to a more accurate representation of locational marginal prices, which have been shown to be critical to determining optimal storage dispatch and siting in prior ACOPF+S based studies. Case studies demonstrate the improved accuracy of the `-DCOPF+S model over a DCOPF+S model and the computational advantages over an ACOPF+S formulation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Net Shape Spin Formed Cryogenic Aluminum Lithium Cryogenic Tank Domes for Lower Cost Higher Performance Launch Vehicles

With the goal of lower cost (simplified manufacturing and lower part count) and higher performance (higher strength to weight alloys) the NASA Technical Maturation Program in 2006 funded a proposal to investigate spin forming of space launch vehicle cryogenic tank domes. The project funding continued under the NASA Exploration Technology Development Program through completion in FY12. The first phase of the project involved spin forming of eight, 1 meter diameter "path finder" domes. Half of these were processed using a concave spin form process (MT Aerospace, Augsburg Germany) and the other half using a convex process (Spincraft, Boston MA). The convex process has been used to produce the Ares Common Bulkhead and the concave process has been used to produce dome caps for the Space Shuttle light weight external tank and domes for the NASDA H2. Aluminum Lithium material was chosen because of its higher strength to weight ratio than the Aluminum 2219 baseline. Aluminum lithium, in order to obtain the desired temper (T8), requires a cold stretch after the solution heat treatment and quench. This requirement favors the concave spin form process which was selected for scale up. This paper describes the results of processing four, 5.5 meter diameter (upper stage scale) net shaped spin formed Aluminum Lithium domes. In order to allow scalability beyond the limits of foundry and rolling mills (about 12 foot width) the circular blank contained one friction stir weld (heavy lifter scales require a flat blank containing two welds). Mechanical properties data (tensile, fracture toughness, stress corrosion, and simulated service testing) for the parent metal and weld will also be discussed.

Curreri, Peter A.↗

Controlled Islanding Strategy Considering Uncertainty of Renewable Energy Sources Based on Chance-constrained Model

Controlled islanding plays an essential role in preventing the blackout of power systems. Although there are several studies on this topic in the past, not enough attention is paid to the uncertainty brought by renewable energy sources (RESs) that may cause unpredictable unbalanced power and the observability of power systems after islanding that is essential for back-up black-start measures. Therefore, a novel controlled islanding model based on mixed-integer second-order cone and chance-constrained programming (MISOCCP) is proposed to address these issues. First, the uncertainty of RESs is characterized by their possibility distribution models with chance constraints, and the requirements, e. g., system observ-ability, for rapid back-up black-start measures are also considered. Then, a law of large numbers (LLN) based method is employed for converting the chance constraints into deterministic ones and reformulating the non-convex model into convex one. Finally, case studies on the revised IEEE 39-bus and 118-bus power systems as well as the comparisons among different models are given to demonstrate the effectiveness of the proposed model. The results show that the proposed model can result in less unbalanced power and better observability after islanding compared with other models.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Structural optimization via a design space hierarchy

Mathematical programming techniques provide a general approach to automated structural design. An iterative method is proposed in which design is treated as a hierarchy of subproblems, one being locally constrained and the other being locally unconstrained. It is assumed that the design space is locally convex in the case of good initial designs and that the objective and constraint functions are continuous, with continuous first derivatives. A general design algorithm is outlined for finding a move direction which will decrease the value of the objective function while maintaining a feasible design. The case of one-dimensional search in a two-variable design space is discussed. Possible applications are discussed. A major feature of the proposed algorithm is its application to problems which are inherently ill-conditioned, such as design of structures for optimum geometry.

Vanderplaats, G. N.↗

Distance estimation and collision prediction for on-line robotic motion planning

An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem has been incorporated in the framework of an in-line motion planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning the deterministic problem, where the information about the objects is assumed to be certain is examined. If instead of the Euclidean norm, L(sub 1) or L(sub infinity) norms are used to represent distance, the problem becomes a linear programming problem. The stochastic problem is formulated, where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: (1) filtering of the minimum distance between the robot and the moving object, at the present time; and (2) prediction of the minimum distance in the future, in order to predict possible collisions with the moving obstacles and estimate the collision time.

Kyriakopoulos, K. J.↗