Engineering Papers⌕ Search

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.

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

At least 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

Hierarchical Image Segmentation of Remotely Sensed Data using Massively Parallel GNU-LINUX Software

A hierarchical set of image segmentations is a set of several image segmentations of the same image at different levels of detail in which the segmentations at coarser levels of detail can be produced from simple merges of regions at finer levels of detail. In [1], Tilton, et a1 describes an approach for producing hierarchical segmentations (called HSEG) and gave a progress report on exploiting these hierarchical segmentations for image information mining. The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HSWO) approach to region growing, which was described as early as 1989 by Beaulieu and Goldberg. The HSWO approach seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing (e.g. Horowitz and T. Pavlidis, [3]). In addition, HSEG optionally interjects between HSWO region growing iterations, merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the utility of the segmentation results, especially for larger images, it also significantly increases HSEG s computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) was devised, which includes special code to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. The recursive nature of RHSEG makes for a straightforward parallel implementation. This paper describes the HSEG algorithm, its recursive formulation (referred to as RHSEG), and the implementation of RHSEG using massively parallel GNU-LINUX software. Results with Landsat TM data are included comparing RHSEG with classic region growing.

Tilton, James C.↗
NASA NTRS2007

An EOF Iteration Approach for Obtaining Homogeneous Radiative Fluxes from Satellites Observations

Conventional observations of climate parameters are sparse in space and/or in time and the representativeness of such information needs to be optimized. Observations from satellites provide improved spatial coverage than point observations however they pose new challenges for obtaining homogeneous coverage. Surface radiative fluxes, the forcing functions of the hydrologic cycle and biogeophysical processes, are now becoming available from global scale satellite observations. They are derived from independent satellite platforms and sensors that differ in temporal and spatial resolution and in the size of the footprint from which information is derived. Data gaps, degraded spatial resolution near boundaries of geostationary satellites, and different viewing geometries in areas of satellite overlap, could result in biased estimates of radiative fluxes. In this study, discussed will be issues related to the sources of inhomogeneity in surface radiative fluxes as derived from satellites; development of an approach to obtain homogeneous data sets; and application of the methodology to the widely used International Satellite Cloud Climatology Project (ISCCP) data that currently serve as a source of information for deriving estimates of surface and top of the atmosphere radiative fluxes. Introduced is an Empirical Orthogonal Function (EOF) iteration scheme for homogenizing the fluxes. The scheme is evaluated in several ways including comparison of the inferred radiative fluxes against ground observations, both before and after the EOF approach is applied. On the average, the latter reduces the rms error by about 2-3 W/m2.

Zhang, Banglin↗
NASA NTRS2007

Deep Space Transportation System Using the Sun-Earth L2 Point

Recently, various kinds of planetary explorations have become more feasible, taking the advantage of low thrust propulsion means such as ion engines that have come into practical use. The field of space activity has now been expanded even to the rim of the outer solar system. In this context, the Japan Aerospace Exploration Agency (JAXA) has started investigating a Deep Space Port built at the L2 Lagrange point in the Sun-Earth system. For the purpose of making the deep space port practically useful, there is a need to establish a method to making spaceship depart and return from/to the port. This paper first discusses the escape maneuvers originating from the L2 point under the restricted three-body problem. Impulsive maneuvers from the L2 point are extensively studied here, and using the results, optimal low-thrust escape strategies are synthesized. Furthermore, this paper proposes the optimal escape and acceleration maneuvers schemes using Electric Delta-V Earth Gravity Assist (EDVEGA) technique.

Matsumoto, Michihiro↗
NASA NTRS2016

A Proposed Ascent Abort Flight Test for the Max Launch Abort System

The NASA Engineering and Safety Center initiated the Max Launch Abort System (MLAS) Project to investigate alternate crew escape system concepts that eliminate the conventional launch escape tower by integrating the escape system into an aerodynamic fairing that fully encapsulates the crew capsule and smoothly integrates with the launch vehicle. This paper proposes an ascent abort flight test for an all-propulsive towerless escape system concept that is actively controlled and sized to accommodate the Orion Crew Module. The goal of the flight test is to demonstrate a high dynamic pressure escape and to characterize jet interaction effects during operation of the attitude control thrusters at transonic and supersonic conditions. The flight-test vehicle is delivered to the required test conditions by a booster configuration selected to meet cost, manufacturability, and operability objectives. Data return is augmented through judicious design of the boost trajectory, which is optimized to obtain data at a range of relevant points, rather than just a single flight condition. Secondary flight objectives are included after the escape to obtain aerodynamic damping data for the crew module and to perform a high-altitude contingency deployment of the drogue parachutes. Both 3- and 6-degree-of-freedom trajectory simulation results are presented that establish concept feasibility, and a Monte Carlo uncertainty assessment is performed to provide confidence that test objectives can be met.

