Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimal start”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS2006

Singular-Arc Time-Optimal Trajectory of Aircraft in Two-Dimensional Wind Field

This paper presents a study of a minimum time-to-climb trajectory analysis for aircraft flying in a two-dimensional altitude dependent wind field. The time optimal control problem possesses a singular control structure when the lift coefficient is taken as a control variable. A singular arc analysis is performed to obtain an optimal control solution on the singular arc. Using a time-scale separation with the flight path angle treated as a fast state, the dimensionality of the optimal control solution is reduced by eliminating the lift coefficient control. A further singular arc analysis is used to decompose the original optimal control solution into the flight path angle solution and a trajectory solution as a function of the airspeed and altitude. The optimal control solutions for the initial and final climb segments are computed using a shooting method with known starting values on the singular arc The numerical results of the shooting method show that the optimal flight path angle on the initial and final climb segments are constant. The analytical approach provides a rapid means for analyzing a time optimal trajectory for aircraft performance.

Nguyen, Nhan↗
NASA NTRS2015

Adaptive Shape Control for Aerodynamic Design

We present an approach to aerodynamic optimization in which the shape control is adaptively parameterized. Starting from a coarse set of design variables, a sequence of higher-dimensional nested search spaces is automatically generated. Refinement can be either uniform or adaptive, in which case only the most important shape control is added. The relative importance of candidate design variables is determined by comparing objective and constraint gradients, computed at low cost via adjoint solutions. A search procedure for finding an effective ensemble of shape parameters is also given. We first demonstrate this system on a multipoint drag miminization problem in 2D with many constraints, showing that an adaptive parameterization approach consistently achieves smoother, more robust, and faster design improvement than fixed parameterizations. We also establish a 3D shape- matching benchmark, where we demonstrate that our approach automatically discovers the necessary parameters to match a target shape. By largely automating shape parameterization, this work also aims to remove a time-consuming aspect of shape optimization.

Aerodynamic Design↗
NASA NTRS1980

An SCF and MCSCF description of the low-lying states of MgO

The paper presents the multiconfiguration-self-consistent (MCSCF) and configuration state functions (CSF) for the low-lying electronic states of MgO. It was shown that simple description of these states was possible provided the 1 Sigma(+) states are individually optimized at the MCSCF level, noting that the 1(3 Sigma)(+) and 2(1 Sigma)(+) states which nominally result from the same electron occupation are separated energetically. The molecular orbitals obtained at this level of approximation should provide a useful starting point for extended configuration interaction calculations since they have been optimized for the particular states of interest.

Bauschlicher, C. W., Jr.↗
NASA NTRS2014

Wing Configuration Impact on Design Optimums for a Subsonic Passenger Transport

This study sought to compare four aircraft wing configurations at a conceptual level using a multi-disciplinary optimization (MDO) process. The MDO framework used was created by Georgia Institute of Technology and Virginia Polytechnic Institute and State University. They created a multi-disciplinary design and optimization environment that could capture the unique features of the truss-braced wing (TBW) configuration. The four wing configurations selected for the study were a low wing cantilever installation, a high wing cantilever, a strut-braced wing, and a single jury TBW. The mission that was used for this study was a 160 passenger transport aircraft with a design range of 2,875 nautical miles at the design payload, flown at a cruise Mach number of 0.78. This paper includes discussion and optimization results for multiple design objectives. Five design objectives were chosen to illustrate the impact of selected objective on the optimization result: minimum takeoff gross weight (TOGW), minimum operating empty weight, minimum block fuel weight, maximum start of cruise lift-to-drag ratio, and minimum start of cruise drag coefficient. The results show that the design objective selected will impact the characteristics of the optimized aircraft. Although minimum life cycle cost was not one of the objectives, TOGW is often used as a proxy for life cycle cost. The low wing cantilever had the lowest TOGW followed by the strut-braced wing.

Wells, Douglas P.↗
NASA NTRS1994

An optimization program based on the method of feasible directions: Theory and users guide

