SEARCH · Engineering Papers

Results for “Point 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 541 records · Page 30

All sources NASA NTRS DOE OSTI

NASA NTRS1981

The International Solar Polar Mission - A problem in constrained optimization

The International Solar Polar Mission is sponsored jointly by NASA and the European Space Agency to study the sun and the solar environment from a new vantage point. Trajectories far out of the ecliptic plane are achieved by a gravity assist from Jupiter which sends the spacecraft back over the poles of the sun. The process for optimizing these trajectories is described. From the point of view of trajectory design, performance is measured by the time spent at high heliographic latitudes, but many trajectory constraints must be met to ensure spacecraft integrity and good scientific return. The design problem is tractable by closely approximating integrated trajectories with specially calibrated conics. Then the optimum trajectory is found primarily by graphical methods, which were easy to develop and use and are highly adaptable to changes in the plan of the mission.

Sweetser, T. H., III↗

NASA NTRS1998

Design of Three-Dimensional Hypersonic Inlets with Rectangular to Elliptical Shape Transition

A methodology has been devised for the design of three-dimensional hypersonic inlets which include a rectangular to elliptical shape transition. This methodology makes extensive use of inviscid streamtracing techniques to generate a smooth shape transition from a rectangular-like capture to an elliptical throat. Highly swept leading edges and a significantly notched cowl enable use of these inlets in fixed geometry configurations. The design procedure includes a three dimensional displacement thickness calculation and uses established correlations to check for boundary layer separation due to shock wave interactions. Complete details of the design procedure are presented and the characteristics of a modular inlet with rectangular to elliptical shape transition and a design point of Mach 7.1 are examined. Comparison with a classical two-dimensional inlet optimized for maximum total pressure recovery indicates that this three-dimensional inlet demonstrates good performance even well below its design point.

Smart, M. K.↗

NASA NTRS2002

Designing a Unique Single Point Cross Over Method

The idea behind genetic algorithms is to extract optimization strategies nature uses successfully - known as Darwinian Evolution - and transform them for application in mathematical optimization theory to find the global optimum in a defined phase space. One could imagine a population of individual 'explorers' sent into the optimization phase-space. Each explorer is defined by its genes, what means, its position inside the phase-space is coded in his genes. Every explorer has the duty to find a value of the quality of his position in the phase space. (Consider the phase-space being a number of variables in some technological process, the value of quality of any position in the phase space - in other words: any set of the variables - can be expressed by the yield of the desired chemical product.) Then the struggle of 'life' begins. The three fundamental principles are selection, mating/crossover, and mutation. Only explorers (= genes) sitting on the best places will reproduce and create a new population. This is performed in the second step (mating/crossover). The 'hope' behind this part of the algorithm is, that 'good' sections of two parents will be recombined to yet better fitting children. In fact, many of the created children will not be successful (as in biological evolution), but a few children will indeed fulfill this hope. These good sections are named in some publications as building blocks. Now there appears a problem. Repeating these steps, no new area would be explored. The two former steps would only exploit the already known regions in the phase space, which could lead to premature convergence of the algorithm with the consequence of missing the global optimum by exploiting some local optimum. The third step, mutation, ensures the necessary accidental effects. One can imagine the new population being mixed up a little bit to bring some new information into this set of genes. Whereas in biology a gene is described as a macro-molecule with four different bases to code the genetic information, a gene in genetic algorithms is usually defined as a bitstring (a sequence of b 1's and 0's).

Wilson, Richard Phillip↗

NASA NTRSDate not supplied

Strategic Planning with Unscented Optimal Guidance for Urban Air Mobility