Tartabini, Paul V.↗
NASA NTRS2019

Using Wind Observations from Nearby Aircraft to Update the Optimal Descent Trajectory in Real-Time

The ability to meet a controlled time of arrival during a continuous descent operation will enable environmentally friendly and fuel efficient descent operations while simultaneously maintaining airport throughput. However, if the wind forecast used to compute the initial trajectory plan is not accurate enough, the guidance system will need to correct time deviations from the plan during the execution of the descent. Previous work proposed an on-board guidance strategy based on model predictive control, which repeatedly updates the trajectory plan in real-time from the current aircraft state and for the remainder of the descent. However, the wind conditions downstream, at altitudes not explored yet, were difficult to predict due to the lack of data. This paper shows the potential benefits of using wind observations, broadcast by nearby aircraft, to reconstruct the wind profile downstream. The wind profile in the trajectory optimization problem is modeled as a spline, which control points are updated to fit the observations before re-planning the trajectory. Results from simulations using realistic wind data show that the performance of model predictive control significantly improves when including up-to-date wind observations, in terms of time and energy errors at the metering fix and fuel consumption.

Dalmau, Ramon↗
NASA NTRS2022

New Constraints on Titan's Stratospheric n-Butane Abundance

Curiously, n-butane has yet to be detected at Titan, though it is predicted to be present in a wide range of abundances that span over 2.5 orders of magnitude. We have searched infrared spectroscopic observations of Titan for signals from n-butane (n-C4H10) in Titan's stratosphere. Three sets of Cassini Composite Infrared Spectrometer Focal Plane 4 (1050–1500 cm−1) observations were selected for modeling, having been collected from different flybys and pointing latitudes. We modeled the observations with the Nonlinear Optimal Estimator for MultivariatE Spectral AnalySIS radiative transfer tool. Temperature profiles were retrieved for each of the data sets by modeling the ν4 emission from methane near 1305 cm−1. Then, incorporating the temperature profiles, we retrieved abundances of all of Titan's known trace gases that are active in this spectral region, reliably reproducing the observations. We then systematically tested a set of models with varying abundances of n-butane, investigating how the addition of this gas affected the fits. We did this for several different photochemically predicted abundance profiles from the literature, as well as for a constant-with-altitude profile. Ultimately, though we did not produce any firm detection of n-butane, we derived new upper limits on its abundance specific to the use of each profile and to multiple different ranges of stratospheric altitudes. These results will tightly constrain the C4 chemistry of future photochemical modeling of Titan's atmosphere and also motivate the continued search for n-butane and its isomer, isobutane.

Brendan L. Steffens↗
NASA NTRS2023

Advanced Information Systems Technology (AIST) Overview & Current and Recent Projects

"NASA's Advanced Information Systems Technology (AIST) Program identifies, develops, and supports adoption of software and information systems, as well as novel computer science technologies expected to be needed by the Earth Science Division in the 5-10-year timeframe. Overall, the AIST Program is focusing on advanced technologies and innovative concepts with three main objectives: O1. Enable new observation measurements and new observing systems design and operations through intelligent, timely, dynamic, and coordinated distributed sensing; O2. Enable agile science analyses that fully utilize the large amount of diverse observations using advanced analytic tools, visualizations, and computing environments, and that interact seamlessly with relevant observing systems; O3. Enable the development of integrated Earth Science frameworks that mirror the Earth with state-of-the-art models (Earth system models and others), timely and relevant observations, and analytic tools. This thrust will provide technology for enabling near- and long-term science and policy decisions (""""science decisions"""" including planning for the acquisition of new measurements; the development of new models or science analysis; the integration of Earth observations in novel ways; applications to inform choices, support decisions, and guide actions for societal benefit; etc.). AIST objectives aim at optimizing Earth Science mission return – NOS from an observation point of view and ACF/ESDT from an information analysis and utilization point of view. The assets and data accessed and utilized in these systems may come from NASA and non-NASA sources. "

