Search NASA⌕ Search

SEARCH · Search NASA

Results for “Dynamic Programming”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

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.↗
NASA NTRS1982

Contaminant characterization of five satellite materials

An extensive laboratory test program was performed to characterize outgassing of five satellite materials. The materials were Chemglaze Z-306 over 9922 primer, M-773 adhesive, multilayer insulation, polyurethane foam, and silverized Teflon. The souces were prepared to the specifications of a typical satellite program. Dynamic thermogravimetric mass loss characteristics of these five materials were obtained in vacuum with a beam microbalance. The temperature of the material was linearly raised from 25 C to over 650 C while monitoring the mass loss, rate of mass loss, temperature, and the composition of the outgassed material by residual gas analysis. Isothermal source emission/capture coefficients/reemission parameters were obtained with an array of quartz crystal microbalances (QCM). A detailed test matrix in which the temperatures of the QCMs (-160 C, - 100 C, -40 C, and +10 C) and the source material (125 C, and 90 C, and 50 C) were varied was performed. The array of QCMs was also used to measure the spatial distribution of the source emission. The effects of vacuum ultraviolet radiation on the deposition and reemission parameters was determined.

Muscari, J. A.↗
NASA NTRS1984

Free-Vibration Analysis of Structures

Unified numerical procedure for free-vibration analysis of structures developed and incorporated into EIGSOL computer program. Dynamic response analysis of primary importance in design of wide range of practical structures such as space-craft, buildings, and rotating machineries. Procedure determines natural frequencies and associated modes in structural design.

Gupta, K. K.↗
NASA NTRS1982

Correlation and assessment of structural airplane crash data with flight parameters at impact

Crash deceleration pulse data from a crash dynamics program on general aviation airplanes and from transport crash data were analyzed. Structural airplane crash data and flight parameters at impact were correlated. Uncoupled equations for the normal and longitudinal floor impulses in the cabin area of the airplane were derived, and analytical expressions for structural crushing during impact and horizontal slide out were also determined. Agreement was found between experimental and analytical data for general aviation and transport airplanes over a relatively wide range of impact parameter. Two possible applications of the impulse data are presented: a postcrash evaluation of crash test parameters and an assumed crash scenario.

Carden, H. D.↗
NASA NTRS1984

Lewis Research Center spin rig and its use in vibration analysis of rotating systems

The Lewis Research Center spin rig was constructed to provide experimental evaluation of analysis methods developed under the NASA Engine Structural Dynamics Program. Rotors up to 51 cm (20 in.) in diameter can be spun to 16,000 rpm in vacuum by an air motor. Vibration forcing functions are provided by shakers that apply oscillatory axial forces or transverse moments to the shaft, by a natural whirling of the shaft, and by an air jet. Blade vibration is detected by strain gages and optical blade-tip motion sensors. A variety of analogy and digital processing equipment is used to display and analyze the signals. Results obtained from two rotors are discussed. A 56-blade compressor disk was used to check proper operation of the entire spin rig system. A special two-blade rotor was designed and used to hold flat and twisted plates at various setting and sweep angles. Accurate Southwell coefficients have been obtained for several modes of a flat plate oriented parallel to the plane of rotation.

Brown, G. V.↗
NASA NTRS1984

Highly mobile laser ranging facilities of the Crustal Dynamics Project

Technical specifications, performance, and applications of the NASA transportable laser ranging systems (TLRS-1 and -2) for use in the Crustal Dynamics Program are described. TLRS-1 is truck-mounted, with the laser deployed through the roof. Interacting with the LAGEOS satellite, TLRS has a photoelectric receiver for gathering data on the roundtrip time of the laser beam for calculations of the range gate. The laser has a 0.1 nsec pulse at 3.5 mJ/pulse. Range is measured to within an error of 9 cm. The TLRS-2 version is configured for ease of air transport and modular breakdown and assembly. It has been activated on Easter Island. TLRS-3 and -4 are in development to serve as mobile units in South America and the Mediterranean area.

Coates, R. J.↗
NASA NTRS1983

A multi-item maintenance center inventory model for low-demand reparable items

