Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear constraints”

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 163 records · Page 9

Effects of using a posteriori methods for the conservation of integral invariants

The nature and effect of using a posteriori adjustments to nonconservative finite-difference schemes to enforce integral invariants of the corresponding analytic system are examined. The method of a posteriori integral constraint restoration is analyzed for the case of linear advection, and the harmonic response associated with the a posteriori adjustments is examined in detail. The conservative properties of the shallow water system are reviewed, and the constraint restoration algorithm applied to the shallow water equations are described. A comparison is made between forecasts obtained using implicit and a posteriori methods for the conservation of mass, energy, and potential enstrophy in the complete nonlinear shallow-water system.

Takacs, Lawrence L.↗

Linearized Frequency-Domain Gust Analysis and Adjoint-Based Sensitivities

Gust analysis is added to a linearized frequency-domain method in FUN3D, a NASA computational fluid dynamics solver. The method linearizes about a nonlinear static equilibrium condition and is therefore appropriate for problems with small perturbations such as transonic stochastic gust analysis. In addition to the gust analysis, adjoint-based sensitivities of stochastic gust constraints are implemented for multidisciplinary design optimization. The linearized frequency-domain gust model and adjoint-based sensitivities are described and verified. The method is applied to an optimization for mass minimization of the AGARD 445.6 wing subject to a stochastic gust constraint limiting the displacement of the wing tip.

Aeroelasticity↗

Scheduling Position, Navigation and Time Service Requests from Non-dedicated Lunar Constellations

This paper presents a centralized scheduler that satisfies user requests for Position, Navigation, and Time (PNT) services from an ad-hoc, non-dedicated orbital constellation around the Moon. Traditional, dedicated GNSS networks provide service 24/7, which allows users to acquire localization services at-will. For ad-hoc networks, a coordinated schedule is needed to ensure Quality of Service (QoS) guarantees for user localization, while satisfying non-dedicated assets’ usage constraints. This scheduler bridges this coordination gap by leveraging Mixed Integer-Linear Programming (MILP) to schedule this “as-needed” localization service while respecting the constraints on each asset. In upcoming decades there is expected to be a substantial increase in Lunar missions. Many of these missions will feature low-cost surface assets near the moon’s polar regions and small-sat science missions in orbit. Most missions need PNT capabilities to ensure safe operations and meet their science objectives, but low-cost missions may not be able to support the large power, mass, and weight that a weak GNSS or DSN based navigation solution would entail. Asset localization has been demonstrated using a decentralized extended Kalman Filter (DEKF) in the previously presented Lunar Autonomous PNT System (LAPS). Within the LAPS simulation environment, a module has been developed to generate the coordinated user-asset schedules described above; this Service Scheduler Module (SSM) allows for complete end-to-end testing of the entire system. Within SSM, a user service request consists of a location on the Lunar surface, a cumulative service duration, and a window in which service must occur. SSM takes as input these requests and the LAPS-predicted positional degree of precision as the QoS for each available set of orbital assets. A simple, baseline MILP model is formulated to provide the highest-precision service balanced across all requests. To reflect the non-dedicated nature of the constellation, this baseline model is augmented with additional asset-specific load capacity constraints or availability constraints. The load capacity constraints limit total time spent providing service, and the availability constraints reflect blockout times or availability windows when the assets are not otherwise occupied. SSM outputs two schedules: the user schedule to indicate their service times and expected QoS, and a satellite schedule to be transmitted to the orbiting constellation, describing when each non-dedicated asset provides PNT service. SSM is predominantly implemented in MATLAB and allows the use of any MILP solver to generate the resulting schedules. This paper describes the SSM - LAPS interface, how the output of LAPS is used to construct the MILP, and how SSM provides user localization service while satisfying constraints. It will also demonstrate the tool’s flexibility for formulating schedules for the end user and the constellation, focusing on scenarios that match real-world proposed missions. It will detail how SSM can be used to compare the addition of load capacity constraints, satellite availability constraints, and QoS guarantees for the users. Finally, we describe how SSM can be used to support the design of the ad-hoc constellation itself. The resulting integrated capability will support the design of future ad-hoc Lunar PNT networks, enabling high-quality, low-cost Lunar exploration

Swarm↗

Optimization of Car Body under Constraints of Noise, Vibration, and Harshness (NVH), and Crash

