SEARCH · Engineering Papers

Results for “Computational 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 613 records · Page 34

All sources NASA NTRS DOE OSTI

NASA NTRS1999

Nontangent, Developed Contour Bulkheads for a Wing-Body Single Stage Launch Vehicle

Dry weights for a SSTO vehicle which incorporates nontangent, developed contour bulkheads are estimated and compared to a baseline vehicle with 1.41 4 aspect ratio ellipsoidal bulkheads, Weights, volumes and heights of optimized bulkhead designs are computed using a preliminary design bulkhead analysis code. The dry weight of a vehicle which incorporates the optimized bulkheads is predicted using a vehicle weights and sizing code. Two optimization approaches are employed. A structural-level method, where the vehicle s three major bulkhead regions are optimized separately and then incorporated into a model for computation of the vehicle dry weight, predicts a reduction of 4365 Ib (2.2 percent) from the 200,679 Ib baseline vehicle dry weight. In the second, vehicle-level, approach, the vehicle dry weight is the objective function for the optimization. During the vehicle- level analysis, modified bulkhead designs are first analyzed, then incorporated into the weights model for computation of a dry weight. The optimizer simultaneously manipulates design variables for all three bulkheads to reduce the dry weight. The vehicle-level analysis predicts a dry weight reduction of 5129 Ib, a 2.6 percent reduction from the baseline value. These results suggest that nontangent, developed contour bulkheads may provide substantial weight savings for SSTO vehicles.

Wu, K. Chauncey↗

NASA NTRSDate not supplied

Optimal Sensor Mobility Design for Target Tracking with Distributed Sensing, Communication and Computing Infrastructure

The paper presents an airborne target tracking approach with data fusion from distributed stationary and mobile sensor network transmitted through a wireless/wired communication network and using a distributed computing infrastructure. To obtain high quality measurements, sensor flight platforms' positions and orientations are optimized with respect to the available target's position and velocity estimates, and a formation control strategy is applied to derive desired trajectories for the flight platforms. As sensors move, the communication network topology switching is determined using the worst-case approach to handle uncertainties in the target's and sensors' positions, which alters communication delays for sensors' data transmission to computing centers. An optimal data migration algorithm is periodically applied to determine these communication delays for each sensor and the optimal location with minimum end-to-end latency for the target tracking algorithm execution, which is based on adaptive information fusion from multi-modal mobile and stationary sensors inside an Extended Kalman Filter framework. The approach is validated in a desktop simulation environment using synthetic sensor data generated for a simulated target's flight.

Distributed sensing↗

NASA NTRS1991

A trajectory planning scheme for spacecraft in the space station environment

Simulated annealing is used to solve a minimum fuel trajectory problem in the space station environment. The environment is special because the space station will define a multivehicle environment in space. The optimization surface is a complex nonlinear function of the initial conditions of the chase and target crafts. Small permutations in the input conditions can result in abrupt changes to the optimization surface. Since no prior knowledge about the number or location of local minima on the surface is available, the optimization must be capable of functioning on a multimodal surface. It was reported in the literature that the simulated annealing algorithm is more effective on such surfaces than descent techniques using random starting points. The simulated annealing optimization was found to be capable of identifying a minimum fuel, two-burn trajectory subject to four constraints which are integrated into the optimization using a barrier method. The computations required to solve the optimization are fast enough that missions could be planned on board the space station. Potential applications for on board planning of missions are numerous. Future research topics may include optimal planning of multi-waypoint maneuvers using a knowledge base to guide the optimization, and a study aimed at developing robust annealing schedules for potential on board missions.

Soller, Jeffrey Alan↗

NASA NTRSDate not supplied

DeepONet-Assisted Optimization of Surface Topography for Transition Delay in a Mach 4.5 Boundary Layer

We use deep learning, an ensemble variational technique (EnVar), and direct numerical simulations(DNS) to design an optimal topography for a two-dimensional roughness element that delays the on-set of laminar-turbulent transition in a Mach 4.5 flat-plate boundary layer. Deep operator networks (DeepONets), which have the known ability to learn complex nonlinear operators within dynamical systems, are used for machine learning. For the baseline configuration of a smooth flat plate, the second-mode waves at the DNS inflow cause a quick nonlinear breakdown of the high-speed boundary layer within the computational domain. Results reported in the present study validate the ability of DeepONets to model the transition delay via a given topography of the roughness element. The computing cost to optimize the rough-ness element for minimal skin-friction drag is substantially lowered by the DeepONets-based reduced-order model. In comparison to the baseline method of EnVar optimization based on DNS alone, the DeepONets-based EnVar optimizer is able to delay transition past the outflow boundary of the computational domain while utilizing almost 5–6 times fewer DNS.

