Optimum maneuvers of a skip vehicle with bounded lift constraints.
Hypervelocity glide vehicle optimum maneuvers, finding lift optimal control law for maximization of final velocity or altitude
SEARCH · Search NASA
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.
Hypervelocity glide vehicle optimum maneuvers, finding lift optimal control law for maximization of final velocity or altitude
The paper presents a finite element method for minimum weight design of structures with lower-bound constraints on the natural frequencies, and upper and lower bounds on the design variables. The design algorithm is essentially an iterative solution of the Kuhn-Tucker optimality criterion. The three most important features of the algorithm are: (1) a small number of design iterations are needed to reach optimal or near-optimal design, (2) structural elements with a wide variety of size-stiffness may be used, the only significant restriction being the exclusion of curved beam and shell elements, and (3) the algorithm will work for multiple as well as single frequency constraints. The design procedure is illustrated with three simple problems.
We present a convergence theory for pattern search methods for solving bound constrained nonlinear programs. The analysis relies on the abstract structure of pattern search methods and an understanding of how the pattern interacts with the bound constraints. This analysis makes it possible to develop pattern search methods for bound constrained problems while only slightly restricting the flexibility present in pattern search methods for unconstrained problems. We prove global convergence despite the fact that pattern search methods do not have explicit information concerning the gradient and its projection onto the feasible region and consequently are unable to enforce explicitly a notion of sufficient feasible decrease.
This report addresses the structural analysis and optimization of a composite fan blade sized for a large aircraft engine. An existing baseline solid metallic fan blade was used as a starting point to develop a hybrid honeycomb sandwich construction with a polymer matrix composite face sheet and honeycomb aluminum core replacing the original baseline solid metallic fan model made of titanium. The focus of this work is to design the sandwich composite blade with the optimum number of plies for the face sheet that will withstand the combined pressure and centrifugal loads while the constraints are satisfied and the baseline aerodynamic and geometric parameters are maintained. To satisfy the requirements, a sandwich construction for the blade is proposed with composite face sheets and a weak core made of honeycomb aluminum material. For aerodynamic considerations, the thickness of the core is optimized whereas the overall blade thickness is held fixed so as to not alter the original airfoil geometry. Weight is taken as the objective function to be minimized by varying the core thickness of the blade within specified upper and lower bounds. Constraints are imposed on radial displacement limitations and ply failure strength. From the optimum design, the minimum number of plies, which will not fail, is back-calculated. The ply lay-up of the blade is adjusted from the calculated number of plies and final structural analysis is performed. Analyses were carried out by utilizing the OpenMDAO Framework, developed at NASA Glenn Research Center combining optimization with structural assessment.
This paper considers the pre and post buckling behavior of general structures exposed to high temperature fields for long durations wherein creep effects become significant. The solution to this problem is made possible through the use of closed upper bounding constraint surfaces which enable the development of a new time stepping algorithm. This permits the stable and efficient solution of structural problems which exhibit indefinite tangent properties. Due to the manner of constraining/bounding successive iterates, the algorithm developed herein is largely self adaptive, inherently stable, sufficiently flexible to handle geometric material and boundary induced nonlinearity, and can be incorporated into either finite element or difference simulations. To illustrate the capability of the procedure, as well as, the physics of creep induced pre and post buckling behavior, the results of several numerical experiments are included.
A mathematical model of the annoyance created at an airport by aircraft operations is developed. The model incorporates population distribution considerations around an airport and the annoyance caused by aircraft noise. The objective function of this model corresponds to seeking to minimize total population annoyance created by all aircraft operations in a 24-hour period. Several factors are included in this model as constraint bounded. Demand for flight services is incorporated by including lower bounds on the number of operations by type of aircraft, runway used and time period. Also upper bounds on the number of operations for each runway are included. The mathematical model as formulated is recognized as corresponding to a nonlinear integer mathematical programming problem.
Optimum sensitivity is defined as the derivative of the optimum design with respect to some problem parameter, P. The problem parameter is usually fixed during optimization, but may be changed later. Thus, optimum sensitivity is used to estimate the effect of changes in loads, materials or constraint bounds on the design without expensive re-optimization. Here, the general topic of optimum sensitivity is discussed, available methods identified, examples given, and the difficulties encountered in calculating this information in nonlinear constrained optimization are identified.
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.
HRP's mission is to reduce the risks to human health and performance during long-duration spaceflight. The HRP Integrated Research Plan (IRP) contains the research plans for the 32 risks that require research to characterize and mitigate. From its inception the "integrate" aspect of the IRP has denoted the integrated nature of risks to human health and performance. Even though each risk in the IRP has its own research plan and is tracked separately, the interrelated nature of health and performance requires that they be addressed in an integrative or holistic fashion so that the connectedness of physiological systems within the human body and the integrated response to spaceflight can be addressed. Common characteristics of the spaceflight environment include altered gravity, atmospheres, and light/dark cycles; space radiation; isolation; noise; and periods of high or low workload. Long-term exposure to this unique environment produces a suite of physiological effects such as stress; vision, neurocognitive, and anthropometric changes; circadian misalignment; fluid shifts; cardiovascular deconditioning; immune dysregulation; and altered nutritional requirements. Expanding cross-disciplinary integrative approaches that synthesize concepts or data from two or more disciplines would improve the identification and characterization risk factors, and enable the development of countermeasures relevant to multiple risks. Cross-disciplinary approaches might also help to illuminate problem areas that may arise when a countermeasure adversely impacts risks other than those which it was developed to mitigate, or to identify groupings of physiological changes that are likely to occur that may impact the overall risk posture. In 2014 HRP embarked on a pilot study that combined four SRPs (and 12 HRP risks) - Behavioral Health, Sensorimotor, Cardiovascular, and Bone/Muscle - specifically to discuss cross-disciplinary integration. The points outlined below were suggested to seed the discussion, within the bounding constraint that research plans must be feasible and relevant to the HRP mission. While these were suggested starting points, the overall guiding principle was to allow free discussion from panel members on any aspect of integrated research that they felt was important, Existing cross-disciplinary integration as documented in the IRP (HRR), Existing or needed integration already identified by HRP, but not yet well defined within the IRP, Areas of integration that are missing.
This paper presents a novel approach for automated generation of fully connected finite-element meshes for all internal structural components and skins of a given wing-body geometry model, controlled by a few conceptual-level structural layout parameters. Internal structural components include spars, ribs, frames, and bulkheads. Structural layout parameters include spar/rib locations in wing chordwise/spanwise direction and frame/bulkhead locations in longitudinal direction. A simple shell thickness optimization problem with two load conditions is used to verify versatility and robustness of the automated meshing process. The automation process is implemented in ModelCenter starting from an OpenVSP geometry and ending with a NASTRAN 200 solution. One subsonic configuration and one supersonic configuration are used for numerical verification. Two different structural layouts are constructed for each configuration and five finite-element meshes of different sizes are generated for each layout. The paper includes various comparisons of solutions of 20 thickness optimization problems, as well as discussions on how the optimal solutions are affected by the stress constraint bound and the initial guess of design variables.
Presentation is accompanied by "Lunar Logistics Frequently Asked Questions" document. This document contains an evolving set of assumptions and ideas pertaining to the provision, delivery, transportation and accommodation of logistics for the lunar surface operations at Artemis Base Camp. It does not represent requirements, but a starting point from which partners can iterate. Given that the systems and the location for Artemis Base Camp are still being determined, the attached document represents a snapshot in time of ideas and some bounding constraints with respect to logistics operations. Partners are free to challenge operational constructs and assumptions to achieve better solutions. The concepts and assumptions in this document serve as a starting point for innovation to help identify factors that need to be considered for logistics operations and system design. It will be updated periodically as more information is developed and refined, and eventually serve as a basis for documenting ground rules and assumptions, leading eventually to requirements in the future.
We give a pattern search adaptation of an augmented Lagrangian method due to Conn, Gould, and Toint. The algorithm proceeds by successive bound constrained minimization of an augmented Lagrangian. In the pattern search adaptation we solve this subproblem approximately using a bound constrained pattern search method. The stopping criterion proposed by Conn, Gould, and Toint for the solution of this subproblem requires explicit knowledge of derivatives. Such information is presumed absent in pattern search methods; however, we show how we can replace this with a stopping criterion based on the pattern size in a way that preserves the convergence properties of the original algorithm. In this way we proceed by successive, inexact, bound constrained minimization without knowing exactly how inexact the minimization is. So far as we know, this is the first provably convergent direct search method for general nonlinear programming.
The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.
Probabilistic software analysis aims at quantifying how likely a target event is to occur during program execution. Current approaches rely on symbolic execution to identify the conditions to reach the target event and try to quantify the fraction of the input domain satisfying these conditions. Precise quantification is usually limited to linear constraints, while only approximate solutions can be provided in general through statistical approaches. However, statistical approaches may fail to converge to an acceptable accuracy within a reasonable time. We present a compositional statistical approach for the efficient quantification of solution spaces for arbitrarily complex constraints over bounded floating-point domains. The approach leverages interval constraint propagation to improve the accuracy of the estimation by focusing the sampling on the regions of the input domain containing the sought solutions. Preliminary experiments show significant improvement on previous approaches both in results accuracy and analysis time.
The Constellation-X x-ray telescope consists of replicated grazing incidence optics. The polishing of the "master' mandrel is accomplished by moving a polishing tool along a helical path on the surface of this almost cylindrical surface. The measurement of the surface is, however, performed along "axial" scan lines which intercept this helical path. This approach to polishing and measuring permits a relatively simple scheme to be implemented for the determination of the optimal dwell times of the polishing tool. These optimal dwell times are determined by a deconvolution which approaches the problem as a linear programming problem and uses the simplex method. This approach maximizes the amount of material removed at any point subject to inequality constraints. The effects of using these "optimum" dwell times is to significantly improve the "tools" effectiveness at removing the higher spatial frequencies while staying (strictly) within the bounds and constraints imposed by the hardware. In addition the "ringing" at the edges of the optic, frequently present in deconvolution problems, is completely eliminated.
Grazing incidence x-ray telescopes consist of surfaces which are nearly cylindrical in shape. The abrasive figuring of these surfaces is accomplished by moving a grinding tool along a helical path on this almost cylindrical surface. The measurement of the surface is, however, performed along "axial" scan lines which intercept this helical path. This approach to figuring and measuring permits a relatively simple scheme to be implemented for the determination of the optimal dwell times of the figuring tool. These optimal dwell times are determined by a deconvolution which approaches the problem in a linear programming context and uses the Simplex Method. The approach maximizes the amount of material removed at any point subject to inequality constraints. The effect of using these ''optimum" dwell times is to significantly improve the tools effectiveness at removing the higher spatial frequencies while staying (strictly) within the bounds and constraints imposed by the hardware. In addition, the ringing at the edges of the optic, frequently present in deconvolution problems, is completely eliminated.
The present paper uses theory of Donoho (1989) to find lower bounds on the lengths of optimally short fixed-length confidence intervals (minimax confidence intervals) for Gauss coefficients of the field of degree 1-12 using the heat flow constraint. The bounds on optimal minimax intervals are about 40 percent shorter than Backus' intervals: no procedure for producing fixed-length confidence intervals, linear or nonlinear, can give intervals shorter than about 60 percent the length of Backus' in this problem. While both methods rigorously account for the fact that core field models are infinite-dimensional, the application of the techniques to the geomagnetic problem involves approximations and counterfactual assumptions about the data errors, and so these results are likely to be extremely optimistic estimates of the actual uncertainty in Gauss coefficients.
Gradient-based optimization requires accurate derivatives of the objective function and constraints. These gradients may have previously been obtained by manual differentiation of analysis codes, symbolic manipulators, finite-difference approximations, or existing automatic differentiation (AD) tools such as ADIFOR (Automatic Differentiation in FORTRAN). Each of these methods has certain deficiencies, particularly when applied to complex, coupled analyses with many design variables. Recently, a new AD tool called ADJIFOR (Automatic Adjoint Generation in FORTRAN), based upon ADIFOR, was developed and demonstrated. Whereas ADIFOR implements forward-mode (direct) differentiation throughout an analysis program to obtain exact derivatives via the chain rule of calculus, ADJIFOR implements the reverse-mode counterpart of the chain rule to obtain exact adjoint form derivatives from FORTRAN code. Automatically-generated adjoint versions of the widely-used CFL3D computational fluid dynamics (CFD) code and an algebraic wing grid generation code were obtained with just a few hours processing time using the ADJIFOR tool. The codes were verified for accuracy and were shown to compute the exact gradient of the wing lift-to-drag ratio, with respect to any number of shape parameters, in about the time required for 7 to 20 function evaluations. The codes have now been executed on various computers with typical memory and disk space for problems with up to 129 x 65 x 33 grid points, and for hundreds to thousands of independent variables. These adjoint codes are now used in a gradient-based aerodynamic shape optimization problem for a swept, tapered wing. For each design iteration, the optimization package constructs an approximate, linear optimization problem, based upon the current objective function, constraints, and gradient values. The optimizer subroutines are called within a design loop employing the approximate linear problem until an optimum shape is found, the design loop limit is reached, or no further design improvement is possible due to active design variable bounds and/or constraints. The resulting shape parameters are then used by the grid generation code to define a new wing surface and computational grid. The lift-to-drag ratio and its gradient are computed for the new design by the automatically-generated adjoint codes. Several optimization iterations may be required to find an optimum wing shape. Results from two sample cases will be discussed. The reader should note that this work primarily represents a demonstration of use of automatically- generated adjoint code within an aerodynamic shape optimization. As such, little significance is placed upon the actual optimization results, relative to the method for obtaining the results.