This study proposes a strategic trajectory planning framework to support development of Urban Air Mobility (UAM) traffic networks and optimization of UAM aircraft trajectories that are robust to uncertain wind fields. The development of UAM traffic networks considers static aviation constraints and dynamic weather constraints in urban airspace and the connections to ground transportation networks for preliminary selection of feasible time-optimal routes. The trajectory optimization of UAM aircraft utilizes an unscented optimal guidance approach to generate cost-optimal trajectories constrained on the selected sigma values of probability distribution of uncertain wind fields while ensuring that the end-point constraints are met for reducing wind-induced trajectory uncertainty. Unscented guidance commands are assessed based on trajectory perturbations at subsequent end-points in various wind fields by conducting Monte Carlo simulations.An example of wind-optimal UAM corridor and the associated trajectory-based operation volume is created utilizing the perturbations of the unscented trajectories for preliminary assessment of required aircraft separation minima without knowledge of aircraft navigation performance.

Strategic Planning↗

NASA NTRS1973

A fine pointing system for the large space telescope

The large space telescope (LST) developed by NASA requires ultrahigh pointing stability within 0.0005 arc sec rms. A fine guidance system is proposed to body-point the entire spacecraft within this limit. The spacecraft is modeled as a rigid body having reaction wheel actuators and subject to gravitational and magnetic disturbance torques. The fine guidance sensor is cluttered with electronic noise. The disturbance accommodation standard deviation optimal controller (DASOC) is designed to be optimal with respect to the transient and the steady state response to noise, whereas the steady state response to deterministic external torques is exactly zero. Compared with conventional controllers, the fine guidance system with the DASOC offers as much as a factor of 30 improvement in pointing stability, resulting in an optimal performance of nearly 0.0001 arc sec rms. Thus, the required pointing stability can easily be obtained, and a large margin remains for the compensation of possibile deteriorations.

Schiehlen, W. O.↗

NASA NTRS2013

Automatic Data Filter Customization Using a Genetic Algorithm

This work predicts whether a retrieval algorithm will usefully determine CO2 concentration from an input spectrum of GOSAT (Greenhouse Gases Observing Satellite). This was done to eliminate needless runtime on atmospheric soundings that would never yield useful results. A space of 50 dimensions was examined for predictive power on the final CO2 results. Retrieval algorithms are frequently expensive to run, and wasted effort defeats requirements and expends needless resources. This algorithm could be used to help predict and filter unneeded runs in any computationally expensive regime. Traditional methods such as the Fischer discriminant analysis and decision trees can attempt to predict whether a sounding will be properly processed. However, this work sought to detect a subsection of the dimensional space that can be simply filtered out to eliminate unwanted runs. LDAs (linear discriminant analyses) and other systems examine the entire data and judge a "best fit," giving equal weight to complex and problematic regions as well as simple, clear-cut regions. In this implementation, a genetic space of "left" and "right" thresholds outside of which all data are rejected was defined. These left/right pairs are created for each of the 50 input dimensions. A genetic algorithm then runs through countless potential filter settings using a JPL computer cluster, optimizing the tossed-out data s yield (proper vs. improper run removal) and number of points tossed. This solution is robust to an arbitrary decision boundary within the data and avoids the global optimization problem of whole-dataset fitting using LDA or decision trees. It filters out runs that would not have produced useful CO2 values to save needless computation. This would be an algorithmic preprocessing improvement to any computationally expensive system.

Mandrake, Lukas↗

NASA NTRS1991

Performance optimization of helicopter rotor blades

As part of a center-wide activity at NASA Langley Research Center to develop multidisciplinary design procedures by accounting for discipline interactions, a performance design optimization procedure is developed. The procedure optimizes the aerodynamic performance of rotor blades by selecting the point of taper initiation, root chord, taper ratio, and maximum twist which minimize hover horsepower while not degrading forward flight performance. The procedure uses HOVT (a strip theory momentum analysis) to compute the horse power required for hover and the comprehensive helicopter analysis program CAMRAD to compute the horsepower required for forward flight and maneuver. The optimization algorithm consists of the general purpose optimization program CONMIN and approximate analyses. Sensitivity analyses consisting of derivatives of the objective function and constraints are carried out by forward finite differences. The procedure is applied to a test problem which is an analytical model of a wind tunnel model of a utility rotor blade.

Walsh, Joanne L.↗

NASA NTRS1991

Controls of interaction dynamics of orbital assembly