To be competitive on the today's market, cars have to be as light as possible while meeting the Noise, Vibration, and Harshness (NVH) requirements and conforming to Government-man dated crash survival regulations. The latter are difficult to meet because they involve very compute-intensive, nonlinear analysis, e.g., the code RADIOSS capable of simulation of the dynamics, and the geometrical and material nonlinearities of a thin-walled car structure in crash, would require over 12 days of elapsed time for a single design of a 390K elastic degrees of freedom model, if executed on a single processor of the state-of-the-art SGI Origin2000 computer. Of course, in optimization that crash analysis would have to be invoked many times. Needless to say, that has rendered such optimization intractable until now. The car finite element model is shown. The advent of computers that comprise large numbers of concurrently operating processors has created a new environment wherein the above optimization, and other engineering problems heretofore regarded as intractable may be solved. The procedure, shown, is a piecewise approximation based method and involves using a sensitivity based Taylor series approximation model for NVH and a polynomial response surface model for Crash. In that method the NVH constraints are evaluated using a finite element code (MSC/NASTRAN) that yields the constraint values and their derivatives with respect to design variables. The crash constraints are evaluated using the explicit code RADIOSS on the Origin 2000 operating on 256 processors simultaneously to generate data for a polynomial response surface in the design variable domain. The NVH constraints and their derivatives combined with the response surface for the crash constraints form an approximation to the system analysis (surrogate analysis) that enables a cycle of multidisciplinary optimization within move limits. In the inner loop, the NVH sensitivities are recomputed to update the NVH approximation model while keeping the Crash response surface constant. In every outer loop, the Crash response surface approximation is updated, including a gradual increase in the order of the response surface and the response surface extension in the direction of the search. In this optimization task, the NVH discipline has 30 design variables while the crash discipline has 20 design variables. A subset of these design variables (10) are common to both the NVH and crash disciplines. In order to construct a linear response surface for the Crash discipline constraints, a minimum of 21 design points would have to be analyzed using the RADIOSS code. On a single processor in Origin 2000 that amount of computing would require over 9 months! In this work, these runs were carried out concurrently on the Origin 2000 using multiple processors, ranging from 8 to 16, for each crash (RADIOSS) analysis. Another figure shows the wall time required for a single RADIOSS analysis using varying number of processors, as well as provides a comparison of 2 different common data placement procedures within the allotted memories for each analysis. The initial design is an infeasible design with NVH discipline Static Torsion constraint violations of over 10%. The final optimized design is a feasible design with a weight reduction of 15 kg compared to the initial design. This work demonstrates how advanced methodology for optimization combined with the technology of concurrent processing enables applications that until now were out of reach because of very long time-to-solution.

Kodiyalam, Srinivas↗

Utilization of the Deep Space Atomic Clock for Europa Gravitational Tide Recovery

Estimation of Europa's gravitational tide can provide strong evidence of the existence of a subsurface liquid ocean. Due to limited close approach tracking data, a Europa flyby mission suffers strong coupling between the gravity solution quality and tracking data quantity and quality. This work explores utilizing Low Gain Antennas with the Deep Space Atomic Clock (DSAC) to provide abundant high accuracy uplink-only radiometric tracking data. DSAC's performance, expected to exhibit an Allan Deviation of less than 3e-15 at one day, provides long-term stability and accuracy on par with the Deep Space Network ground clocks, enabling one-way radiometric tracking data with accuracy equivalent to that of its two-way counterpart. The feasibility of uplink-only Doppler tracking via the coupling of LGAs and DSAC and the expected Doppler data quality are presented. Violations of the Kalman filter's linearization assumptions when state perturbations are included in the flyby analysis results in poor determination of the Europa gravitational tide parameters. B-plane targeting constraints are statistically determined, and a solution to the linearization issues via pre-flyby approach orbit determination is proposed and demonstrated.

Seubert, Jill↗

Angles-Only Robust Trajectory Optimization for NRHO Rendezvous

This study demonstrates a robust trajectory optimization approach for rendezvous and proximity operations with angles-only navigation measurements. Often, sensors that directly measure relative range and velocity require communication or coordination between the chaser and target vehicle and can have limiting pointing accuracy, mass, or power requirements compared to angle measurement sensors. Thus, the capability to perform a rendezvous with only angle measurements can be advantageous for vehicle design and to improve robustness to failures. However, the well studied limitation of angles-only navigation in measuring range results in large uncertainties in the navigation system that must be reduced with chaser vehicle thrust maneuvers to induce observability in range for the navigation filter. This analysis presents a trajectory optimization problem for a lunar ascent rendezvous during a crewed lunar mission in a Near-Rectilinear Halo Orbit (NRHO) that is limited to only angle measurements. The objective of this study is to show that an angles-only rendezvous is feasible in an NRHO and to present the sensitivity to an assortment of constraints generated from a systematic optimization process using linear covariance analysis and particle swarm optimization. Linearized NRHO dynamics and linearized relative targeting are applied to use linear covariance analysis to determine the expected delta-v and trajectory dispersions due to initial state uncertainty, sensor errors, maneuver execution errors, and unmodeled dynamics. The delta-v and trajectory dispersions are passed into a particle swarm optimization algorithm to find the optimized maneuver profile that minimizes fuel use while satisfying constraints such as free drift and underburn to 3-sigma certainty. The trajectory constraints including time available, desired final uncertainty, and initial uncertainty are varied to ascertain sensitivity and desirable engineering trades.

