Search NASA⌕ Search

SEARCH · Search NASA

Results for “Dynamic optimization”

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

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

At least 685 records · Page 38

Runway Scheduling Using Generalized Dynamic Programming

A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway fight sequences that are optimal for both runway throughput and delay. Realistic time-based operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort Worth International airport and three baseline heuristics are used to illustrate preliminary benefits of using the generalized dynamic programming method. Simulated traffic levels ranged from 10 aircraft to 30 aircraft with each test case spanning 15 minutes. The optimal solution shows a 40-70 percent decrease in the expected delay per aircraft over the baseline schedulers. Computational results suggest that the algorithm is promising for real-time application with an average computation time of 4.5 seconds. For even faster computation times, two heuristics are developed. As compared to the optimal, the heuristics are within 5% of the expected delay per aircraft and 1% of the expected number of runway operations per hour ad can be 100x faster.

optmization↗

Lila: Optimal Dispatching in Probabilistic Temporal Networks using Monte Carlo Tree Search

Executing a Probabilistic Simple Temporal Network (PSTN) amounts at scheduling, i.e. \textit{dispatch}, a set of events under time uncertainty. This constitutes a NP-hard online optimization problem. The right execution time must be dynamically assigned to each event of the PSTN such that the temporal constraints are met, whereas activity durations are progressively observed as the execution unfolds. We propose a dispatching algorithm based on Monte Carlo Tree Search, called Lila, with the following characteristics: (i) it is an anytime algorithm, both offline and online, proven asymptotically optimal; (ii) it returns the current probability of success, either before or at any moment during operations; (iii) it handles any possible continuous or discrete, even non-parametric, probability distributions, as well as inter-dependencies between random variables, exogenous and endogenous uncertainty; and (iv) can be easily extended to handle probabilistic external events, PSTNs with resources, PSTNs with cutoff times and precondition chains, etc. Lila is universal in the sense that it can handle any dispatching protocol, simply by specifying it to the algorithm. It has the unlimited flexibility offered by the simulation paradigm, whilst it asymptotically converges to optimal decisions and/or robustness approximations.

Chien, Steve A.↗

Optimizing Mars Airplane Trajectory with the Application Navigation System

Planning complex missions requires a number of programs to be executed in concert. The Application Navigation System (ANS), developed in the NAS Division, can execute many interdependent programs in a distributed environment. We show that the ANS simplifies user effort and reduces time in optimization of the trajectory of a martian airplane. We use a software package, Cart3D, to evaluate trajectories and a shortest path algorithm to determine the optimal trajectory. ANS employs the GridScape to represent the dynamic state of the available computer resources. Then, ANS uses a scheduler to dynamically assign ready task to machine resources and the GridScape for tracking available resources and forecasting completion time of running tasks. We demonstrate system capability to schedule and run the trajectory optimization application with efficiency exceeding 60% on 64 processors.

Frumkin, Michael↗

Practical design optimization of wing/body configurations using the Euler equations

The development of a practical method for the aerodynamic design of isolated wing and wing/body configurations is achieved through the coupling of existing computational fluid dynamics (CFD) analysis codes and a quasi-Newton numerical optimization method. The direct design method is generalized to treat three-dimensional aerodynamic optimization problems subject to inviscid, rotational, compressible flow conditions imposed by the Euler equations. The method couples either the FLO57 or the TEAM flow solver with a modified version of the QNMDIF numerical optimization algorithm. The method is applied, but is not limited, to supersonic design problems. A case study is presented illustrating the method's effectiveness in maximizing the lift-to-drag ratio, subject to a variety of constraints, of selected supersonic configurations at cruise conditions.

Reuther, J.↗

Applied mechanics

Spacecraft antenna optimization, receptance coupling program, deformation modes and dynamic response of structures, and holographic measurements

Source record↗

A neighboring optimal feedback control scheme for systems using discontinuous control.

The calculation and implementation of the neighboring optimal feedback control law for multiinput, nonlinear dynamical systems, using discontinuous control, is discussed. An initialization procedure is described which removes the requirement that the neighboring initial state be in the neighborhood of the nominal initial state. This procedure is a bootstrap technique for determining the most appropriate control-law gain for the neighboring initial state. The mechanization of the neighboring control law described is closed loop in that the concept of time-to-go is utilized in the determination of the control-law gains appropriate for each neighboring state. The gains are chosen such that the time-to-go until the next predicted switch time or predicted final time is the same for both the neighboring and nominal trajectories. The procedure described is utilized to solve the minimum-time satellite attitude-acquisition problem.

Foerster, R. E.↗

Four-dimensional guidance problem with control delays

This paper, assuming steady wind and zero sideslip, presents a discrete-time mathematical model to obtain a control law and three-dimensional flight path to guide an aircraft in a given time from a given initial state (position, velocity and heading) to a prescribed final state subject to the constraints on airspeed acceleration, and pitch and bank angles of the aircraft. For ease in implementing the control law, the control inputs are assumed to be delayed and are applied in a sequential fashion. The guidance problem is formulated as a discrete nonlinear optimal control problem with time delays in dynamics and a cost functional of Bolza form. With a quadratic penalty function to handle terminal constraints on velocity and heading, a solution technique to the control problem based on conjugate gradient algorithm is investigated. Numerical examples are presented to illustrate the applicability of this approach to solution of a terminal area guidance problem in an automated air traffic control environment.

Nagarajan, N.↗

On the internal target model in a tracking task

An optimal control model for predicting operator's dynamic responses and errors in target tracking ability is summarized. The model, which predicts asymmetry in the tracking data, is dependent on target maneuvers and trajectories. Gunners perception, decision making, control, and estimate of target positions and velocity related to crossover intervals are discussed. The model provides estimates for means, standard deviations, and variances for variables investigated and for operator estimates of future target positions and velocities.

