Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 649 records · Page 36

An Explicit Linear Filtering Solution for the Optimization of Guidance Systems with Statistical Inputs

The determination of optimum filtering characteristics for guidance system design is generally a tedious process which cannot usually be carried out in general terms. In this report a simple explicit solution is given which is applicable to many different types of problems. It is shown to be applicable to problems which involve optimization of constant-coefficient guidance systems and time-varying homing type systems for several stationary and nonstationary inputs. The solution is also applicable to off-design performance, that is, the evaluation of system performance for inputs for which the system was not specifically optimized. The solution is given in generalized form in terms of the minimum theoretical error, the optimum transfer functions, and the optimum transient response. The effects of input signal, contaminating noise, and limitations on the response are included. From the results given, it is possible in an interception problem, for example, to rapidly assess the effects on minimum theoretical error of such factors as target noise and missile acceleration. It is also possible to answer important questions regarding the effect of type of target maneuver on optimum performance.

Stewart, Elwood C.↗

High-Performance Algorithm for Solving the Diagnosis Problem

An improved method of model-based diagnosis of a complex engineering system is embodied in an algorithm that involves considerably less computation than do prior such algorithms. This method and algorithm are based largely on developments reported in several NASA Tech Briefs articles: The Complexity of the Diagnosis Problem (NPO-30315), Vol. 26, No. 4 (April 2002), page 20; Fast Algorithms for Model-Based Diagnosis (NPO-30582), Vol. 29, No. 3 (March 2005), page 69; Two Methods of Efficient Solution of the Hitting-Set Problem (NPO-30584), Vol. 29, No. 3 (March 2005), page 73; and Efficient Model-Based Diagnosis Engine (NPO-40544), on the following page. Some background information from the cited articles is prerequisite to a meaningful summary of the innovative aspects of the present method and algorithm. In model-based diagnosis, the function of each component and the relationships among all the components of the engineering system to be diagnosed are represented as a logical system denoted the system description (SD). Hence, the expected normal behavior of the engineering system is the set of logical consequences of the SD. Faulty components lead to inconsistencies between the observed behaviors of the system and the SD. Diagnosis the task of finding faulty components is reduced to finding those components, the abnormalities of which could explain all the inconsistencies. The solution of the diagnosis problem should be a minimal diagnosis, which is a minimal set of faulty components. The calculation of a minimal diagnosis is inherently a hard problem, the solution of which requires amounts of computation time and memory that increase exponentially with the number of components of the engineering system. Among the developments to reduce the computational burden, as reported in the cited articles, is the mapping of the diagnosis problem onto the integer-programming (IP) problem. This mapping makes it possible to utilize a variety of algorithms developed previously for IP to solve the diagnosis problem. In the IP approach, the diagnosis problem can be formulated as a linear integer optimization problem, which can be solved by use of well-developed integer-programming algorithms. This concludes the background information.

Fijany, Amir↗

Human Outer Solar System Exploration via Q-Thruster Technology

Propulsion technology development efforts at the NASA Johnson Space Center continue to advance the understanding of the quantum vacuum plasma thruster (QThruster), a form of electric propulsion. Through the use of electric and magnetic fields, a Q-thruster pushes quantum particles (electrons/positrons) in one direction, while the Qthruster recoils to conserve momentum. This principle is similar to how a submarine uses its propeller to push water in one direction, while the submarine recoils to conserve momentum. Based on laboratory results, it appears that continuous specific thrust levels of 0.4 - 4.0 N/kWe are achievable with essentially no onboard propellant consumption. To evaluate the potential of this technology, a mission analysis tool was developed utilizing the Generalized Reduced Gradient non-linear parameter optimization engine contained in the Microsoft Excel® platform. This tool allowed very rapid assessments of "Q-Ship" minimum time transfers from earth to the outer planets and back utilizing parametric variations in thrust acceleration while enforcing constraints on planetary phase angles and minimum heliocentric distances. A conservative Q-Thruster specific thrust assumption (0.4 N/kWe) combined with "moderate" levels of space nuclear power (1 - 2 MWe) and vehicle specific mass (45 - 55 kg/kWe) results in continuous milli-g thrust acceleration, opening up realms of human spaceflight performance completely unattainable by any current systems or near-term proposed technologies. Minimum flight times to Mars are predicted to be as low as 75 days, but perhaps more importantly new "retro-phase" and "gravity-augmented" trajectory shaping techniques were revealed which overcome adverse planetary phasing and allow virtually unrestricted departure and return opportunities. Even more impressively, the Jovian and Saturnian systems would be opened up to human exploration with round-trip times of 21 and 32 months respectively including 6 to 12 months of exploration at the destinations. Finally, interstellar trip times are assessed at milli-g acceleration levels.