Linear Covariance Analysis↗

Chance-Constrained Guidance With Non-Convex Constraints

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of failure) is below a user-specified bound known as the risk bound. An example problem is to drive a car to a destination as fast as possible while limiting the probability of an accident to 10(exp -7). This framework allows users to trade conservatism against performance by choosing the risk bound. The more risk the user accepts, the better performance they can expect.

FROM↗

Gain optimization with non-linear controls

An algorithm has been developed for the analysis and design of controls for non-linear systems. The technical approach is to use statistical linearization to model the non-linear dynamics of a system by a quasi-Gaussian model. A covariance analysis is performed to determine the behavior of the dynamical system and a quadratic cost function. Expressions for the cost function and its derivatives are determined so that numerical optimization techniques can be applied to determine optimal feedback laws. The primary application for this paper is centered about the design of controls for nominally linear systems but where the controls are saturated or limited by fixed constraints. The analysis is general, however, and numerical computation requires only that the specific non-linearity be considered in the analysis.

Slater, G. L.↗

Parallel Aircraft Trajectory Optimization with Analytic Derivatives

Trajectory optimization is an integral component for the design of aerospace vehicles, but emerging aircraft technologies have introduced new demands on trajectory analysis that current tools are not well suited to address. Designing aircraft with technologies such as hybrid electric propulsion and morphing wings requires consideration of the operational behavior as well as the physical design characteristics of the aircraft. The addition of operational variables can dramatically increase the number of design variables which motivates the use of gradient based optimization with analytic derivatives to solve the larger optimization problems. In this work we develop an aircraft trajectory analysis tool using a Legendre-Gauss-Lobatto based collocation scheme, providing analytic derivatives via the OpenMDAO multidisciplinary optimization framework. This collocation method uses an implicit time integration scheme that provides a high degree of sparsity and thus several potential options for parallelization. The performance of the new implementation was investigated via a series of single and multi-trajectory optimizations using a combination of parallel computing and constraint aggregation. The computational performance results show that in order to take full advantage of the sparsity in the problem it is vital to parallelize both the non-linear analysis evaluations and the derivative computations themselves. The constraint aggregation results showed a significant numerical challenge due to difficulty in achieving tight convergence tolerances. Overall, the results demonstrate the value of applying analytic derivatives to trajectory optimization problems and lay the foundation for future application of this collocation based method to the design of aircraft with where operational scheduling of technologies is key to achieving good performance.

aircraft↗

A study of the use of linear programming techniques to improve the performance in design optimization problems

This project has two objectives. The first is to determine whether linear programming techniques can improve performance when handling design optimization problems with a large number of design variables and constraints relative to the feasible directions algorithm. The second purpose is to determine whether using the Kreisselmeier-Steinhauser (KS) function to replace the constraints with one constraint will reduce the cost of total optimization. Comparisons are made using solutions obtained with linear and non-linear methods. The results indicate that there is no cost saving using the linear method or in using the KS function to replace constraints.

Young, Katherine C.↗

Structural optimization for joined-wing synthesis

The differences between fully stressed and minimum-weight joined-wing structures are identified, and these differences are quantified in terms of weight, stress, and direct operating cost. A numerical optimization method and a fully stressed design method are used to design joined-wing structures. Both methods determine the sizes of 204 structural members, satisfying 1020 stress constraints and five buckling constraints. Monotonic splines are shown to be a very effective way of linking spanwise distributions of material to a few design variables. Both linear and nonlinear analyses are employed to formulate the buckling constraints. With a constraint on buckling, the fully stressed design is shown to be very similar to the minimum-weight structure. It is suggested that a fully stressed design method based on nonlinear analysis is adequate for an aircraft optimization study.

Gallman, John W.↗

Passive three-axis stabilization of the Long Duration Exposure Facility