Caglayan, A. K.↗

Optimum equipment maintenance/replacement policy. Part 2: Markov decision approach

Dynamic programming was utilized as an alternative optimization technique to determine an optimal policy over a given time period. According to a joint effect of the probabilistic transition of states and the sequence of decision making, the optimal policy is sought such that a set of decisions optimizes the long-run expected average cost (or profit) per unit time. Provision of an alternative measure for the expected long-run total discounted costs is also considered. A computer program based on the concept of the Markov Decision Process was developed and tested. The program code listing, the statement of a sample problem, and the computed results are presented.

Charng, T.↗

Necessary conditions for optimization in multiparameter discrete systems

A general first-order dynamic representation for discrete systems with several independent variables is proposed, based on the Dieudonne-Rashevsky form for partial differential equations. This representation does not restrict consideration to causal systems. A minimum principle for such systems is proved, thus extending results known for discrete-time systems to the case of several independent variables. The proof requires only the classical implicit function theorem.

Hegg, D. R.↗

Research and development activities in unified control-structure modeling and design

Results of work to develop a unified control/structures modeling and design capability for large space structures modeling are presented. Recent analytical results are presented to demonstrate the significant interdependence between structural and control properties. A new design methodology is suggested in which the structure, material properties, dynamic model and control design are all optimized simultaneously. Parallel research done by other researchers is reviewed. The development of a methodology for global design optimization is recommended as a long-term goal. It is suggested that this methodology should be incorporated into computer aided engineering programs, which eventually will be supplemented by an expert system to aid design optimization.

Nayak, A. P.↗

Control design for robust stability in linear regulators: Application to aerospace flight control

Time domain stability robustness analysis and design for linear multivariable uncertain systems with bounded uncertainties is the central theme of the research. After reviewing the recently developed upper bounds on the linear elemental (structured), time varying perturbation of an asymptotically stable linear time invariant regulator, it is shown that it is possible to further improve these bounds by employing state transformations. Then introducing a quantitative measure called the stability robustness index, a state feedback conrol design algorithm is presented for a general linear regulator problem and then specialized to the case of modal systems as well as matched systems. The extension of the algorithm to stochastic systems with Kalman filter as the state estimator is presented. Finally an algorithm for robust dynamic compensator design is presented using Parameter Optimization (PO) procedure. Applications in a aircraft control and flexible structure control are presented along with a comparison with other existing methods.

Yedavalli, R. K.↗

Optimal redesign study of the harm wing

The purpose of this project was to investigate the use of optimization techniques to improve the flutter margins of the HARM AGM-88A wing. The missile has four cruciform wings, located near mid-fuselage, that are actuated in pairs symmetrically and antisymmetrically to provide pitch, yaw, and roll control. The wings have a solid stainless steel forward section and a stainless steel crushed-honeycomb aft section. The wing restraint stiffness is dependent upon wing pitch amplitude and varies from a low value near neutral pitch attitude to a much higher value at off-neutral pitch attitudes, where aerodynamic loads lock out any free play in the control system. The most critical condition for flutter is the low-stiffness condition in which the wings are moved symmetrically. Although a tendency toward limit-cycle flutter is controlled in the current design by controller logic, wing redesign to improve this situation is attractive because it can be accomplished as a retrofit. In view of the exploratory nature of the study, it was decided to apply the optimization to a wing-only model, validated by comparison with results obtained by Texas Instruments (TI). Any wing designs that looked promising were to be evaluated at TI with more complicated models, including body modes. The optimization work was performed by McIntosh Structural Dynamics, Inc. (MSD) under a contract from TI.

Mcintosh, S. C., Jr.↗

Improving stability margins in discrete-time LQG controllers

Some of the problems are discussed which are encountered in the design of discrete-time stochastic controllers for problems that may adequately be described by the Linear Quadratic Gaussian (LQG) assumptions; namely, the problems of obtaining acceptable relative stability, robustness, and disturbance rejection properties. A dynamic compensator is proposed to replace the optimal full state feedback regulator gains at steady state, provided that all states are measurable. The compensator increases the stability margins at the plant input, which may possibly be inadequate in practical applications. Though the optimal regulator has desirable properties the observer based controller as implemented with a Kalman filter, in a noisy environment, has inadequate stability margins. The proposed compensator is designed to match the return difference matrix at the plant input to that of the optimal regulator while maintaining the optimality of the state estimates as directed by the measurement noise characteristics.

Oranc, B. Tarik↗

Trajectory optimization and guidance law development for national aerospace plane applications

The work completed to date is comprised of the following: a simple vehicle model representative of the aerospace plane concept in the hypersonic flight regime, fuel-optimal climb profiles for the unconstrained and dynamic pressure constrained cases generated using a reduced order dynamic model, an analytic switching condition for transition to rocket powered flight as orbital velocity is approached, simple feedback guidance laws for both the unconstrained and dynamic pressure constrained cases derived via singular perturbation theory and a nonlinear transformation technique, and numerical simulation results for ascent to orbit in the dynamic pressure constrained case.

Calise, A. J.↗

Overcoming the Bellman's curse of dimensionality in large optimization problems

Decomposition of large problems into a hierarchic pyramid of subproblems was proposed in the literature as a means for optimization of engineering systems too large for all-in-one optimization. This decomposition was established heuristically. The dynamic programming (DP) method due to Bellman was augmented with an optimum sensitivity analysis that provides a mathematical basis for the above decomposition, and overcomes the curse of dimensionality that limited the original formulation of DP. Numerical examples are cited.

Sobieszczanski-Sobieski, Jaroslaw↗