In many military and commercial contexts, complex equipment undergoes scheduled maintenance overhauls at regular intervals during which all failed components are replaced. Failure to have replacements on hand for all failed parts requires emergency measures at premium cost. When reparable parts are highly reliable and expensive, both holding and shortage costs are high. This model determines the reparable parts inventory for a maintenance center under three alternative criteria: (1) maximizing job-completion rate subject to constraint on total holding costs, (2) minimizing total holding costs plus expected job noncompletion costs, and (3) minimizing total holding costs subject to a required minimum job-completion rate. Exact solutions may be obtained using dynamic programming. Approximate solutions, found easily by marginal analysis, have readily computed bounds on possible error. The solution methods for the three formulations are illustrated in a simple example.

Schaefer, M. K.↗
NASA NTRS1984

Optimal maintenance center inventories for fault-tolerant repairable systems

A probabilistic approach is taken to determine the optimal repairable parts inventory for a maintenance center, servicing machines which contain several m-out-of-n systems of different parts, with a constraint on the total inventory investment. A model, based on the discrete Markov process, accounts for a typical ultrareliable avionics system, such as one presently being developed by NASA. The dynamic programming algorithm for minimizing the stockout and holding costs is applied to an exemplary maintenance center, and solutions for single-item and multi-item cases are given. The computational burden is noted to be reasonable and a computer program is used to generate optimal solutions.

Lawrence, S. H.↗
NASA NTRS1986

On scheduling tasks with a quick recovery from failure

Multiprocessors used in life-critical real-time systems must recover quickly from failure. Part of this recovery consists of switching to a new task schedule which ensures that hard deadlines for critical tasks continue to be met. A dynamic programming algorithm is presented that ensures that backup, or contingency, schedules can be efficiently embedded within the original, 'primary' schedule to ensure that hard deadlines continue to be met in the face of up to a given maximum number of processor failures. Several illustrative examples are included.

Krishna, C. M.↗
NASA NTRS1986

Parallel processors and nonlinear structural dynamics algorithms and software

A nonlinear structural dynamics program with an element library that exploits parallel processing is under development. The aim is to exploit scheduling-allocation so that parallel processing and vectorization can effectively be treated in a general purpose program. As a byproduct an automatic scheme for assigning time steps was devised. A rudimentary form of the program is complete and has been tested; it shows substantial advantage can be taken of parallelism. In addition, a stability proof for the subcycling algorithm has been developed.

Belytschko, T.↗
NASA NTRS1986

Dynamics During Thrust Maneuvers of Flexible Spinning Satellites with Axial and Radial Booms

The dynamic response to operational maneuvers of spinning symmetric spacecraft with radial and axial booms was analyzed as part of the prelaunch dynamic analysis of the ISEE-3 spacecraft placed in a halo orbit around an Earth-Sun libration point, and later renamed ICE when it was directed to fly-by comet Giacobini-Zinner. The results presented use simple spacecraft models, and frequently give predictions that are good and easily obtained when the results from using a general purpose multibody dynamics program were very time consuming to obtain. Deployment of radial booms, spin-up after partial deployment, stationkeeping, and trajectory changes are analyzed. The latter two can involve both axial thrusting and pulsed radial thrusting once per revolution.

Longman, R. W.↗
NASA NTRS1987

Optimal pre-scheduling of problem remappings

A large class of scientific computational problems can be characterized as a sequence of steps where a significant amount of computation occurs each step, but the work performed at each step is not necessarily identical. Two good examples of this type of computation are: (1) regridding methods which change the problem discretization during the course of the computation, and (2) methods for solving sparse triangular systems of linear equations. Recent work has investigated a means of mapping such computations onto parallel processors; the method defines a family of static mappings with differing degrees of importance placed on the conflicting goals of good load balance and low communication/synchronization overhead. The performance tradeoffs are controllable by adjusting the parameters of the mapping method. To achieve good performance it may be necessary to dynamically change these parameters at run-time, but such changes can impose additional costs. If the computation's behavior can be determined prior to its execution, it can be possible to construct an optimal parameter schedule using a low-order-polynomial-time dynamic programming algorithm. Since the latter can be expensive, the performance is studied of the effect of a linear-time scheduling heuristic on one of the model problems, and it is shown to be effective and nearly optimal.

Nicol, David M.↗
NASA NTRS1988

Search Problems in Mission Planning and Navigation of Autonomous Aircraft