This paper presents an analysis of the attitude dynamics of the Long Duration Exposure Facility (LDEF). LDEF is a large cylindrical gravity gradient stabilized earth satellite which is planned to be delivered to a 270-n mi circular orbit by the space shuttle. The fundamental linear stability, capture requirements, and pitch bias constraints generated by the Garber instability are discussed. Numerical simulations, based on the full nonlinear equations for the coupled orbital and attitude motion of the vehicle and the viscous magnetic damper, show stable behavior of the spacecraft and a damping time constant of 30 to 70 orbits.

Huckins, E. K., III↗

Aerodynamic design and analysis of the AST-200 supersonic transport configuration concept

The design and analysis of a supersonic transport configuration was conducted using linear theory methods in conjunction with appropriate constraints. Wing optimization centered on the determination of the required twist and camber and proper integration of the wing and fuselage. Also included in the design are aerodynamic refinements to the baseline wing thickness distribution and nacelle shape. Analysis to the baseline and revised configurations indicated an improvement in lift-to-drag ratio of 0.36 at the Mach 2.7 cruise condition. Validation of the design is planned through supersonic wing tunnel tests.

Walkley, K. B.↗

Optimal local control of flexible structures

The steady state solution of the linear quadratic optimal control problem with the constraint that only partial state information is available for feedback is derived. This development results in a systematic and computationally efficient approach for reducing the complexity of the control law for high order systems. Numerical examples and performance evaluation of (1) a simple fourth order system, and (2) a free-free flexible beam, are included.

Schaechter, D. B.↗

A Burst Chasing X-ray Polarimeter

Gamma-ray bursts are one of the most powerful explosions in the universe and have been detected out to distances of almost 13 billion light years. The exact origin of these energetic explosions is still unknown but the resulting huge release of energy is thought to create a highly relativistic jet of material and a power-law distribution of electrons. There are several theories describing the origin of the prompt GRB emission that currently cannot be distinguished. Measurements of the linear polarization would provide unique and important constraints on the mechanisms thought to drive these powerful explosions. We present the design of a sensitive, and extremely versatile gamma-ray burst polarimeter. The instrument is a photoelectric polarimeter based on a time-projection chamber. The photoelectric time-projection technique combines high sensitivity with broad band-pass and is potentially the most powerful method between 2 and 100 keV where the photoelectric effect 1s the dominant interaction process We present measurements of polarized and unpolarized X-rays obtained with a prototype detector and describe the two mission concepts, the Gamma-Ray Burst Polarimeter (GRBP) for thc U S Naval Academy satellite MidSTAR-2, and thc Low Energy Polarimeter (LEP) onboard POET, a broadband polarimetry concept for a small explorer mission.

Hill, Joanne E.↗

A Burst Chasing X-ray Polarimeter

Tihs is a viewgraph presentation of a discussion of the X-ray Polarimeter. Gamma-ray bursts are one of the most powerful explosions in the universe and have been detected out to distances of almost 13 billion light years. The exact origin of these energetic explosions is still unknown but the resulting huge release of energy is thought to create a highly relativistic jet of material and a power-law distribution of electrons. There are several theories describing the origin of the prompt GRB emission that currently cannot be distinguished. Measurements of the linear polarization would provide unique and important constraints on the mechanisms thought to drive these powerful explosions. We present the design of a sensitive, and extremely versatile gamma-ray burst polarimeter. The instrument is a photoelectric polarimeter based on a time-projection chamber. The photoelectric time-projection technique combines high sensitivity with broad band-pass and is potentially the most powerful method between 2 and 100 keV where the photoelectric effect is the dominant interaction process We present measurements of polarized and unpolarized X-rays obtained with a prototype detector and describe the two mission concepts, the Gamma-Ray Burst Polarimeter (GRBP) for thc U S Naval Academy satellite MidSTAR-2, and thc Low Energy Polarimeter (LEP) onboard POET, a broadband polarimetry concept for a small explorer mission.

Hill, Joanne↗

Demonstration of Automatically-Generated Adjoint Code for Use in Aerodynamic Shape Optimization

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.

Green, Lawrence↗

Optimization of structure and control system

The objective of this study is the simultaneous design of the structural and control system for space structures. This study is focused on considering the effect of the number and the location of the actuators on the minimum weight of the structure, and the total work done by the actuators for specified constraints and disturbance. The controls approach used is the linear quadratic regulator theory with constant feedback. At the beginning collocated actuators and sensors are provided in all the elements. The actuator doing the least work is removed one at a time, and the structure is optimized for the specified constraints on the closed-loop eigenvalues and the damping parameters. The procedure of eliminating an actuator is continued until an acceptable design satisfying the constraints is obtained. The study draws some conclusions on the trade between the total work done by the actuators, and the optimum weight and the number of actuators.

Khot, N. S.↗