Earth Science Remote Sensing; Information Systems↗
NASA NTRS2005

Point process algorithm: a new Bayesian approach for TPF-I planet signal extraction

TPF-I capability for planetary signal extraction, including both detection and spectral characterization, can be optimized by taking proper account of instrumental characteristics and astrophysical prior information. We have developed the Point Process Algorithm, a Bayesian technique for estracting planetary signals using the sine/cosine chopped outputs of a dual nulling interferometer.

stars↗
NASA NTRS1993

Integrated design of the CSI evolutionary structure: A verification of the design methodology

One of the main objectives of the Controls-Structures Interaction (CSI) program is to develop and evaluate integrated controls-structures design methodology for flexible space structures. Thus far, integrated design methodologies for a class of flexible spacecraft, which require fine attitude pointing and vibration suppression with no payload articulation, have been extensively investigated. Various integrated design optimization approaches, such as single-objective optimization, and multi-objective optimization, have been implemented with an array of different objectives and constraints involving performance and cost measures such as total mass, actuator mass, steady-state pointing performance, transient performance, control power, and many more. These studies have been performed using an integrated design software tool (CSI-DESIGN CODE) which is under development by the CSI-ADM team at the NASA Langley Research Center. To date, all of these studies, irrespective of the type of integrated optimization posed or objectives and constraints used, have indicated that integrated controls-structures design results in an overall spacecraft design which is considerably superior to designs obtained through a conventional sequential approach. Consequently, it is believed that validation of some of these results through fabrication and testing of a structure which is designed through an integrated design approach is warranted. The objective of this paper is to present and discuss the efforts that have been taken thus far for the validation of the integrated design methodology.

Maghami, Peiman G.↗
NASA NTRS2010

Robustness-Based Design Optimization Under Data Uncertainty

This paper proposes formulations and algorithms for design optimization under both aleatory (i.e., natural or physical variability) and epistemic uncertainty (i.e., imprecise probabilistic information), from the perspective of system robustness. The proposed formulations deal with epistemic uncertainty arising from both sparse and interval data without any assumption about the probability distributions of the random variables. A decoupled approach is proposed in this paper to un-nest the robustness-based design from the analysis of non-design epistemic variables to achieve computational efficiency. The proposed methods are illustrated for the upper stage design problem of a two-stage-to-orbit (TSTO) vehicle, where the information on the random design inputs are only available as sparse point and/or interval data. As collecting more data reduces uncertainty but increases cost, the effect of sample size on the optimality and robustness of the solution is also studied. A method is developed to determine the optimal sample size for sparse point data that leads to the solutions of the design problem that are least sensitive to variations in the input random variables.

Zaman, Kais↗
NASA NTRS1986

Optimization of Antenna-Structure Design

Conference paper describes application of optimality criterion to design of microwave dish antenna. For purpose of study, overall design objective is to minimize structural weight, subject to design constraints that antenna-pointing and microwave-path-length errors not exceed specified values. Design constraints and optimality criterion satisfied in same procedure.

Levy, R.↗
NASA NTRS1978

Spatial land-use inventory, modeling, and projection/Denver metropolitan area, with inputs from existing maps, airphotos, and LANDSAT imagery

A landscape model was constructed with 34 land-use, physiographic, socioeconomic, and transportation maps. A simple Markov land-use trend model was constructed from observed rates of change and nonchange from photointerpreted 1963 and 1970 airphotos. Seven multivariate land-use projection models predicting 1970 spatial land-use changes achieved accuracies from 42 to 57 percent. A final modeling strategy was designed, which combines both Markov trend and multivariate spatial projection processes. Landsat-1 image preprocessing included geometric rectification/resampling, spectral-band, and band/insolation ratioing operations. A new, systematic grid-sampled point training-set approach proved to be useful when tested on the four orginal MSS bands, ten image bands and ratios, and all 48 image and map variables (less land use). Ten variable accuracy was raised over 15 percentage points from 38.4 to 53.9 percent, with the use of the 31 ancillary variables. A land-use classification map was produced with an optimal ten-channel subset of four image bands and six ancillary map variables. Point-by-point verification of 331,776 points against a 1972/1973 U.S. Geological Survey (UGSG) land-use map prepared with airphotos and the same classification scheme showed average first-, second-, and third-order accuracies of 76.3, 58.4, and 33.0 percent, respectively.