An architecture for the control of an autonomous aircraft is presented. The architecture is a hierarchical system representing an anthropomorphic breakdown of the control problem into planner, navigator, and pilot systems. The planner system determines high level global plans from overall mission objectives. This abstract mission planning is investigated by focusing on the Traveling Salesman Problem with variations on local and global constraints. Tree search techniques are applied including the breadth first, depth first, and best first algorithms. The minimum-column and row entries for the Traveling Salesman Problem cost matrix provides a powerful heuristic to guide these search techniques. Mission planning subgoals are directed from the planner to the navigator for planning routes in mountainous terrain with threats. Terrain/threat information is abstracted into a graph of possible paths for which graph searches are performed. It is shown that paths can be well represented by a search graph based on the Voronoi diagram of points representing the vertices of mountain boundaries. A comparison of Dijkstra's dynamic programming algorithm and the A* graph search algorithm from artificial intelligence/operations research is performed for several navigation path planning examples. These examples illustrate paths that minimize a combination of distance and exposure to threats. Finally, the pilot system synthesizes the flight trajectory by creating the control commands to fly the aircraft.

Krozel, James A.↗
NASA NTRS1988

Dual adaptive control: Design principles and applications

The design of an actively adaptive dual controller based on an approximation of the stochastic dynamic programming equation for a multi-step horizon is presented. A dual controller that can enhance identification of the system while controlling it at the same time is derived for multi-dimensional problems. This dual controller uses sensitivity functions of the expected future cost with respect to the parameter uncertainties. A passively adaptive cautious controller and the actively adaptive dual controller are examined. In many instances, the cautious controller is seen to turn off while the latter avoids the turn-off of the control and the slow convergence of the parameter estimates, characteristic of the cautious controller. The algorithms have been applied to a multi-variable static model which represents a simplified linear version of the relationship between the vibration output and the higher harmonic control input for a helicopter. Monte Carlo comparisons based on parametric and nonparametric statistical analysis indicate the superiority of the dual controller over the baseline controller.

Mookerjee, Purusottam↗
NASA NTRS1986

A guidance law for the aeroassisted plane change maneuver in the presence of atmospheric uncertainties

A stochastic feedback control law for a space vehicle performing an aeroassisted plane-change maneuver is developed. The stochastic control law is designed to minimize the energy loss while taking into consideration the uncertainty in the atmospheric density. The solution is based on expansion of the stochastic Hamilton-Jacobi-Bellman equation (or dynamic programming) about a zeroth-order known integrable solution. The resulting guidance law is expressed as a series expansion in the noise power spectral densities. A numerical example indicates the potential improvement of this method.

Mishne, D.↗
NASA NTRS1987

Robot path planning with distance-safety criterion

A method for determining an optimal path with a weighted distance-safety criterion is developed. The goal is to strike a compromise between the shortest path and the centerline path, which is safer. The method is composed of three parts: (i) construction of a region map by dividing the workspace, (ii) interregion optimization to determine the entry and departure points of the path in each region, and (iii) intraregion optimization for determining the (optimal) path segment within each region. The region map is generated by using an approximate Voronoi diagram, and region optimization is achieved using variational dynamic programming. Although developed for 2-D problems, the method can be easily extended to a class of 3-D problems. Numerical examples are presented to demonstrate the method.

Suh, Suk-Hwan↗
NASA NTRS1987

Optimal service allocation among two heterogeneous traffic types with no queueing

Two communication traffic streams with Poisson statistics arrive at a network node. These are to be transmitted across a channel with a total bandwidth capacity of C slots. Messages not accepted at the node are assumed to be lost. Under the assumptions of exponential service time distributions, the problem of dynamic allocation of available channel bandwidth among the two traffic types is studied in order to minimize a weighted sum of blocking probabilities. Modeling the system as a two-dimensional Markov chain is studied to minimize a weighted sum of blocking probabilities. Modeling the system as a two-dimensional Markov chain, it is shown by an application of dynamic programming principles that the optimal policy has the form of a 'switching curve'.

Lambadaris, I.↗
NASA NTRS1987

Concurrent and vectorized mixed time, explicit nonlinear structural dynamics algorithms

A nonlinear structural dynamics program with an element library that exploits parallel processing is described. The aim is to exploit scheduling-allocation so that parallel processing and vectorization can effectively be treated in a general purpose program with explicit time integration and different time steps in different parts of the mesh. The program uses an element group scheme, which, as a by-product, also provides an automatic scheme for assigning different time steps to different parts of the mesh. The program has been tested on the Alliant FX/8; it shows a fivefold improvement in speed over compiler optimization.

Belytschko, Ted↗