Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linear 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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
NASA NTRS1976

On the design of optimal controllers with certain structural constraints

This paper considers the problem of designing certain structurally constrained optimal regulators for linear systems subjected to additive white process noise and measurement noise. Three types of controller structures are considered, using direct output feedback, prespecified time constant filters, and optimal dynamic compensators. Necessary conditions are obtained for minimizing quadratic performance criteria. The techniques are demonstrated by application to a helicopter/slung load system, and a flexible space station.

Joshi, S. M.↗
DOE OSTI2024

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

On the stability and instantaneous velocity of grasped frictionless objects

A quantitative test for form closure valid for any number of contact points is formulated as a linear program, the optimal objective value of which provides a measure of how far a grasp is from losing form closure. Another contribution of the study is the formulation of a linear program whose solution yields the same information as the classical approach. The benefit of the formulation is that explicit testing of all possible combinations of contact interactions can be avoided by the algorithm used to solve the linear program.

Trinkle, Jeffrey C.↗
DOE OSTI2020

Comparison of Linear and Rotary Electric Machine Topologies for a Hybrid Hydraulic Electric Architecture of Off-Highway Vehicles

Electrification of off-highway vehicles offers the benefits of improved energy efficiency, enhanced controllability, and reduction in greenhouse gas emissions. However, progress towards electrification has been limited by the low power density of electric components compared to hydraulic components. A recently proposed hybrid hydraulic electric vehicle architecture provides a potential solution to these power density challenges by minimizing the required power rating of the electric components. This paper investigates the optimal design of linear and rotary electric machines for this new system architecture. Key performance metrics are identified for the electric machine, several variants of electric machines are analytically sized and compared for two different power levels, and an FEA-assisted design optimization is performed on promising candidates. Based on the optimization results, it is shown that an axial flux rotary machine is most suitable for implements requiring high power ratings, while the linear machine's form factor makes it a compelling candidate for lower power implements.

42 ENGINEERING↗
DOE OSTI2023

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗
NASA NTRS1990

Finite element analysis and optimization of composite structures

Linearly elastic fiber reinforced composite discs and laminates in plane stress with variable local orientation and concentration of one or two fiber fields embedded in the matrix material, are considered. The thicknesses and the domain of the discs or laminates are assumed to be given, together with prescribed boundary conditions and in-plane loading along the edge. The problem under study consists in determining throughout the structural domain the optimum orientations and concentrations of the fiber fields in such a way as to maximize the integral stiffness of the composite disc or laminate under the seven loading. Minimization of the integral stiffness can also be performed. The optimization is performed subject to a prescribed bound on the total cost or weight of the composite that for given unit cost factors or specific weights determines the amounts of fiber and matrix materials in the structure. Examples are presented.

Thomsen, Jan↗
NASA NTRS1989

Optimal selection of space transportation fleet to meet multi-mission space program needs

A space program that spans several decades will be comprised of a collection of missions such as low earth orbital space station, a polar platform, geosynchronous space station, lunar base, Mars astronaut mission, and Mars base. The optimal selection of a fleet of several recoverable and expendable launch vehicles, upper stages, and interplanetary spacecraft necessary to logistically establish and support these space missions can be examined by means of a linear integer programming optimization model. Such a selection must be made because the economies of scale which comes from producing large quantities of a few standard vehicle types, rather than many, will be needed to provide learning curve effects to reduce the overall cost of space transportation if these future missions are to be affordable. Optimization model inputs come from data and from vehicle designs. Each launch vehicle currently in existence has a launch history, giving rise to statistical estimates of launch reliability. For future, not-yet-developed launch vehicles, theoretical reliabilities corresponding to the maturity of the launch vehicles' technology and the degree of design redundancy must be estimated. Also, each such launch vehicle has a certain historical or estimated development cost, tooling cost, and a variable cost. The cost of a launch used in this paper includes the variable cost plus an amortized portion of the fixed and development costs. The integer linear programming model will have several constraint equations based on assumptions of mission mass requirements, volume requirements, and number of astronauts needed. The model will minimize launch vehicle logistic support cost and will select the most desirable launch vehicle fleet.