Building structures and spacecraft in orbit will require technologies for positioning, docking/berthing, and joining orbital structures. A fundamental problem underlying the operation of docking and berthing is that of controlling the contact dynamics of mechanical structures actuated by active mechanisms such as robotic devices. Control systems must be designed to control these active mechanisms so that both the free space motions and contact motions are stable and satisfy specifications on position accuracy and bounds on contact forces. For the large orbital structures of the future, the problem of interactive dynamics and control is fundamentally different in several ways than it was for spacecraft docking in the past. First, future space structures must be treated as flexible structures - the operations of docking, berthing, and assembly will need to respect the vibrations of the structures. Second, the assembly of these structures will require multiple-point contact, rather than the essentially single-point positioning of conventional spacecraft docking. Third, some assembly operations require the subassemblies to be brought and held in contact so that successful joining can be accomplished. A preliminary study of contact stability and compliance control design has resulted in the development of an analytical method and a design method to analyze stability. The analytical method analyzes the problem of stability when an actively-controlled structure contacts a passive structure. This method makes it possible to accurately estimate the stiffness of the passive structures with which the contact motion will become unstable. The analytic results suggest that passivity is neither achievable in practice, nor necessary as a design concept. A contact control system need only be passive up to a certain frequency; beyond that frequency the system can be stabilized with sufficiently small gains. With this concept the Center developed a design methodology for achieving desired compliant contact motions. This design method is based on H-infinity norm optimization, which makes it possible to consider both driving point mechanical impedance and systems robustness to modeling uncertainty. A laboratory facility was set up to verify experimentally the analytical and design theory.

Su, Renjeng↗

NASA NTRS2013

Powered Descent Guidance with General Thrust-Pointing Constraints

The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.

Carson, John M., III↗

NASA NTRS2004

Reducing Errors by Use of Redundancy in Gravity Measurements

A methodology for improving gravity-gradient measurement data exploits the constraints imposed upon the components of the gravity-gradient tensor by the conditions of integrability needed for reconstruction of the gravitational potential. These constraints are derived from the basic equation for the gravitational potential and from mathematical identities that apply to the gravitational potential and its partial derivatives with respect to spatial coordinates. Consider the gravitational potential in a Cartesian coordinate system {x1,x2,x3}. If one measures all the components of the gravity-gradient tensor at all points of interest within a region of space in which one seeks to characterize the gravitational field, one obtains redundant information. One could utilize the constraints to select a minimum (that is, nonredundant) set of measurements from which the gravitational potential could be reconstructed. Alternatively, one could exploit the redundancy to reduce errors from noisy measurements. A convenient example is that of the selection of a minimum set of measurements to characterize the gravitational field at n3 points (where n is an integer) in a cube. Without the benefit of such a selection, it would be necessary to make 9n3 measurements because the gravitygradient tensor has 9 components at each point. The problem of utilizing the redundancy to reduce errors in noisy measurements is an optimization problem: Given a set of noisy values of the components of the gravity-gradient tensor at the measurement points, one seeks a set of corrected values - a set that is optimum in that it minimizes some measure of error (e.g., the sum of squares of the differences between the corrected and noisy measurement values) while taking account of the fact that the constraints must apply to the exact values. The problem as thus posed leads to a vector equation that can be solved to obtain the corrected values.

Kulikov, Igor↗

NASA NTRSDate not supplied

Sensitivity of Optimal Midcourse Correction Scheduling for Robust Cislunar Trajectory Design