Machine Learning↗

NASA NTRS1984

Simultaneous analysis and design

Optimization techniques are increasingly being used for performing nonlinear structural analysis. The development of element by element (EBE) preconditioned conjugate gradient (CG) techniques is expected to extend this trend to linear analysis. Under these circumstances the structural design problem can be viewed as a nested optimization problem. There are computational benefits to treating this nested problem as a large single optimization problem. The response variables (such as displacements) and the structural parameters are all treated as design variables in a unified formulation which performs simultaneously the design and analysis. Two examples are used for demonstration. A seventy-two bar truss is optimized subject to linear stress constraints and a wing box structure is optimized subject to nonlinear collapse constraints. Both examples show substantial computational savings with the unified approach as compared to the traditional nested approach.

Haftka, R. T.↗

NASA NTRS1985

Simultaneous analysis and design

Haftka, R. T.↗

NASA NTRS1981

Piloted simulation of an on-board trajectory optimization algorithm

This paper will describe a real time piloted simulation of algorithms designed for on-board computation of time-optimal intercept trajectories for an F-8 aircraft. The algorithms, which were derived using singular perturbation theory, generate commands that are displayed to the pilot on flight director needles on the 8-ball. By flying the airplane so as to zero the horizontal and vertical needles, the pilot flies an approximation to a time-optimal intercept trajectory. The various display and computation modes that are available will be described and results will be presented illustrating the performance of the algorithms with a pilot in the loop.

Price, D. B.↗

NASA NTRS1988

Computer-aided design analysis of 57-mm, angular-contact, cryogenic turbopump bearings

The Space Shuttle main engine high-pressure oxygen turbopumps have not experienced the sevice life required of them. This insufficiency has been due in part to the shortened life of the bearings. To improve the life of the existing turbopump bearings, an effort is under way to investigate bearing modifications that could be retrofitted into the present bearing cavity. Several bearing parameters were optimized using the computer program SHABERTH, which performs a thermomechanical simulation of a load support system. The computer analysis showed that improved bearing performance is feasible if low friction coefficients can be attained. Bearing geometries were optimized considering heat generation, equilibrium temperatures, and relative life. Thermal gradients through the bearings were found to be lower with liquid lubrication than with solid film lubrication, and a liquid oxygen coolant flowrate of approximately 4.0 kg/s was found to be optimal. This paper describes the analytical modeling used to determine these feasible modifications to improve bearing performance.

Armstrong, Elizabeth S.↗

NASA NTRSDate not supplied

DeepONet-Assisted Optimization of Surface Topography for Transition Delay in A Mach 4.5 Boundary Layer

We use deep learning, an ensemble variationaltechnique (EnVar), and direct numerical simulations(DNS) to design an optimal topography for a two-dimensional roughness element that delays the on-set of laminar-turbulent transition in a Mach 4.5 flat-plate boundary layer. Deep operator networks (Deep-ONets), which have the known ability to learn com-plex nonlinear operators within dynamical systems,are used for machine learning. For the baseline config-uration of a smooth flat plate, the second-mode wavesat the DNS inflow cause a quick nonlinear breakdownof the high-speed boundary layer within the computa-tional domain. Results reported in the present studyvalidate the ability of DeepONets to model the tran-sition delay via a given topography of the roughnesselement. The computing cost to optimize the rough-ness element for minimal skin-friction drag is substan-tially lowered by the DeepONets-based reduced-ordermodel. In comparison to the baseline method of EnVaroptimization based on DNS alone, the DeepONets-based EnVar optimizer is able to delay transition pastthe outflow boundary of the computational domainwhile utilizing almost 5–6 times fewer DNS.

Machine Learning↗

NASA NTRS1982

Fuel optimal maneuvers of spacecraft about a circular orbit

