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.

SourceResearch connectionFrom yearThrough year

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

At least 289 records · Page 16

All sources NASA NTRS DOE OSTI

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↗

NASA NTRS1989

Modal reduction strategies for interconnected flexible bodies simulation

Multi-body dynamics programs require characterization of each body. The Galileo spacecraft system modes to be retained were determined using available criteria, modal influence coefficients, and bode. The descent to component level was achieved via a two-phase diagonalization process starting with submatrices of truncated augmented system modal matrix.

Eke, F. O.↗

NASA NTRS1987

Parallel processing for digital picture comparison

In picture processing an important problem is to identify two digital pictures of the same scene taken under different lighting conditions. This kind of problem can be found in remote sensing, satellite signal processing and the related areas. The identification can be done by transforming the gray levels so that the gray level histograms of the two pictures are closely matched. The transformation problem can be solved by using the packing method. Researchers propose a VLSI architecture consisting of m x n processing elements with extensive parallel and pipelining computation capabilities to speed up the transformation with the time complexity 0(max(m,n)), where m and n are the numbers of the gray levels of the input picture and the reference picture respectively. If using uniprocessor and a dynamic programming algorithm, the time complexity will be 0(m(3)xn). The algorithm partition problem, as an important issue in VLSI design, is discussed. Verification of the proposed architecture is also given.

Cheng, H. D.↗

NASA NTRS1989

Robot acting on moving bodies (RAMBO): Preliminary results

A robot system called RAMBO is being developed. It is equipped with a camera, which, given a sequence of simple tasks, can perform these tasks on a moving object. RAMBO is given a complete geometric model of the object. A low level vision module extracts and groups characteristic features in images of the object. The positions of the object are determined in a sequence of images, and a motion estimate of the object is obtained. This motion estimate is used to plan trajectories of the robot tool to relative locations nearby the object sufficient for achieving the tasks. More specifically, low level vision uses parallel algorithms for image enchancement by symmetric nearest neighbor filtering, edge detection by local gradient operators, and corner extraction by sector filtering. The object pose estimation is a Hough transform method accumulating position hypotheses obtained by matching triples of image features (corners) to triples of model features. To maximize computing speed, the estimate of the position in space of a triple of features is obtained by decomposing its perspective view into a product of rotations and a scaled orthographic projection. This allows the use of 2-D lookup tables at each stage of the decomposition. The position hypotheses for each possible match of model feature triples and image feature triples are calculated in parallel. Trajectory planning combines heuristic and dynamic programming techniques. Then trajectories are created using parametric cubic splines between initial and goal trajectories. All the parallel algorithms run on a Connection Machine CM-2 with 16K processors.

Davis, Larry S.↗

NASA NTRS1988

Simulation evaluation of helicopter Terrain Following/Terrain Avoidance concepts

A helicopter Terrain-Following/Terrain-Avoidance (TF/TA) system was developed and evaluated using a real-time piloted simulation. The TF/TA system included a guidance algorithm based upon dynamic programming and a head-up display (HUD) concept which incorporates a pathway in the sky, a phantom aircraft, and flightpath vector/predictor symbology. The simulation was conducted at the NASA Ames Research Center Interchangeable Cab (ICAB) Laboratory using NASA test pilots. The pilots performed the TF/TA task by manually tracking the HUD symbology. The pilots were able to satisfactorily perform the TF/TA tasks with an acceptable level of pilot workload.

Swenson, Herry N.↗

NASA NTRS1988

An estimate of equatorial wave energy flux at 9- to 90-day periods in the Central Pacific

Deep fluctuations in current along the equator in the Central Pacific are dominated by coherent structures which correspond closely to narrow-band propagating equatorial waves. Currents were measured roughly at 1500 and 3000 m depths at five moorings between 144 and 148 deg W from January 1981 to March 1983, as part of the Pacific Equatorial Ocean Dynamics program. In each frequency band resolved, a single complex empirical orthogonal function accounts for half to three quarters of the observed variance in either zonal or meridional current. Dispersion for equatorial first meridional Rossby and Rossby gravity waves is consistent with the observed vertical-zonal coherence structure. The observations indicate that energy flux is westward and downward in long first meridional mode Rossby waves at periods 45 days and longer, and eastward and downward in short first meridional mode Rossby waves and Rossby-gravity waves at periods 30 days and shorter. A local minimum in energy flux occurs at periods corresponding to a maximum in upper-ocean meridional current energy contributed by tropical instability waves. Total vertical flux across the 9- to 90-day period range is 2.5 kW/m.

Eriksen, Charles C.↗

NASA NTRS1989

Shape matching utilizing indexed hypotheses generation and testing

An indexing mechanism is developed as part of an overall scheme called SMITH (shape matching utilizing indexed hypothesis generation and testing) for two-dimensional model-based object recognition. The approach is based on a dynamic programming implementation of attributed string matching, is computationally efficient, and works effectively for both nonoccluded and occluded shapes. Another advantage of this technique is that models may be inserted or deleted with relatively little cost.

Mehrotra, Rajiv↗

NASA NTRS1989

Real-time approximate optimal guidance laws for the advanced launch system

An approach to optimal ascent guidance for a launch vehicle is developed using an expansion technique. The problem is to maximize the payload put into orbit subject to the equations of motion of a rocket over a rotating spherical earth. It is assumed that the thrust and gravitational forces dominate over the aerodynamic forces. It is shown that these forces can be separated by a small parameter epsilon, where epsilon is the ratio of the atmospheric scale height to the radius of the earth. The Hamilton-Jacobi-Bellman or dynamic programming equation is expanded in a series where the zeroth-order term (epsilon = 0) can be obtained in closed form. The zeroth-order problem is that of putting maximum payload into orbit subject to the equations of motion of a rocket in a vacuum over a flat earth. The neglected inertial and aerodynamic terms are included in higher order terms of the expansion, which are determined from the solution of first-order linear partial differential equations requiring only quadrature integrations. These quadrature integrations can be performed rapidly, so that real-time approximate optimization can be used to construct the launch guidance law.

Speyer, Jason L.↗

NASA NTRS1990

Forward Stochastic Nonlinear Adaptive Control Method

New method of computation for optimal stochastic nonlinear and adaptive control undergoing development. Solves systematically stochastic dynamic programming equations forward in time, using nested-stochastic-approximation technique. Main advantage, simplicity of programming and reduced complexity with clear performance/computation trade-offs.

Bayard, David S.↗

NASA NTRS1989

Component model reduction via the projection and assembly method

The problem of acquiring a simple but sufficiently accurate model of a dynamic system is made more difficult when the dynamic system of interest is a multibody system comprised of several components. A low order system model may be created by reducing the order of the component models and making use of various available multibody dynamics programs to assemble them into a system model. The difficulty is in choosing the reduced order component models to meet system level requirements. The projection and assembly method, proposed originally by Eke, solves this difficulty by forming the full order system model, performing model reduction at the the system level using system level requirements, and then projecting the desired modes onto the components for component level model reduction. The projection and assembly method is analyzed to show the conditions under which the desired modes are captured exactly; to the numerical precision of the algorithm.

Bernard, Douglas E.↗