A new approach to optimal trajectory design is the determination of optimal trajectories that are robust to initial trajectory dispersions, navigation errors, maneuver execution errors, and environment modeling errors. This paper investigates the sensitivity of cislunar robust optimal trajectory design to launch date, duration of navigation measurement passes, and navigation measurement frequency. For a given cislunar trajectory from translunar injection (TLI) to lunar orbit insertion (LOI), the optimal locations of midcourse corrections, also known as trajectory correction maneuvers (TCM) are determined by minimizing the final 3-σ ∆v subject to a final 3-σ position dispersion constraint for a given launch date, specified measurement pass duration prior to each maneuver, and measurement frequency. Optical navigation (OpNav) is assumed, and OpNav field-of-view (FOV) and lighting constraints are employed. These constraints turn out to be important elements of the problem. The sensitivity of the optimal TCM locations are then investigated by varying the launch date, duration of OpNav measurement passes, and the OpNav measurement frequency, and then re-optimizing the locations of the TCMs. Given the problem parameters provided herein, results show that while the optimal TCM locations with respect to TLI vary greatly from one launch date to another, their locations with respect to LOI are nearly invariant over a 2-month launch window. Results also show that in all cases the optimal location of the last TCM is found to be at the point where the OpNav lunar FOV constraint is first violated. For all other TCMs, OpNav measurement pass duration and measurement frequency can have a moderate to large affect on the optimal TCM locations.

Linear Covariance Analysis↗

NASA NTRS2003

Reliability Assessment of a Robust Design Under Uncertainty for a 3-D Flexible Wing

The paper presents reliability assessment results for the robust designs under uncertainty of a 3-D flexible wing previously reported by the authors. Reliability assessments (additional optimization problems) of the active constraints at the various probabilistic robust design points are obtained and compared with the constraint values or target constraint probabilities specified in the robust design. In addition, reliability-based sensitivity derivatives with respect to design variable mean values are also obtained and shown to agree with finite difference values. These derivatives allow one to perform reliability based design without having to obtain second-order sensitivity derivatives. However, an inner-loop optimization problem must be solved for each active constraint to find the most probable point on that constraint failure surface.

Gumbert, Clyde R.↗

NASA NTRS1993

Calculation of optimum airfoils using direct solutions of the Navier-Stokes equations