Morgenthaler, George W.↗
DOE OSTI2023

Ion trap long-range XY model for quantum state transfer and optimal spatial search

Abstract Linear ion trap chains are a promising platform for quantum computation and simulation. The XY model with long-range interactions can be implemented with a single side-band Mølmer–Sørensen scheme, giving interactions that decay as 1 / r α , where α parameterises the interaction range. Lower α leads to longer range interactions, allowing faster long-range gate operations for quantum computing. However, decreasing α causes an increased generation of coherent phonons and appears to dephase the effective XY interaction model. We characterise and show how to correct for this effect completely, allowing lower α interactions to be coherently implemented. Ion trap chains are thus shown to be a viable platform for spatial quantum search in optimal O ( N ) time, for N ions. Finally, we introduce a O ( N ) quantum state transfer protocol, with a qubit encoding that maintains a high fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Controlling Dielectric and Relaxor-Ferroelectric Properties for Energy Storage by Tuning Pb 0.92 La 0.08 Zr 0.52 Ti 0.48 O 3 Film Thickness

The energy storage properties of Pb 0.92 La 0.08 Zr 0.52 Ti 0.48 O 3 (PLZT) films grown via pulsed laser deposition were evaluated at variable film thickness of 125, 250, 500, and 1000 nm. These films show high dielectric permittivity up to ~1200. Cyclic I–V measurements were used to evaluate the dielectric properties of these thin films, which not only provide the total electric displacement, but also separate contributions from each of the relevant components including electric conductivity (D1), dielectric capacitance (D2), and relaxor-ferroelectric domain switching polarization (P). Our results show that, as the film thickness increases, the material transits from a linear dielectric to nonlinear relaxor-ferroelectric. And while the energy storage per volume increases with the film thickness, the energy storage efficiency drops from ~80% to ~30%. The PLZT films can be optimized for different energy storage applications by tuning the film thickness to optimize between the linear and nonlinear dielectric properties and energy storage efficiency.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Optimization of switch diagnostics on the MAIZE linear transformer driver