Tom, C.↗
NASA NTRS1984

Composite laminate optimization program suitable for microcomputers

The design of a composite panel requires some way of finding the minimum thickness laminate which will withstand the load requirements without failure. The mathematical complexity of this problem dictates the use of nonlinear optimization techniques. Specialized laminate optimization programs were developed which are compact and efficient enough to run on microcomputers. Only stresses at a point and inplane loads and deflections are considered. The programs are simple to use and require no knowledge of optimization. Techniques are developed which find minimum thickness laminates with either ply ratios or ply angles as design variables. A method is presented for finding the optimum orientation for the axis of symmetry of an orthotropic laminate. The orthotropic laminate program uses an approximate failure theory, which speed up computations dramatically.

Flanagan, G. V.↗
NASA NTRS1990

Optimal trajectories based on linear equations

The Principal results of a recent theory of fuel optimal space trajectories for linear differential equations are presented. Both impulsive and bounded-thrust problems are treated. A new form of the Lawden Primer vector is found that is identical for both problems. For this reason, starting iteratives from the solution of the impulsive problem are highly effective in the solution of the two-point boundary-value problem associated with bounded thrust. These results were applied to the problem of fuel optimal maneuvers of a spacecraft near a satellite in circular orbit using the Clohessy-Wiltshire equations. For this case two-point boundary-value problems were solved using a microcomputer, and optimal trajectory shapes displayed. The results of this theory can also be applied if the satellite is in an arbitrary Keplerian orbit through the use of the Tschauner-Hempel equations. A new form of the solution of these equations has been found that is identical for elliptical, parabolic, and hyperbolic orbits except in the way that a certain integral is evaluated. For elliptical orbits this integral is evaluated through the use of the eccentric anomaly. An analogous evaluation is performed for hyperbolic orbits.

Carter, Thomas E.↗
NASA NTRSDate not supplied

Exploring Transfers Between Earth-Moon Halo Orbits via Multi-Objective Reinforcement Learning

Multi-Reward Proximal Policy Optimization, a multi-objective deep reinforcement learning algorithm, is used to examine the design space of low-thrust trajectories for a SmallSat transferring between two libration point orbits in the Earth-Moon system. Using Multi-Reward Proximal Policy Optimization, multiple policies are simultaneously and efficiently trained on three distinct trajectory design scenarios. Each policy is trained to create a unique control scheme based on the trajectory design scenario and assigned reward function: a unique combination of weights scaling competing objectives that guide the spacecraft to the target mission orbit, incentivize faster flight times, and penalize propellant mass usage. Then, the policies are evaluated on the same set of perturbed initial conditions in each scenario to generate the propellant mass usages, flight times, and state discontinuities from a reference trajectory for each control scheme. This solution space of low-thrust trajectories for a SmallSat is used to examine the multi-objective trade space for the trajectory design scenario. By autonomously constructing the solution space, insights into the required propellant mass, flight time, and transfer geometry are rapidly achieved.

Christopher J Sullivan↗
NASA NTRS2012

Recursive Branching Simulated Annealing Algorithm

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Bolcar, Matthew↗
NASA NTRS1987

An optimal output feedback gain variation scheme for the control of plants exhibiting gross parameter changes

A concept for optimally designing output feedback controllers for plants whose dynamics exhibit gross changes over their operating regimes was developed. This was to formulate the design problem in such a way that the implemented feedback gains vary as the output of a dynamical system whose independent variable is a scalar parameterization of the plant operating point. The results of this effort include derivation of necessary conditions for optimality for the general problem formulation, and for several simplified cases. The question of existence of a solution to the design problem was also examined, and it was shown that the class of gain variation schemes developed are capable of achieving gain variation histories which are arbitrarily close to the unconstrained gain solution for each point in the plant operating range. The theory was implemented in a feedback design algorithm, which was exercised in a numerical example. The results are applicable to the design of practical high-performance feedback controllers for plants whose dynamics vary significanly during operation. Many aerospace systems fall into this category.

Moerder, Daniel D.↗