The theory and user instructions for an optimization code based on the method of feasible directions are presented. The code was written for wide distribution and ease of attachment to other simulation software. Although the theory of the method of feasible direction was developed in the 1960's, many considerations are involved in its actual implementation as a computer code. Included in the code are a number of features to improve robustness in optimization. The search direction is obtained by solving a quadratic program using an interior method based on Karmarkar's algorithm. The theory is discussed, focusing on the important and often overlooked role played by the various parameters guiding the iterations within the program. Also discussed is a robust approach for handling infeasible starting points. The code was validated by solving a variety of structural optimization test problems that have known solutions obtained by other optimization codes. It has been observed that this code is accurate and robust: it has solved a variety of problems from different starting points. However, the code is inefficient in that it takes considerable CPU time as compared with certain other available codes. Further work is required to improve its efficiency while retaining its robustness.

Ashok D. Belegundu↗
NASA NTRS2019

A Mixed Integer Efficient Global Optimization Algorithm with Multiple Infill Strategy - Applied to a Wing Topology Optimization Problem

With the advancement in high performance computing and numerical optimization techniques,engineering design optimization problems are becoming more complex, larger scale,higher fidelity, and computationally more demanding, requiring longer run times than ever before. There exists methodologies and techniques that can address some of these challenges but very few can address all, and most are limited in the extent that these concerns can be addressed. With the goal of addressing such challenging engineering problems, we developed anew optimization framework, named AMIEGO, that combines concepts from surrogate-based optimization approaches, gradient-based numerical methods, Partial Least Squares, evolutionary algorithms, and Branch-and-Bound, providing newer capabilities that were not previouslyperceived. However, the original version of this framework, in the process of adaptive samplingto explore and exploit the design space, finds only a single sample point per iteration. The efforthere builds upon this previously developed optimization framework to include multiple infillsampling capability that combines the concept of generalized expected improvement function,unsupervised learning, and multi-objective evolutionary technique. To demonstrate, AMIEGOwith the multiple infill capability (called AMIEGO-MIMOS) solves a series of increasingly difficultengineering design optimization problems. The results reveal the performance of the newapproach is problem dependent. When applied to a ten-bar truss problem, the newly proposedmultiple infill strategy consistently leads to a better design solutions when compared to theexisting CPTV method (implemented with the context of the AMIEGO framework). On theother hand, when applied to a mixed-integer high fidelity wing topology optimization problem- MIMOS, despite showing a steeper convergence at the start, eventually leads to an inferiorsolution as compared to CPTV approach. These results also reveal that a small number ofstarting points, in general, are sufficient to lead to a good overall solution.

Mixed-integer optimization↗
NASA NTRS1985

Optimization of cascade blade mistuning. II - Global optimum and numerical optimization

The values of the mistuning which yield the most stable eigenvectors are analytically determined, using the simplified equations of motion which were developed in Part I of this work. It is shown that random mistunings, if large enough, may lead to the maximal stability, whereas the alternate mistunings cannot. The problem of obtaining maximum stability for minimal mistuning is formulated, based on numerical optimization techniques. Several local minima are obtained using different starting mistuning vectors. The starting vectors which lead to the global minimum are identified. It is analytically shown that all minima appear in multiplicities which are equal to the number of compressor blades. The effect of mistuning on the flutter speed is studied using both an optimum mistuning vector and an alternate mistuning vector. Effects of mistunings in elastic axis locations are shown to have a negligible effect on the eigenvalues. Finally, it is shown that any general two-dimensional bending-torsion system can be reduced to an equivalent uncoupled torsional system.

Nissim, E.↗
NASA NTRS2010

Validation of a New Procedure for Impedance Eduction in Flow

