Search NASA⌕ Search

SEARCH · Search NASA

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 1,207 records · Page 67

Automated Meteor Fluxes with a Wide-Field Meteor Camera Network

Within NASA, the Meteoroid Environment Office (MEO) is charged to monitor the meteoroid environment in near ]earth space for the protection of satellites and spacecraft. The MEO has recently established a two ]station system to calculate automated meteor fluxes in the millimeter ]size ]range. The cameras each consist of a 17 mm focal length Schneider lens on a Watec 902H2 Ultimate CCD video camera, producing a 21.7 x 16.3 degree field of view. This configuration has a red ]sensitive limiting meteor magnitude of about +5. The stations are located in the South Eastern USA, 31.8 kilometers apart, and are aimed at a location 90 km above a point 50 km equidistant from each station, which optimizes the common volume. Both single station and double station fluxes are found, each having benefits; more meteors will be detected in a single camera than will be seen in both cameras, producing a better determined flux, but double station detections allow for non ]ambiguous shower associations and permit speed/orbit determinations. Video from the cameras are fed into Linux computers running the ASGARD (All Sky and Guided Automatic Real ]time Detection) software, created by Rob Weryk of the University of Western Ontario Meteor Physics Group. ASGARD performs the meteor detection/photometry, and invokes the MILIG and MORB codes to determine the trajectory, speed, and orbit of the meteor. A subroutine in ASGARD allows for the approximate shower identification in single station meteors. The ASGARD output is used in routines to calculate the flux in units of #/sq km/hour. The flux algorithm employed here differs from others currently in use in that it does not assume a single height for all meteors observed in the common camera volume. In the MEO system, the volume is broken up into a set of height intervals, with the collecting areas determined by the radiant of active shower or sporadic source. The flux per height interval is summed to obtain the total meteor flux. As ASGARD also computes the meteor mass from the photometry, a mass flux can be also calculated. Weather conditions in the southeastern United States are seldom ideal, which introduces the difficulty of a variable sky background. First a weather algorithm indicates if sky conditions are clear enough to calculate fluxes, at which point a limiting magnitude algorithm is employed. The limiting magnitude algorithm performs a fit of stellar magnitudes vs camera intensities. The stellar limiting magnitude is derived from this and easily converted to a limiting meteor magnitude for the active shower or sporadic source.

Blaauw, R. C.↗

Optimal actuator placement in adaptive precision trusses

Actuator placement in adaptive truss structures is to cater to two needs: displacement control of precision points and preloading the elements to overcome joint slackness. Due to technological and financial considerations, the number of actuators available is much less than the degrees of freedom of precision points to be controlled and the degree of redundancy of the structure. An approach for optimal actuator location is outlined. Test cases to demonstrate the effectiveness of the scheme are applied to the Precision Segmented Reflector Truss.

Baycan, C. M.↗

Trajectory Optimization for the Virtual Telescope for X-Ray Observations

The Virtual Telescope for X-Ray Observations (VTXO) is a long focal length telescope which promises to provide orders of magnitude improvement in angular resolution in the X-ray band. VTXO will include a Phased Fresnel Lens (PFL), which provides nearly diffraction-limited imaging, with a 1 km focal length. The PFL is carried by the Optics Spacecraft, which flies in a formation with the Detector Spacecraft, approximating a rigid telescope body. In order to maintain the formation requirements, while pointing the telescope axis at the desired astronomical targets, one spacecraft will be traveling on a non-natural trajectory, requiring the vehicle to maneuver regularly to maintain the telescope pointing. If care is not taken in the trajectory design, these paths result in large propellant consumption. However, there is an opportunity to optimize trajectories when re-arranging the formation between different astronomical targets. This paper presents an optimization scheme for re-pointing the telescope, utilizing a non-traditional path-based cost function to solve the propellant optimal trajectory. The resulting trajectories show a factor of four improvement in propellant consumption compared to the baseline. The optimization techniques developed for VTXO are applicable to orbits ranging from low-Earth orbit, to highly eccentric Earth orbits, and Lagrange point orbits.