Fuel optimal maneuvers of spacecraft relative to a body in circular orbit are investigated using a point mass model in which the magnitude of the thrust vector is bounded. All nonsingular optimal maneuvers consist of intervals of full thrust and coast and are found to contain at most seven such intervals in one period. Only four boundary conditions where singular solutions occur are possible. Computer simulation of optimal flight path shapes and switching functions are found for various boundary conditions. Emphasis is placed on the problem of soft rendezvous with a body in circular orbit.

Carter, T. E.↗

NASA NTRS1984

Fuel-optimal maneuvers of a spacecraft relative to a point in circular orbit

Carter, T. E.↗

NASA NTRS2011

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

NASA NTRS1973

Optimal low thrust geocentric transfer

A computer code which will rapidly calculate time-optimal low thrust transfers is being developed as a mission analysis tool. The final program will apply to NEP or SEP missions and will include a variety of environmental effects. The current program assumes constant acceleration. The oblateness effect and shadowing may be included. Detailed state and costate equations are given for the thrust effect, oblateness effect, and shadowing. A simple but adequate model yields analytical formulas for power degradation due to the Van Allen radiation belts for SEP missions. The program avoids the classical singularities by the use of equinoctial orbital elements. Kryloff-Bogoliuboff averaging is used to facilitate rapid calculation. Results for selected cases using the current program are given.

Edelbaum, T. N.↗

NASA NTRS1991

Numerical-Optimization Program

Automated Design Synthesis (ADS) computer program is general-purpose numerical-optimization program for design engineering. Provides wide range of options for solution of constrained and unconstrained function minimization problems. Suitable for such applications as minimum-weight design. Written in FORTRAN 77.

Vanderplaats, Garret N.↗

NASA NTRS1982

A DSN optimal spacecraft scheduling model

A computer model is described which uses mixed-integer linear programming to provide optimal DSN spacecraft schedules given a mission set and specified scheduling requirements. A solution technique is proposed which uses Bender's Method and a heuristic starting algorithm.

Webb, W. A.↗

NASA NTRS1983

Large-scale structural optimization

Problems encountered by aerospace designers in attempting to optimize whole aircraft are discussed, along with possible solutions. Large scale optimization, as opposed to component-by-component optimization, is hindered by computational costs, software inflexibility, concentration on a single, rather than trade-off, design methodology and the incompatibility of large-scale optimization with single program, single computer methods. The software problem can be approached by placing the full analysis outside of the optimization loop. Full analysis is then performed only periodically. Problem-dependent software can be removed from the generic code using a systems programming technique, and then embody the definitions of design variables, objective function and design constraints. Trade-off algorithms can be used at the design points to obtain quantitative answers. Finally, decomposing the large-scale problem into independent subproblems allows systematic optimization of the problems by an organization of people and machines.

Sobieszczanski-Sobieski, J.↗

NASA NTRS1987

Optimal mapping of irregular finite element domains to parallel processors

Mapping the solution domain of n-finite elements into N-subdomains that may be processed in parallel by N-processors is an optimal one if the subdomain decomposition results in a well-balanced workload distribution among the processors. The problem is discussed in the context of irregular finite element domains as an important aspect of the efficient utilization of the capabilities of emerging multiprocessor computers. Finding the optimal mapping is an intractable combinatorial optimization problem, for which a satisfactory approximate solution is obtained here by analogy to a method used in statistical mechanics for simulating the annealing process in solids. The simulated annealing analogy and algorithm are described, and numerical results are given for mapping an irregular two-dimensional finite element domain containing a singularity onto the Hypercube computer.

Flower, J.↗

NASA NTRS1988

A forward method for optimal stochastic nonlinear and adaptive control

A computational approach is taken to solve the optimal nonlinear stochastic control problem. The approach is to systematically solve the stochastic dynamic programming equations forward in time, using a nested stochastic approximation technique. Although computationally intensive, this provides a straightforward numerical solution for this class of problems and provides an alternative to the usual dimensionality problem associated with solving the dynamic programming equations backward in time. It is shown that the cost degrades monotonically as the complexity of the algorithm is reduced. This provides a strategy for suboptimal control with clear performance/computation tradeoffs. A numerical study focusing on a generic optimal stochastic adaptive control example is included to demonstrate the feasibility of the method.

Bayard, David S.↗