A new impedance eduction procedure is validated by comparing the educed impedance spectrum to that of an older but well-tested eduction procedure. The older procedure requires the installation of a microphone array in the liner test section but the new procedure removes this requirement. A 12.7-mm stainless steel plate and a conventional liner consisting of a perforated plate bonded to a honeycomb core are tested. Test data is acquired from a grazing flow, impedance tube facility for a range of source frequencies and mean flow Mach numbers for which only plane waves are cut on. For the stainless steel plate, the educed admittance spectrum using the new procedure shows an improvement over that of the old procedure. This improvement shows up primarily in the educed conductance spectrum. Both eduction procedures show discrepancies in educed admittance in the mid-frequency range. Indications are that this discrepancy is triggered by an inconsistency between the measured eduction data (that contains boundary layer effects) and the two eduction models (for which the boundary layer is neglected). For the conventional liner, both eduction procedures are in very good agreement with each other. Small discrepancies occur for one or two frequencies in the mid-frequency range and for frequencies beyond the cut on frequency of higher-order duct modes. This discrepancy in the midfrequency range occurs because an automated optimizer is used to educe the impedance and the objective function used by the optimizer is extremely flat and therefore sensitive to initial starting values. The discrepancies at frequencies beyond the cut on frequency of higher order duct modes are due to the assumption of only plane waves in the impedance eduction model, although higher order modes are propagating in the impedance tube facility.

Watson, W. R.↗
NASA NTRS2011

Integrated Lens Antennas for Multi-Pixel Receivers

Future astrophysics and planetary experiments are expected to require large focal plane arrays with thousands of detectors. Feedhorns have excellent performance, but their mass, size, fabrication challenges, and expense become prohibitive for very large focal plane arrays. Most planar antenna designs produce broad beam patterns, and therefore require additional elements for efficient coupling to the telescope optics, such as substrate lenses or micromachined horns. An antenna array with integrated silicon microlenses that can be fabricated photolithographically effectively addresses these issues. This approach eliminates manual assembly of arrays of lenses and reduces assembly errors and tolerances. Moreover, an antenna array without metallic horns will reduce mass of any planetary instrument significantly. The design has a monolithic array of lens-coupled, leaky-wave antennas operating in the millimeter- and submillimeter-wave frequencies. Electromagnetic simulations show that the electromagnetic fields in such lens-coupled antennas are mostly confined in approximately 12 15 . This means that one needs to design a small-angle sector lens that is much easier to fabricate using standard lithographic techniques, instead of a full hyper-hemispherical lens. Moreover, this small-angle sector lens can be easily integrated with the antennas in an array for multi-pixel imager and receiver implementation. The leaky antenna is designed using double-slot irises and fed with TE10 waveguide mode. The lens implementation starts with a silicon substrate. Photoresist with appropriate thickness (optimized for the lens size) is spun on the substrate and then reflowed to get the desired lens structure. An antenna array integrated with individual lenses for higher directivity and excellent beam profile will go a long way in realizing multi-pixel arrays and imagers. This technology will enable a new generation of compact, low-mass, and highly efficient antenna arrays for use in multi-pixel receivers and imagers for future planetary and astronomical instruments. These antenna arrays can also be used in radars and imagers for contraband detection at stand-off distances. This will be enabling technology for future balloon-borne, smaller explorer class mission (SMEX), and other missions, and for a wide range of proposed planetary sounders and radars for planetary bodies.

Lee, Choonsup↗
NASA NTRS1983

Computation of optimal feedback strategies for interception in a horizontal plane

The problem of minimum-time interception of a target moving in a horizontal plane is studied. The target may fly a trajectory that is known at the start of the interception or try to evade the intercepting aircraft. The interceptor's optimal motion is described independently of the target in terms of an extremal trajectory map. The latter is used to develop guidelines for suboptimal approximations to the extremals. A method of constructing the feedback solution by drawing isochrones (constant minimum-time loci) is developed. Sections of the feedback solution for the interception of a straight-flying target are presented, and the construction of an isochrone for the interception of an actively evading target is demonstrated.

Rajan, N.↗
NASA NTRS2016

Computational Role of Tunneling in a Programmable Quantum Annealer