Joosten, B. Kent↗

Enhancements of Bayesian Blocks; Application to Large Light Curve Databases

Bayesian Blocks are optimal piecewise linear representations (step function fits) of light-curves. The simple algorithm implementing this idea, using dynamic programming, has been extended to include more data modes and fitness metrics, multivariate analysis, and data on the circle (Studies in Astronomical Time Series Analysis. VI. Bayesian Block Representations, Scargle, Norris, Jackson and Chiang 2013, ApJ, 764, 167), as well as new results on background subtraction and refinement of the procedure for precise timing of transient events in sparse data. Example demonstrations will include exploratory analysis of the Kepler light curve archive in a search for "star-tickling" signals from extraterrestrial civilizations. (The Cepheid Galactic Internet, Learned, Kudritzki, Pakvasa1, and Zee, 2008, arXiv: 0809.0339; Walkowicz et al., in progress).

Kepler light curve archive↗

Virtual Flight Demonstration of the Stratospheric Dual-Aircraft Platform

A baseline configuration for the dual-aircraft platform (DAP) concept is described and evaluated in a physics-based flight dynamics simulations for two month-long missions as a communications relay in the lower stratosphere above central Florida, within 150-miles of downtown Orlando.The DAP configuration features two large glider-like (130 ft wing span) unmanned aerial vehicles connected via a long adjustable cable (total extendible length of 3000 ft) which effectively sail without propulsion using available wind shear. Use of onboard LiDAR wind profilers to forecast wind distributions are found to be necessary to enable the platform to efficiently adjust flight conditions to remain sailing by finding sufficient wind shear across the platform. The aircraft derive power from solar cells, like a conventional solar aircraft, but also extract wind power using the propeller as a turbine when there is an excess of wind shear available.Month-long atmospheric profiles (at 3-5 min intervals) in the vicinity of 60,000-ft are derived from archived data measured by the 50-Mhz Doppler Radar Wind Profiler at Cape Canaveral and used in the DAP flight simulations. A cursory evaluation of these datasets show that sufficient wind shear for DAP sailing is persistent, suggesting that DAP could potentially sail over 90% of the month-long durations even when limited by modest ascent/descent rates.DAP's novel guidance software uses a non-linear constrained optimization technique to define waypoints such that sailing mode of flight is maintained where possible, and minimal thrust is required where sailing is not practical. A set of constraints are identified which result in waypoints that enable efficient flight (i.e., minimal use of propulsion) over the two month-long flight simulations. Waypoint solutions may need to be tabulated for a wide range of potential atmospheric conditions and stored onboard for quick retrieval on a real DAP.DAP's flight control software uses an unconventional mixture of spacecraft and aircraft control techniques. Flight simulations confirms that this controls approach enables the platform to consistently reach successive waypoints over the month-long flight simulations.The ability of DAP to transition between the sailing mode (i.e., cable tension is high) and standard formation flight (i.e., cable tension is low) is a vital capability (e.g., to enable intermittent turns while stationkeeping). A new method to perform these transitions has been identified and characterized with flight simulation which requires special aircraft modifications.The energy-usage of the DAP configuration during two month-long stationkeeping missions over central Florida (i.e., stationkeeping over Orlando) is evaluated and compared to that of a pure solar aircraft of the same weight and aerodynamic performance. DAP is shown to consistently reduce net propulsion usage while simultaneously increasing solar energy capture.A baseline 700 GHz communications system is described and its performance evaluated for the proposed mission over central Florida. It is found that the variable roll orientation of the aircraft would increase the power required to maintain coverage over the stationkeeping radius of 150 miles (e.g., by as much as 100% when DAP is 150 miles from Orlando), compared to level flight. This effect can be mitigated via additional antenna design complexity or a more restricted stationkeeping radius.