Kyle Rankin↗

CFD-Guided Combustion System Optimization of a Gasoline Range Fuel in a Heavy-Duty Compression Ignition Engine Using Automatic Piston Geometry Generation and a Supercomputer

A computational fluid dynamics (CFD) guided combustion system optimization was conducted for a heavy-duty diesel engine running with a gasoline fuel that has a research octane number (RON) of 80. The goal was to optimize the gasoline compression ignition (GCI) combustion recipe (piston bowl geometry, injector spray pattern, in-cylinder swirl motion, and thermal boundary conditions) for improved fuel efficiency while maintaining engine-out NO x within a 1-1.5 g/kW-hr window. The numerical model was developed using the multi-dimensional CFD software CONVERGE. A two-stage design of experiments (DoE) approach was employed with the first stage focusing on the piston bowl shape optimization and the second addressing refinement of the combustion recipe. For optimizing the piston bowl geometry, a software tool, CAESES, was utilized to automatically perturb key bowl design parameters. This led to the generation of 256 combustion chamber designs evaluated at several engine operating conditions. The second DoE campaign was conducted to optimize injector spray patterns, fuel injection strategies and in-cylinder swirl motion for the best performing piston bowl designs from the first DoE campaign. This comprehensive optimization study was performed on a supercomputer, Mira, to accelerate the development of an optimized fuel-efficiency focused design. Compared to the production combustion system in the baseline engine, the new combustion recipe from this study showed significantly improved closed-cycle fuel efficiency across key engine operating points while meeting the engine-out NO x targets. Optimized piston bowl designs and injector spray patterns were predicted to provide enhanced in-cylinder air utilization and more rapid mixing-controlled combustion, thereby leading to a fuel efficiency improvement. In addition, shifting the engine thermal boundary conditions toward leaner operation was also key to the improved fuel efficiency.

33 ADVANCED PROPULSION SYSTEMS↗

Optimal autorotational descent of a helicopter with control and state inequality constraints

A point-mass model of the OH-58A helicopter has been used to ascertain the autorotation profiles which minimize helicopter impact velocity while remaining within the bounds of the main rotor's collective pitch and angular speed. The optimal control strategies are comparable to those employed by pilots in autorotational landings. It is noted that a possibility exists for the reduction of the height-sink rate restriction zone of OH-58A helicopters, using optimal energy-management techniques.

Lee, Allan Y.↗

Multi-core and many-core shared-memory parallel raycasting volume rendering optimization and tuning

Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. In addition, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

97 MATHEMATICS AND COMPUTING↗

Multi-core and Many-core Shared-memory Parallel Raycasting Volume Rendering Optimization and Tuning

Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. And, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

97 MATHEMATICS AND COMPUTING↗

Spectral properties of three-dimensional Anderson model

The three-dimensional Anderson model represents a paradigmatic model to understand the Anderson localization transition. In this work we first review some key results obtained for this model in the past 50 years, and then study its properties from the perspective of modern numerical approaches. Our main focus is on the quantitative comparison between the level sensitivity statistics and the level statistics. While the former studies the sensitivity of Hamiltonian eigenlevels upon inserting a magnetic flux, the latter studies the properties of unperturbed eigenlevels. We define two versions of dimensionless conductance, the first corresponding to the width of the level curvature distribution relative to the mean level spacing, and the second corresponding to the ratio of the Heisenberg time and the Thouless time obtained from the spectral form factor. We show that both conductances look remarkably similar around the localization transition, in particular, they predict a nearly identical critical point consistent with other well-established measures of the transition. We then study some further properties of those quantities: for level curvatures, we discuss particular similarities and differences between the width of the level curvature distribution and the characteristic energy studied by Edwards and Thouless (1972) in their pioneering work, in which the hopping at one lattice edge is changed from periodic to antiperiodic boundary conditions. In the context of the spectral form factor, we show that at the critical point it enters a broad time-independent regime, in which its value is consistent with the level compressibility obtained from the level variance. Finally, we test the scaling solution of the average level spacing ratio in the crossover regime using the cost function minimization approach introduced recently in Šuntajs et al. (2020). The latter approach seeks for the optimal scaling solution in the vicinity of the crossing point, while at the same time it allows for the crossing point to drift due to finite-size corrections. We find that the extracted transition point and the scaling coefficient agree with those from the literature to high numerical accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mission design for a halo orbiter of the earth