Quantum tunneling is a phenomenon in which a quantum state tunnels through energy barriers above the energy of the state itself. Tunneling has been hypothesized as an advantageous physical resource for optimization. Here we present the first experimental evidence of a computational role of multiqubit quantum tunneling in the evolution of a programmable quantum annealer. We developed a theoretical model based on a NIBA Quantum Master Equation to describe the multi-qubit dissipative cotunneling effects under the complex noise characteristics of such quantum devices.We start by considering a computational primitive, the simplest non-convex optimization problem consisting of just one global and one local minimum. The quantum evolutions enable tunneling to the global minimum while the corresponding classical paths are trapped in a false minimum. In our study the non-convex potentials are realized by frustrated networks of qubit clusters with strong intra-cluster coupling. We show that the collective effect of the quantum environment is suppressed in the critical phase during the evolution where quantum tunneling decides the right path to solution. In a later stage dissipation facilitates the multiqubit cotunneling leading to the solution state. The predictions of the model accurately describe the experimental data from the D-WaveII quantum annealer at NASA Ames. In our computational primitive the temperature dependence of the probability of success in the quantum model is opposite to that of the classical paths with thermal hopping. Specially, we provide an analysis of an optimization problem with sixteen qubits,demonstrating eight qubit cotunneling that increases success probabilities. Furthermore, we report results for larger problems with up to 200 qubits that contain the primitive as subproblems.

hard problems↗
NASA NTRS2004

OTIS 3.2 Software Released

Trajectory, mission, and vehicle engineers concern themselves with finding the best way for an object to get from one place to another. These engineers rely upon special software to assist them in this. For a number of years, many engineers have used the OTIS program for this assistance. With OTIS, an engineer can fully optimize trajectories for airplanes, launch vehicles like the space shuttle, interplanetary spacecraft, and orbital transfer vehicles. OTIS provides four modes of operation, with each mode providing successively stronger optimization capability. The most powerful mode uses a mathematical method called implicit integration to solve what engineers and mathematicians call the optimal control problem. OTIS 3.2, which was developed at the NASA Glenn Research Center, is the latest release of this industry workhorse and features new capabilities for parameter optimization and mission design. OTIS stands for Optimal Control by Implicit Simulation, and it is implicit integration that makes OTIS so powerful at solving trajectory optimization problems. Why is this so important? The optimization process not only determines how to get from point A to point B, but it can also determine how to do this with the least amount of propellant, with the lightest starting weight, or in the fastest time possible while avoiding certain obstacles along the way. There are numerous conditions that engineers can use to define optimal, or best. OTIS provides a framework for defining the starting and ending points of the trajectory (point A and point B), the constraints on the trajectory (requirements like "avoid these regions where obstacles occur"), and what is being optimized (e.g., minimize propellant). The implicit integration method can find solutions to very complicated problems when there is not a lot of information available about what the optimal trajectory might be. The method was first developed for solving two-point boundary value problems and was adapted for use in OTIS. Implicit integration usually allows OTIS to find solutions to problems much faster than programs that use explicit integration and parametric methods. Consequently, OTIS is best suited to solving very complicated and highly constrained problems.

Riehl, John P.↗
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 NTRS1996

Optimization of Air-Breathing Engine Concept

The design optimization of air-breathing propulsion engine concepts has been accomplished by soft-coupling the NASA Engine Performance Program (NEPP) analyzer with the NASA Lewis multidisciplinary optimization tool COMETBOARDS. Engine problems, with their associated design variables and constraints, were cast as nonlinear optimization problems with thrust as the merit function. Because of the large number of mission points in the flight envelope, the diversity of constraint types, and the overall distortion of the design space; the most reliable optimization algorithm available in COMETBOARDS, when used by itself, could not produce satisfactory, feasible, optimum solutions. However, COMETBOARDS' unique features-which include a cascade strategy, variable and constraint formulations, and scaling devised especially for difficult multidisciplinary applications-successfully optimized the performance of subsonic and supersonic engine concepts. Even when started from different design points, the combined COMETBOARDS and NEPP results converged to the same global optimum solution. This reliable and robust design tool eliminates manual intervention in the design of air-breathing propulsion engines and eases the cycle analysis procedures. It is also much easier to use than other codes, which is an added benefit. This paper describes COMETBOARDS and its cascade strategy and illustrates the capabilities of the combined design tool through the optimization of a high-bypass- turbofan wave-rotor-topped subsonic engine and a mixed-flow-turbofan supersonic engine.

Patnaik, Surya N.↗
NASA NTRS2011

Object-Oriented Multi-Disciplinary Design, Analysis, and Optimization Tool

