Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization problems”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,567 records · Page 87

Fuel-optimal angular momentum vector control for spinning and dual-spin spacecraft.

The problem of fuel-optimal small-angle reorientation of the spin axis of a spinning or dual-spin spacecraft is examined. The results obtained show significant improvements over previously published optimization studies by virtue of the introduction of two innovations: (1) mass-explusion active control is utilized for angular momentum vector pointing only, with passive damping relied upon for stable vehicles to attenuate vehicle coning about the angular momentum vector, so that the task of the active controller changes from spin axis control to angular momentum vector control, and (2) several options are considered for type, number, and location of attitude control jets. The first of these considerations introduces a target set which is a smooth, two-dimensional linear manifold in the four-dimensional state space, whereas previous studies have adopted the origin as the target set. The second innovation amounts to consideration of a spectrum of control restraint sets.

Larson, V.↗

Modal grammian approach to actuator and sensor placement for flexible structures

The problem of selecting optimal locations of actuators and sensors for the control of flexible structures is addressed. Novel geometrical and physical interpretations are given for both controllability and observability grammians which enhances the intuitive aspects of the actuator and sensor placement problem. The explicit form of controllability and observability grammians for flexible structures is used to define modal grammian coefficients, which provides the basis for an actuator and sensor placement technique. The relationship of the proposed metric to three different existing criteria are given. The method is demonstrated on a model of an experimental large flexible structure.

Lim, K. B.↗

A Novel Multi-Spacecraft Interplanetary Global Trajectory Optimization Transcription

As the frontier of space exploration continues to advance, so does the design complexity of future interplanetary missions. One avenue of this increasing complexity includes a class of designs known as ``Distributed Spacecraft Missions"; missions where multiple spacecraft coordinate to perform shared objectives. Current approaches for the global trajectory optimization of these Multi-Vehicle Missions (MVMs) are prone to shortcomings including laborious iterative design, considerable human-in-the-loop effort, treatment of the multi-vehicle problem as multiple separate trajectory optimization subproblems (resulting in suboptimal solutions where the whole is less than the sum of its parts), and poor handling of coordination objectives and constraints. There are only a handful of software platforms in existence capable of fully-automated, rapid, interplanetary mission and systems global optimization including the Parallel Global Multiobjective Optimizer (PaGMO), the Gravity Assisted Low-thrust Local Optimization Program (GALLOP), and the Evolutionary Mission Trajectory Generator (EMTG). However, none of these tools is capable of performing such tasks for MVM designs. The work outlined in this paper lays the groundwork for a technique to begin addressing these shortcomings. We present a fully-automated technique which frames interplanetary MVMs as Multi-Objective, Multi-Agent Hybrid Optimal Control Problems (MOMA HOCP). First, the basic functionality of this technique is validated on the single-vehicle problem of reproducing the Cassini interplanetary cruise.

Napier, Sean W.↗

Recursive Branching Simulated Annealing Algorithm

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.

Bolcar, Matthew↗

Optimal trajectories for hypervelocity flight

Optimal trajectories for hypervelocity flight of interest in aeroassisted orbital transfer are discussed. Both coplanar and noncoplanar transfer are studied. More precisely, the geosynchronous-earth-orbit-, high-earth orbit- and low-earth-orbit-to-low earth-orbit transfers are considered in connection with a spacecraft that is controlled during the atmospheric pass by the angle of attack (coplanar case) or by the angle of attack and the angle of bank (noncoplanar case). Within the framework of classical optimal control, the following problems are studied: minimize the energy required for orbital transfer; maximize the time of flight during the atmospheric portion of the trajectory; and minimize the time integral of the square of the path inclination. Within the framework of minimax optimal control, the problem studied is to minimize the peak rate. Numerical solutions for the problems are obtained by means of the sequential gradient-restoration algorithm. The engineering implications of the results are discussed.

Miele, A.↗

System modeling and optimal design of a Mars-roving vehicle.

The problem of systematically determining the optimal design for an unmanned Mars-roving vehicle is considered. A system model, identifying all feasible designs, is generated by consideration of the physical constraints on the design parameters, and the requirement that the system be deliverable to the Mars surface. An expression which evaluates system performance relative to mission goals is developed. The model and objective function together allow simulation of the effects of design trade-offs upon system performance for all feasible designs. Nonlinear programming techniques are utilized to identify the optimal design.

Smith, E. J.↗

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