The International Sun-Earth Explorer (ISEE) scientific satellite to be stationed in 1978 in the vicinity of the sun-earth interior libration point to continuously monitor the space between the sun and the earth, including the distant geomagnetic tail is described. Orbit selection considerations for the ISEE-C are discussed along with stationkeeping requirements and fuel-optimal trajectories. Due to the alignment of the interior libration point with the sun as viewed from the earth, it will be necessary to place the satellite into a 'halo orbit' around the libration point, in order to eliminate solar interference with down-link telemetry. Parametric data for transfer trajectories between an earth parking orbit (altitude about 185 km) and a libration-point orbit are presented. It is shown that the insertion magnitude required for placing a satellite into an acceptable halo orbit is rather modest.

Farquhar, R. W.↗

Sequential linear integer programming for integer optimal control with total variation regularization

We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.

97 MATHEMATICS AND COMPUTING↗

Aerodynamic shape optimization using sensitivity analysis on third-order Euler equations

Two major advancements of an aerodynamic optimization method with two design variables are described. The first is represnted by an improved flow prediction method that uses the third-order accurate discretization of the Euler equations. This method makes it possible to predict the flowfield of a perturbed shape which generates shocks and other large gradients without intermediate CFD analysis. The second advancement is the use of every surface grid point as a design variable in the aerodynamic shape optimization problem. The improved algorithm is demonstrated by optimizing the ramp shape of a scramjet-afterbody configuration for maximum axial thrust. It is concluded that the improved flow-field prediction method eliminates most of the flow analysis and a priori guessing of all possible shapes from which the optimum is to be selected.

Baysal, Oktay↗

Optimal helicopter trajectory planning for terrain following flight

Helicopters operating in high threat areas have to fly close to the earth surface to minimize the risk of being detected by the adversaries. Techniques are presented for low altitude helicopter trajectory planning. These methods are based on optimal control theory and appear to be implementable onboard in realtime. Second order necessary conditions are obtained to provide a criterion for finding the optimal trajectory when more than one extremal passes through a given point. A second trajectory planning method incorporating a quadratic performance index is also discussed. Trajectory planning problem is formulated as a differential game. The objective is to synthesize optimal trajectories in the presence of an actively maneuvering adversary. Numerical methods for obtaining solutions to these problems are outlined. As an alternative to numerical method, feedback linearizing transformations are combined with the linear quadratic game results to synthesize explicit nonlinear feedback strategies for helicopter pursuit-evasion. Some of the trajectories generated from this research are evaluated on a six-degree-of-freedom helicopter simulation incorporating an advanced autopilot. The optimal trajectory planning methods presented are also useful for autonomous land vehicle guidance.

Menon, P. K. A.↗

Observations Regarding Use of Advanced CFD Analysis, Sensitivity Analysis, and Design Codes in MDO

Observations regarding the use of advanced computational fluid dynamics (CFD) analysis, sensitivity analysis (SA), and design codes in gradient-based multidisciplinary design optimization (MDO) reflect our perception of the interactions required of CFD and our experience in recent aerodynamic design optimization studies using CFD. Sample results from these latter studies are summarized for conventional optimization (analysis - SA codes) and simultaneous analysis and design optimization (design code) using both Euler and Navier-Stokes flow approximations. The amount of computational resources required for aerodynamic design using CFD via analysis - SA codes is greater than that required for design codes. Thus, an MDO formulation that utilizes the more efficient design codes where possible is desired. However, in the aerovehicle MDO problem, the various disciplines that are involved have different design points in the flight envelope; therefore, CFD analysis - SA codes are required at the aerodynamic 'off design' points. The suggested MDO formulation is a hybrid multilevel optimization procedure that consists of both multipoint CFD analysis - SA codes and multipoint CFD design codes that perform suboptimizations.