An Object-Oriented Optimization (O3) tool was developed that leverages existing tools and practices, and allows the easy integration and adoption of new state-of-the-art software. At the heart of the O3 tool is the Central Executive Module (CEM), which can integrate disparate software packages in a cross platform network environment so as to quickly perform optimization and design tasks in a cohesive, streamlined manner. This object-oriented framework can integrate the analysis codes for multiple disciplines instead of relying on one code to perform the analysis for all disciplines. The CEM was written in FORTRAN and the script commands for each performance index were submitted through the use of the FORTRAN Call System command. In this CEM, the user chooses an optimization methodology, defines objective and constraint functions from performance indices, and provides starting and side constraints for continuous as well as discrete design variables. The structural analysis modules such as computations of the structural weight, stress, deflection, buckling, and flutter and divergence speeds have been developed and incorporated into the O3 tool to build an object-oriented Multidisciplinary Design, Analysis, and Optimization (MDAO) tool.

Pak, Chan-gi↗
NASA NTRS1998

Bi-Level Integrated System Synthesis (BLISS)

BLISS is a method for optimization of engineering systems by decomposition. It separates the system level optimization, having a relatively small number of design variables, from the potentially numerous subsystem optimizations that may each have a large number of local design variables. The subsystem optimizations are autonomous and may be conducted concurrently. Subsystem and system optimizations alternate, linked by sensitivity data, producing a design improvement in each iteration. Starting from a best guess initial design, the method improves that design in iterative cycles, each cycle comprised of two steps. In step one, the system level variables are frozen and the improvement is achieved by separate, concurrent, and autonomous optimizations in the local variable subdomains. In step two, further improvement is sought in the space of the system level variables. Optimum sensitivity data link the second step to the first. The method prototype was implemented using MATLAB and iSIGHT programming software and tested on a simplified, conceptual level supersonic business jet design, and a detailed design of an electronic device. Satisfactory convergence and favorable agreement with the benchmark results were observed. Modularity of the method is intended to fit the human organization and map well on the computing technology of concurrent processing.

Sobieszczanski-Sobieski, Jaroslaw↗
NASA NTRS1998

Bi-Level Integrated System Synthesis (BLISS)

BLISS is a method for optimization of engineering systems by decomposition. It separates the system level optimization, having a relatively small number of design variables, from the potentially numerous sub-system optimizations that may each have a large number of local design variables. The subsystem optimizations are autonomous and may be conducted concurrently. Subsystem and system optimizations alternate, linked by sensitivity data, producing a design improvement in each iteration. Starting from a best guess initial design, the method improves that design in iterative cycles, each cycle comprised of two steps. In step one, the system level variables are frozen and the improvement is achieved by separate, concurrent, and autonomous optimizations in the local variable subdomains. In step two, further improvement is sought in the space of the system level variables. Optimum sensitivity data link the second step to the first. The method prototype was implemented using MATLAB and iSIGHT programming software and tested on a simplified, conceptual level supersonic business jet design, and a detailed design of an electronic device.

Sobieszczanski-Sobieski, Jaroslaw↗
NASA NTRS1987

Time optimal paths and acceleration lines of robotic manipulators

The concept of acceleration lines and their correlation with time-optimal paths of robotic manipulators is presented. The acceleration lines represent the directions of maximum tip acceleration from a point in the manipulator work-space, starting at a zero velocity. These lines can suggest the number and shapes of time-optimal paths for a class of manipulators. It is shown that nonsingular time-optimal paths are tangent to one of the acceleration lines near the end-points. A procedure for obtaining near-optimal paths, utilizing the acceleration lines, is developed. These paths are obtained by connecting the end-points with B splines tangent to the acceleration lines. The near-minimum paths are shown to yield better traveling times than the straight-line path between the same end-points. The near-minimum paths can be used as initial conditions in existing optimization methods to speed-up convergence and computation time. This method can be used for online robot path planning and for interactive designs of robotic-cell layouts. Examples of time-optimal paths of a two-link manipulator, obtained by other optimization procedures and their acceleration lines, are shown.

Shiller, Zvi↗