A method has been developed which calculates the optimum airfoil shape at a specified operating condition. The Reynolds-averaged Navier-Stokes equations with a turbulence model are used as the governing equations for the fluid flow, and are explicitly introduced into the optimization analysis as constraint equations. The locations of all grid points which define the surface of the airfoil are design variables, eliminating the need for shape functions to describe changes in the airfoil geometry. A generalized reduced-gradient method is used to find the optimum airfoil shape. The use of a direct solution technique (Newton's method) to solve the Navier-Stokes equations allows for the efficient solution of the problem. This paper describes the optimization method and presents sample results.

Felker, Fort F.↗

NASA NTRSDate not supplied

Providing Long-term Solar and Meteorological Resource Information from NASA Research through the GIS-Enabled POWER Web Services Portal

Solar and other renewable energy systems are optimized using geophysical parameters describing information about the solar resource and meteorological environments and how those environments may be changing in time. The Prediction of Worldwide Renewable Energy Resource (POWER) team at the NASA LaRC Research Center deployed its first version of the revitalized POWER geophysical parameter website that employs Esri Geographic Information System (GIS) tools. This web application provides access to both time series and climatological data sets spanning from a few days behind real-time back to the early 1980’s with a spatial resolution of 0.5 x 0.5 degree, thus extending over 30 years. The GIS tools enable, generate and store climatological averages using spatial queries and calculations in a spatial database resulting in greater accessibility to government agencies, industry and individuals. There is an API that provides data through a URL coding and can also invoked inside user software packages. Output data formats now include ASCII, CSV, geoTiff, JSON and .netCDF. Since May 2018, over 10.4 TB of data have been delivered to fulfill over 110 million data requests from 240,000 unique user IPs (https://power.larc.nasa.gov). This presentation provides an overview of this project and the current version of the new POWER web capabilities through to the end usage. Surface solar parameters are adapted from both the NASA/GEWEX (Global and Energy Water Cycle Exchange) SRB (Surface Radiation Budget) project and the CERES (Clouds and Earth’s Radiant Energy System) data products. The meteorological parameters are adapted from NASA’s MERRA-2 (Modern Era Retrospective-analysis for Research and Applications). We review uncertainty of various basic parameters using surface measurements. After the introduction, we specifically discuss various clusters of parameters for equator pointing tilted surfaces that provide for the estimation of optimal tilt angle by month and year. The discussion will emphasize a few examples of how solar and building engineers are using the data products. We will then preview the capabilities of Version 2 featuring examples of hourly solar and meteorological data products, customized user reports and expanded web mapping services from CERES data products. The web services provide a unique, expandable resource for renewable energy systems engineers to design, evaluate and optimize to environments worldwide.

Solar Resource↗

NASA NTRSDate not supplied

Fast Aircraft Separation Calculations for Gradient Based Optimization of Airspace Simulations

Simulations of airspace operational concepts can play a significant role in determining future paradigms that would allow for a safe increase in airspace density. In particular, airspace simulations which are capable of handling large numbers of aircraft act as an enabling capability for the testing of proposed airspace operational concepts. Simulations allowing for gradient based optimization methods are particularly attractive, since they would potentially allow for an efficient and empirical means to derive best operational practices. These could also allow for vehicle multidisciplinary design and optimization studies to include air traffic management considerations as a discipline. But any large scale simulation of airspace operations must include some methodology for addressing airspace separation requirements, which in the most direct sense would be tracked in a manner that computationally grows as a quadratic function of the number of simulated aircraft. Efficient indirect methods have been developed in certain contexts to address this limitation. However, any means of addressing separation requirements in a gradient based optimization context should be implemented by functions which provide analytic derivative information to maximize numerical precision and computational efficiency. In this paper, a fast and differentiable separation metric is described in application to gradient based optimization of airspace operations. Rather than computing the separation distance between every pair of aircraft in a simulation, this method effectively reduces the problem to a smaller relevant set using a geometric decomposition. This method guarantees that the smallest distance at all points in simulated time is determined exactly. When used in an optimization constraint context, this guarantees that a minimum separation is maintained between all pairs of aircraft. The presented metric has logarithmic computational growth with respect to the number of simulated aircraft, and is shown to perform well in a series of notional 2D airspace optimization problems when used to enforce specified airborne separation constraints. Results show that this is notably faster than a direct pairwise distance computing metric for optimizations involving both small and large numbers of aircraft, yet enforce separation requirements to the same tolerance. It is shown that this favorable scalability is an enabling capability for more sophisticated air traffic management conceptual studies.

Optimization↗

NASA NTRS2002

Closed-Loop Endoatmospheric Ascent Guidance

This paper will present a complete formulation of the optimal control problem for atmospheric ascent of rocket powered launch vehicles subject to usual load constraints and final condition constraints. We shall demonstrate that the classical finite difference method for two-point-boundary-value-problems (TPBVP) is suited for solving the ascent trajectory optimization problem in real time, therefore closed-loop optimal endoatmospheric ascent guidance becomes feasible. Numerical simulations with a the vehicle data of a reusable launch vehicle will be provided.

Lu, Ping↗

NASA NTRS1973

Optimal control of a variable spin speed CMG system for space vehicles

Many future NASA programs require very high accurate pointing stability. These pointing requirements are well beyond anything attempted to date. This paper suggests a control system which has the capability of meeting these requirements. An optimal control law for the suggested system is specified. However, since no direct method of solution is known for this complicated system, a computation technique using successive approximations is used to develop the required solution. The method of calculus of variations is applied for estimating the changes of index of performance as well as those constraints of inequality of state variables and terminal conditions. Thus, an algorithm is obtained by the steepest descent method and/or conjugate gradient method. Numerical examples are given to show the optimal controls.

Liu, T. C.↗

NASA NTRS1974

Control optimization of a lifting body entry problem by an improved and a modified method of perturbation function

A study of the solution problem of a complex entry optimization was studied. The problem was transformed into a two-point boundary value problem by using classical calculus of variation methods. Two perturbation methods were devised. These methods attempted to desensitize the contingency of the solution of this type of problem on the required initial co-state estimates. Also numerical results are presented for the optimal solution resulting from a number of different initial co-states estimates. The perturbation methods were compared. It is found that they are an improvement over existing methods.

Garcia, F., Jr.↗