Demonstrations↗

Downscaling Solar Power Output to 4-Seconds for Use in Integration Studies (Presentation)

High penetration renewable integration studies require solar power data with high spatial and temporal accuracy to quantify the impact of high frequency solar power ramps on the operation of the system. Our previous work concentrated on downscaling solar power from one hour to one minute by simulation. This method used clearness classifications to categorize temporal and spatial variability, and iterative methods to simulate intra-hour clearness variability. We determined that solar power ramp correlations between sites decrease with distance and the duration of the ramp, starting at around 0.6 for 30-minute ramps between sites that are less than 20 km apart. The sub-hour irradiance algorithm we developed has a noise floor that causes the correlations to approach ~0.005. Below one minute, the majority of the correlations of solar power ramps between sites less than 20 km apart are zero, and thus a new method to simulate intra-minute variability is needed. These intra-minute solar power ramps can be simulated using several methods, three of which we evaluate: a cubic spline fit to the one-minute solar power data; projection of the power spectral density toward the higher frequency domain; and average high frequency power spectral density from measured data. Each of these methods either under- or over-estimates the variability of intra-minute solar power ramps. We show that an optimized weighted linear sum of methods, dependent on the classification of temporal variability of the segment of one-minute solar power data, yields time series and ramp distributions similar to measured high-resolution solar irradiance data.

14 SOLAR ENERGY↗

Downscaling Solar Power Output to 4-Seconds for Use in Integration Studies: Preprint

High penetration renewable integration studies require solar power data with high spatial and temporal accuracy to quantify the impact of high frequency solar power ramps on the operation of the system. Our previous work concentrated on downscaling solar power from one hour to one minute by simulation. This method used clearness classifications to categorize temporal and spatial variability, and iterative methods to simulate intra-hour clearness variability. We determined that solar power ramp correlations between sites decrease with distance and the duration of the ramp, starting at around 0.6 for 30-minute ramps between sites that are less than 20 km apart. The sub-hour irradiance algorithm we developed has a noise floor that causes the correlations to approach ~0.005. Below one minute, the majority of the correlations of solar power ramps between sites less than 20 km apart are zero, and thus a new method to simulate intra-minute variability is needed. These intra-minute solar power ramps can be simulated using several methods, three of which we evaluate: a cubic spline fit to the one-minute solar power data; projection of the power spectral density toward the higher frequency domain; and average high frequency power spectral density from measured data. Each of these methods either under- or over-estimates the variability of intra-minute solar power ramps. We show that an optimized weighted linear sum of methods, dependent on the classification of temporal variability of the segment of one-minute solar power data, yields time series and ramp distributions similar to measured high-resolution solar irradiance data.

14 SOLAR ENERGY↗

A Review of High-Order and Optimized Finite-Difference Methods for Simulating Linear Wave Phenomena

This paper presents a review of high-order and optimized finite-difference methods for numerically simulating the propagation and scattering of linear waves, such as electromagnetic, acoustic, or elastic waves. The spatial operators reviewed include compact schemes, non-compact schemes, schemes on staggered grids, and schemes which are optimized to produce specific characteristics. The time-marching methods discussed include Runge-Kutta methods, Adams-Bashforth methods, and the leapfrog method. In addition, the following fourth-order fully-discrete finite-difference methods are considered: a one-step implicit scheme with a three-point spatial stencil, a one-step explicit scheme with a five-point spatial stencil, and a two-step explicit scheme with a five-point spatial stencil. For each method studied, the number of grid points per wavelength required for accurate simulation of wave propagation over large distances is presented. Recommendations are made with respect to the suitability of the methods for specific problems and practical aspects of their use, such as appropriate Courant numbers and grid densities. Avenues for future research are suggested.

Zingg, David W.↗

Multi-plane moment-of-fluid interface reconstruction in 3D