The MAIZE Linear Transformer Driver is made of 40 capacitor-switch-capacitor `bricks' connected in parallel. When these 40 bricks are charged to 100-kV and then discharged synchronously, the MAIZE facility generates a 1-MA current pulse with a 100-ns rise time into a matched load impedance. Discharging each of the capacitors in a brick is carried out by the breakdown of a spark-gap switch, a process which results in the emission of light. Monitoring this output light with a fiber optic coupled to a photomultiplier tube (PMT) and an oscilloscope channel provides information on switch performance and timing jitter– whether a switch red early, late, or in phase with the other switches. However, monitoring each switch with a dedicated detector- oscilloscope channel can be problematic for facilities where the number of switches to be monitored (e.g., 40 on MAIZE) greatly exceeds the number of detector-oscilloscope channels available. The technique of using fibers to monitor light emission from switches can be optimized by treating a PMT as a binary digit or bit and using a combinatorial encoding scheme, where each switch is monitored by a unique combination of fiber- PMT-oscilloscope channels simultaneously. By observing the unique combination of ber-PMT-oscilloscope channels that are turned on, the pre-firing or late-firing of a single switch on MAIZE can be identified by as few as six PMT-oscilloscope channels. The number of PMT-oscilloscope channels, N , required to monitor X switches can be calculated by 2 N = X + 1, where the number '2' is selected because the PMT-oscilloscope acts as a bit. Here, we demonstrate the use of this diagnostic technique on MAIZE. In conclusion, we also present an analysis of how this technique could be scaled to monitor the tens of thousands of switches proposed for various next generation pulsed power facilities.

47 OTHER INSTRUMENTATION↗
DOE OSTI2018

Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components

Here, we develop a manifold sampling algorithm for the minimization of a nonsmooth composite function $f \triangleq \psi + h \circ F$ when $\psi$ is smooth with known derivatives, $h$ is a known, nonsmooth, piecewise linear function, and $F$ is smooth but expensive to evaluate. The trust-region algorithm classifies points in the domain of $h$ as belonging to different manifolds and uses this knowledge when computing search directions. Since $h$ is known, classifying objective manifolds using only the values of $F$ is simple. We prove that all cluster points of the sequence of the manifold sampling algorithm iterates are Clarke stationary; this holds although points evaluated by the algorithm are not assumed to be differentiable and when only approximate derivatives of $F$ are available. Numerical results show that manifold sampling using zeroth-order information about $F$ is competitive with algorithms that employ exact subgradient values from $\partial f$.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Modeling Wavelength Dependent Mid-infrared (5.5–25 μm) Optical Constants of Silicate Glasses: A Genetic Algorithm Approach

Wavelength-dependent mid-infrared (400–1,800 cm -1 ; 5.56–25 μm) optical constants (real and imaginary indices of refraction; n and k) are determined using reflectance spectra at a spectral sampling of 4 cm -1 for several silicate glasses of varying SiO 2 wt% which include (a) basaltic volcanic glass from Kilauea, Hawaii, (b) synthetic andesite, (c) two synthetic dacites, (d) obsidian volcanic glass from Mount Lassen, California, (e) synthetic rhyodacite, and (f) rhyolitic volcanic glass from Mexico. Because glasses are optically isotropic, no specific orientation was required for spectral measurements, and polished glass samples were measured at random orientations using micro-FTIR spectrometer. Lorentz-Lorenz dispersion theory and Fresnel reflectance model for high symmetry materials were used to model the optical constants by optimizing oscillator parameters in modeled spectra to match laboratory spectra. A genetic algorithm (GA) approach automatically finds the natural oscillators and their parameters for each spectrum, and then uses these parameters in a non-linear least squares optimization routine. The study compared spectral parameters such as Christiansen feature, reststrahlen bands (RBs), and the peaks centered around 860–1,100 (peak 1) and 400–480 cm -1 (peak 2) of n and k to their respective SiO 2 wt% of the glasses. CF, RBs, peak 1 of n and k, and peak 2 of n shift to higher wavenumbers with increased SiO 2 wt%, whereas peak 2 of k shifts to lower wavenumbers with increased SiO 2 wt%. Derived optical constants of these glasses will improve quantitative abundance mapping of volcanic materials on the surfaces of silicate targets in the Solar System.

58 GEOSCIENCES↗
DOE OSTI2019

Optimum Planning for Inductively Charged On-Demand Automated Electric Shuttles at Greenville, South Carolina

Wireless charging technology presents perfect fits for autonomous electric vehicles for realizing a fully automated system (vehicle and charger). This paper presents a planning optimization analysis for a pilot project of in-route wireless charging infrastructure serving fixed-route on-demand shared automated electric shuttles (SAESs) at Greenville, South Carolina, USA. A single-objective non-linear integer planning optimization problem is formulated. A comprehensive cost function representing the inductively charged SAESs is developed, considering road construction, power electronics and materials, traction battery, and installation costs. The optimization problem is solved to determine the best combination of the system key design parameters (number and allocations of wireless chargers, charging power level, track length and on-board battery capacity) that show the most cost-effective solution and allow the SAESs realizing charge sustaining operation. The planning platform incorporates representative simulated traffic data (drive cycles and routes) for four SAESs at Greenville project using the Simulation of Urban Mobility (SUMO) tool. These data are fed to a vehicle powertrain model and a wireless charger power model to predict the battery power, energy and state-of-charge (SOC) profiles, which are provided to the search algorithm to assess the design objectives under specific constraints. The results indicated that implementing wireless charging at a few designated stops for fixed-route SAESs with proper design allows the vehicles realizing charge sustaining operation, infinite range and zero recharge downtime, with a significant reduction in the on-board battery (36 % ) and road coverage (69%), at minimum cost.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

Guaranteeing a Physically Realizable Battery Dispatch Without Charge-Discharge Complementarity Constraints

The non-convex complementarity constraints present a fundamental computational challenge in energy constrained optimization problems. In this work, we present a new, linear, and robust battery optimization formulation that sidesteps the need for battery complementarity constraints and integers and prove analytically that the formulation guarantees that all energy constraints are satisfied which ensures that the optimized battery dispatch is physically realizable. In addition, we bound the worst-case model mismatch and discuss conservativeness. In conclusion, simulation results further illustrate the effectiveness of this approach.

25 ENERGY STORAGE↗
NASA NTRSDate not supplied

Robust Trajectory Optimization for Guided Powered Descent and Landing

A robust trajectory optimization approach for guidance algorithm gain selection for powered descent and landing is developed. This approach uses a genetic algorithm to determine optimal guidance algorithm parameters while incorporating uncertainty information from linear covariance analysis. The optimal guidance algorithm parameters are determined while accounting for environment, navigation, and vehicle property uncertainty and sensor suite fidelity. As a demonstration of this method, the optimal gains for the fractional polynomial powered descent guidance are found for the braking phase of a robotic lunar landing mission. Scenarios with differing sensor suites and sensor qualities are considered, with objective functions to minimize variability in propellant usage or terminal position. Results show that the optimal guidance algorithm gains for a given trajectory differ based on the sensor suite, and optimal guidance algorithm gains may result in up to 20% performance improvements over the baseline in propellant usage and landed accuracy.

Grace E Calkins↗
NASA NTRSDate not supplied

Copernicus-LinCov (COPCOV) Software Integration in Support of Robust Trajectory Optimization

Robust trajectory optimization is the process of optimizing a trajectory while accounting for system uncertainty due to a variety of potential error sources. This work highlights the development and features of a novel tool known as CopCov to support robust trajectory optimization efforts. CopCov acts as an interface between Copernicus, a generalized trajectory design and optimization tool, and LinCov, a linear covariance analysis tool. By having a direct interface between these two software packages, Copernicus can receive covariance information from LinCov through a direct feedback loop, thus enabling optimization of a trajectory that is robust to trajectory dispersions and navigation errors. This paper details the architecture of CopCov and its flexibility to operate under varying configurations, including with both tools running locally or alternatively with the tools communicating via a remote connection. Additionally, the CopCov tool is demonstrated on a simple Hohmann transfer reference trajectory with varying numbers of Trajectory Correction Maneuvers (TCMs) and varying problem formulations. This example scenario is used to highlight how the inclusion of the CopCov interface affects burn placement of both major burns and minor burns (i.e., TCMs) in the optimized solution. Results are compared against analytical solutions and against a Genetic Algorithm (GA) optimizer for independent verification and validation.

Copernicus↗
DOE OSTI2021

Discrete-Time Causal Control of a Wave Energy Converter With Finite Stroke in Stochastic Waves

We consider feedback control design for a wave energy converter (WEC) for which the power takeoff (PTO) system has a finite stroke limit. Stationary stochastic wave loading is assumed, with a known spectrum, and the plant dynamics are assumed to be linear. We develop a technique for the design of a discrete-time controller, which has three design stages. In the first stage, a linear controller is optimized while imposing a relaxation of the maximum stroke constraint on the design. In the second stage, a tandem nonlinear feedback loop is designed for the purpose of stroke protection. In the third stage, the two designs (linear and nonlinear) are fused in a manner that preserves the stability of the overall system. The technique is demonstrated in a simulation of a simple cylindrical buoy. We show that the controller may be tuned through the adjustment of scalar design parameters, which adjust the tradeoff between the mean generated power and the force levels required to protect the stroke.

16 TIDAL AND WAVE POWER↗
DOE OSTI2021

Substation-Level Grid Topology Optimization Using Bus Splitting

Operations of substation circuit breakers are important for maintenance needs and topology reconfiguration in power systems. Bus splitting is one type of topology change where the two bus bars at a substation can become electrically disconnected under certain actions of circuit breakers. Because these events involve detailed substation modeling, they are typically not considered in routine power system operation and control. In this paper, an improved substation-level topology optimization framework is developed by expanding traditional line switching decisions by breaker-level bus splitting, which can further reduce grid congestion and generation costs. A tight McCormick relaxation is proposed to reformulate the bilinear terms in the resultant optimization problem to linear inequality constraints. Thus, a tractable mixed-integer linear program reformulation is attained that allows for efficient solutions in real-time operations. Numerical studies on the IEEE 14-bus and 118-bus systems demonstrate the computational performance and economic benefits of the proposed topology optimization approach.

bus split↗