This study aims to develop a controllers decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

taxi scheduler↗

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

This study aims to develop a controllers' decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

surface management↗

On the optimal minimum order observer-based compensator and the limited state variable feedback controller

Four design problems are considered: two on the optimal minimum order observer-based compensator design and two on the optimal limited state variable feedback controller. The problem of designing an optimal discrete time linear time-invariant observer-based compensator for the regulation of an n dimensional linear discrete time time-invariant plant with m independent outputs is considered. This is a stochastic design problem to the extent that the initial plant state is assumed to be a random vector with known first and second order statistics. The compensator parameters are obtained by minimizing the expectation, with respect to the initial conditions, of the standard cost, quadratic in the state and control vectors with the inclusion of cross terms.

Llorens-Ortiz, B.↗

The reverse Goddard problem.

Fuel-time optimal retrothrust control for vertical and gravity turn ballistic trajectories of soft landing nonlifting bodies based on Pontryagin principle

Bejczy, A. K.↗

Simulation of low thrust guidance problems

The determination of optimal rocket control profiles and the guidance procedures used to approximate these profiles have received much attention. Simple guidance procedures have sufficed for the Apollo flights. A modified version of the linear tangent guidance law is developed which can be used for a low-thrust orbital maneuvering system such as the space shuttle. The modification allows the estimation of gravity over long thrusting arcs which is necessary for low thrust systems.

Dawkins, G. S.↗

An optimal control approach to the design of moving flight simulators

An abstract flight simulator design problem is formulated in the form of an optimal control problem, which is solved for the linear-quadratic-Gaussian special case using a mathematical model of the vestibular organs. The optimization criterion used is the mean-square difference between the physiological outputs of the vestibular organs of the pilot in the aircraft and the pilot in the simulator. The dynamical equations are linearized, and the output signal is modeled as a random process with rational power spectral density. The method described yields the optimal structure of the simulator's motion generator, or 'washout filter'. A two-degree-of-freedom flight simulator design, including single output simulations, is presented.

Sivan, R.↗

Fast and optimal solution to the Rankine-Hugoniot problem

A new, definitive, reliable and fast iterative method is described for determining the geometrical properties of a shock (i.e., theta sub Bn, yields N, V sub s and M sub A), the conservation constants and the self-consistent asymptotic magnetofluid variables, that uses the three dimensional magnetic field and plasma observations. The method is well conditioned and reliable at all theta sub Bn angles regardless of the shock strength or geometry. Explicit proof of uniqueness of the shock geometry solution by either analytical or graphical methods is given. The method is applied to synthetic and real shocks, including a bow shock event and the results are then compared with those determined by preaveraging methods and other iterative schemes. A complete analysis of the confidence region and error bounds of the solution is also presented.

Vinas, A. F.↗

Fast and optimal solution to the 'Rankine-Hugoniot problem'

A new, definitive, reliable and fast iterative method is described for determining the geometrical properties of a shock (i.e., theta sub Bn, yields N, V sub s and M sub A), the conservation constants and the self-consistent asymptotic magnetofluid variables, that uses the three dimensional magnetic field and plasma observations. The method is well conditioned and reliable at all theta sub Bn angles regardless of the shock strength or geometry. Explicit proof of uniqueness of the shock geometry solution by either analytical or graphical methods is given. The method is applied to synthetic and real shocks, including a bow shock event and the results are then compared with those determined by preaveraging methods and other iterative schemes. A complete analysis of the confidence region and error bounds of the solution is also presented.

Vinas, A. F.↗

A numerical algorithm for optimal feedback gains in high dimensional LQR problems

A hybrid method for computing the feedback gains in linear quadratic regulator problems is proposed. The method, which combines the use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated so as to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). Computational advantage of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed and numerical evidence of the efficacy of our ideas presented.

Banks, H. T.↗

Optimal flight trajectories in the presence of windshear, 1984-86

Optimal flight trajectories were determined in the presence of windshear and guidance schemes were developed for near optimum flight in a windshear. This is a wind characterized by sharp change in intensity and direction over a relatively small region of space. This problem is important in the takeoff and landing of both civilian airplanes and military airplanes and is key to aircraft saftey. The topics covered in reference to takeoff problems are: equations of motion, problem formulation, algorithms, optimal flight trajectories, advanced guidance schemes, simplified guidance schemes, and piloting strategies.

Miele, A.↗