Newman, Perry A.↗

Pyomo : Python Optimization Modeling Objects.

The Python Optimization Modeling Objects (Pyomo) package [1] is an open source tool for modeling optimization applications within Python. Pyomo provides an objected-oriented approach to optimization modeling, and it can be used to define symbolic problems, create concrete problem instances, and solve these instances with standard solvers. While Pyomo provides a capability that is commonly associated with algebraic modeling languages such as AMPL, AIMMS, and GAMS, Pyomo's modeling objects are embedded within a full-featured high-level programming language with a rich set of supporting libraries. Pyomo leverages the capabilities of the Coopr software library [2], which integrates Python packages (including Pyomo) for defining optimizers, modeling optimization applications, and managing computational experiments. A central design principle within Pyomo is extensibility. Pyomo is built upon a flexible component architecture [3] that allows users and developers to readily extend the core Pyomo functionality. Through these interface points, extensions and applications can have direct access to an optimization model's expression objects. This facilitates the rapid development and implementation of new modeling constructs and as well as high-level solution strategies (e.g. using decomposition- and reformulation-based techniques). In this presentation, we will give an overview of the Pyomo modeling environment and model syntax, and present several extensions to the core Pyomo environment, including support for Generalized Disjunctive Programming (Coopr GDP), Stochastic Programming (PySP), a generic Progressive Hedging solver [4], and a tailored implementation of Bender's Decomposition.

99 GENERAL AND MISCELLANEOUS↗

An Experimental and Analytical Evaluation of a Biaxial Test for Determining Shear Properties of Composite Materials

The results of an experimental and analytical investigation of a biaxial tension/compression test for determining shear properties of composite materials are reported. Using finite element models of isotropic and orthotropic laminates, a specimen geometry was optimized. A kinematic fixture was designed to introduce an equal and opposite pair of forces into a specimen with a one inch square test section. Aluminum and several composite laminates with the optimized geometry and a configuration with large stress gradients were tested in the fixture. The specimens were instrumented with strain gages in the center of the test section for shear stiffness measurements. Pure shear strain was measured. The results from the experiments correlated well with finite element results. Failure of the specimens occurred through the center of the test section and appeared to have initiated at the high stress points. The results lead to the conclusion that the optimized specimen is suitable for determining shear modulus for composite materials. Further revisions to the specimen geometry are necessary if the method is to give shear strength data.

Kennedy, John M.↗

Adaptive Learning for Reliability Analysis using Support Vector Machines

A novel algorithm is presented for adaptive learning of an unknown function that separates two regions of a domain.In the context of reliability analysis these two regions represent the failure domain, where a set of constraints or requirements are violated, and a safe domain where they are satisfied. The Limit State Function (LSF) separates these two regions. Evaluating the constraints for a given parameter point requires the evaluation of a computational model that may well be expensive. For this reason we wish to construct a meta-model that can estimate the LSFas accurately as possible, using only a limited amount of training data. This work presents an adaptive strategy employing a Support Vector Machine (SVM) as a meta-model to provide a semi-algebraic approximation of the LSF.We describe an optimization process that is used to select informative parameter points to add to training data at each iteration to improve the accuracy of this approximation. A formulation is introduced for bounding the predictions of the meta-model; in this way we seek to incorporate this aspect of Gaussian Process Models (GPMs) within anSVM meta-model. Finally, we apply our algorithm to two benchmark test cases, demonstrating performance that is comparable with, if not superior, to a standard technique for reliability analysis that employs GPMs

Adaptive learning↗

Feedback Implementation of Zermelo's Optimal Control by Sugeno Approximation

This paper proposes an approach to implement optimal control laws of nonlinear systems in real time. Our methodology does not require solving two-point boundary value problems online and may not require it off-line either. The optimal control law is learned using the original Sugeno controller (OSC) from a family of optimal trajectories. We compare the trajectories generated by the OSC and the trajectories yielded by the optimal feedback control law when applied to Zermelo's ship steering problem.

Clifton, C.↗