Moment-of-fluid (MOF) methods for interface reconstruction approximate the region occupied by material in each mesh element only through reference to its geometric moments. Here, we present a 3D MOF method that represents the material (POM) in each cell as the convex intersection of the cell and multiple half-spaces, each selected to minimize the least-squares error between computed moments of the approximated material and provided reference moments. This optimization problem is highly non-linear and non-convex, making the numerical result very sensitive to the initial guess. To create an effective initial guess in each cell, we construct an ellipsoid from 0th–2nd order reference moments such that its shape corresponds with that of the POM. Within this ellipsoid we inscribe a polyhedron, and initialize the minimization problem with the half-spaces defined by each of its faces. The inscribed polyhedron has minimally 4 faces, and using up to 3rd order moments permits optimization over up to 20 unknown values. We therefore define MOF methods that utilize 4, 5, or 6 half-spaces, correspondingly initialized with the faces of a single inscribed tetrahedron, triangular prism, or hexahedron. Stability of the non-linear optimization is further improved with a prepossessing step that normalizes the reference moments according to the axes of the reference ellipsoid. Using this approach, the non-linear least-squares solver reliably converges to a near-global minimum from a single initial guess. We demonstrate accuracy and robustness using single-cell and multi-cell examples over a wide spectrum of geometry. In particular, we demonstrate our ability to exactly reproduce several important and complex features defined by up to four half-spaces, such as corners, filaments, filament tips, and embedded material in the cell.

3D interface reconstruction↗

A State-Space Approach to Optimal Level-Crossing Prediction for Linear Gaussian Processes

In many complex engineered systems, the ability to give an alarm prior to impending critical events is of great importance. These critical events may have varying degrees of severity, and in fact they may occur during normal system operation. In this article, we investigate approximations to theoretically optimal methods of designing alarm systems for the prediction of level-crossings by a zero-mean stationary linear dynamic system driven by Gaussian noise. An optimal alarm system is designed to elicit the fewest false alarms for a fixed detection probability. This work introduces the use of Kalman filtering in tandem with the optimal level-crossing problem. It is shown that there is a negligible loss in overall accuracy when using approximations to the theoretically optimal predictor, at the advantage of greatly reduced computational complexity. I

Martin, Rodney Alexander↗

Non‐Linear Optical Properties of the ( RE ) 3 CuGeS 7 Family of Compounds

Abstract Non‐linear optical materials must possess a balanced combination of laser‐induced damage threshold (LDT) and second‐harmonic generation (SHG) and be phase matchable. In our previous work, chiral and polar La 3 CuGeS 7 was identified as a promising non‐linear optical material. Herein, we report the optimization of non‐linear optical properties through replacement of La with smaller lanthanides. It is determined that Gd 3 CuGeS 7 exhibits the best combination of SHG (1.6× AgGaS 2 at 88–105 μm particle size) and LDT (3× AgGaS 2 , 89 MW/cm 2 ) and is phase matchable. Based on changes in metal‐sulfur bond lengths and angles, we further propose structural optimization through solid‐solution formation and doping.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Robust Neighboring Optimal Guidance for the Advanced Launch System

In recent years, optimization has become an engineering tool through the availability of numerous successful nonlinear programming codes. Optimal control problems are converted into parameter optimization (nonlinear programming) problems by assuming the control to be piecewise linear, making the unknowns the nodes or junction points of the linear control segments. Once the optimal piecewise linear control (suboptimal) control is known, a guidance law for operating near the suboptimal path is the neighboring optimal piecewise linear control (neighboring suboptimal control). Research conducted under this grant has been directed toward the investigation of neighboring suboptimal control as a guidance scheme for an advanced launch system.

Hull, David G.↗

Some optimal considerations in attitude control systems

The conventional six-engine reaction control jet relay attitude control law with deadband is shown to be a good linear approximation to a weighted time-fuel optimal control law. Techniques for evaluating the value of the relative weighting between time and fuel for a particular relay control law is studied along with techniques to interrelate other parameters for the two control laws. Vehicle attitude control laws employing control moment gyros are then investigated. Steering laws obtained from the expression for the reaction torque of the gyro configuration are compared to a total optimal attitude control law that is derived from optimal linear regulator theory. This total optimal attitude control law has computational disadvantages in the solving of the matrix Riccati equation. Several computational algorithms for solving the matrix Riccati equation are investigated with respect to accuracy, computational storage requirements, and computational speed.

Boland, J. S., III↗