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 325 records · Page 18

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Flight evaluation of a computer aided low-altitude helicopter flight guidance system

The Flight Systems Development branch of the U.S. Army's Avionics Research and Development Activity (AVRADA) and NASA Ames Research Center developed for flight testing a Computer Aided Low-Altitude Helicopter Flight (CALAHF) guidance system. The system includes a trajectory-generation algorithm which uses dynamic programming and a helmet-mounted display (HMD) presentation of a pathway-in-the-sky, a phantom aircraft, and flight-path vector/predictor guidance symbology. The trajectory-generation algorithm uses knowledge of the global mission requirements, a digital terrain map, aircraft performance capabilities, and precision navigation information to determine a trajectory between mission waypoints that seeks valleys to minimize threat exposure. This system was developed and evaluated through extensive use of piloted simulation and has demonstrated a 'pilot centered' concept of automated and integrated navigation and terrain mission planning flight guidance. This system has shown a significant improvement in pilot situational awareness, and mission effectiveness as well as a decrease in training and proficiency time required for a near terrain, nighttime, adverse weather system.

Swenson, Harry N.↗

NASA NTRS1992

Optimal evaluation of array expressions on massively parallel machines

We investigate the problem of evaluating FORTRAN 90 style array expressions on massively parallel distributed-memory machines. On such machines, an elementwise operation can be performed in constant time for arrays whose corresponding elements are in the same processor. If the arrays are not aligned in this manner, the cost of aligning them is part of the cost of evaluating the expression. The choice of where to perform the operation then affects this cost. We present algorithms based on dynamic programming to solve this problem efficiently for a wide variety of interconnection schemes, including multidimensional grids and rings, hypercubes, and fat-trees. We also consider expressions containing operations that change the shape of the arrays, and show that our approach extends naturally to handle this case.

Chatterjee, Siddhartha↗

NASA NTRS1977

Automatic speech recognition technology development at ITT Defense Communications Division

An assessment of the applications of automatic speech recognition to defense communication systems is presented. Future research efforts include investigations into the following areas: (1) dynamic programming; (2) recognition of speech degraded by noise; (3) speaker independent recognition; (4) large vocabulary recognition; (5) word spotting and continuous speech recognition; and (6) isolated word recognition.

White, George M.↗

NASA NTRS1990

On well-partial-order theory and its application to combinatorial problems of VLSI design

We nonconstructively prove the existence of decision algorithms with low-degree polynomial running times for a number of well-studied graph layout, placement, and routing problems. Some were not previously known to be in p at all; others were only known to be in p by way of brute force or dynamic programming formulations with unboundedly high-degree polynomial running times. Our methods include the application of the recent Robertson-Seymour theorems on the well-partial-ordering of graphs under both the minor and immersion orders. We also briefly address the complexity of search versions of these problems.

Fellows, M.↗

NASA NTRS1993

PTTI-aided ephemeris calculation and rapid data link acquisition for manned space flight

Complexity of future manned space flight mission control can be significantly reduced by integrating GPS, the PTTI source, into telemetry, tracking, and command (TT&C). Future telecommunications, space tracking electronic intelligence, metrology, navigation, and data acquisition will thereby be served, including: on-board ephemeris determination, reduced synchronization time for time division multiple access (TDMA) links, and in-flight clock calibration, increasing on-board autonomy and reducing ground support costs. Manned space transportation through the first quarter of the 21st century will probably depend on a mix of vehicles, including the Advanced Manned Launch System (AMLS), the Personnel Launch System (PLS), and continued use of the Shuttle Fleet. Precise Ephemeris is important on-board for mission success, status monitoring, also for rendezvous and docking. Use of GPS can eliminate ground based tracking/processing, enhancing autonomy and reducing communications bandwidth. GPS time can simplify complicated functions used in bandwidth efficient time division multiple access (TDMA) communications, such as: precise and realtime synchronization of receive reference timing, transmit-timing and acquisition control, unique synchronization word (UW) detection, and elastic buffering. High clock accuracy provides increased signal-to-noise (S/N) ratio during acquisition, permitting narrower acquisition frequency and time windows. Spaceborne systems requirements to provide capabilities such as: refinement of the GEM-72 gravity model based on satellite tracking observations from ATS-6 to GEOS-3, relativistic clock experiments, NASA crustal dynamics program for developing space geodetic techniques to study the earth's crust, its gravity field, and earthquake mechanisms, and multi-disciplinary space geodetic tracking for studying global climatic changes are also reviewed.

Anderman, Alfred↗

NASA NTRS1993

MERCATOR: Methods and Realization for Control of the Attitude and the Orbit of spacecraft

Since 1974, CNES has been involved in geostationary positioning. Among different entities participating in operations and their preparation, the Flight Dynamics Center (FDC) is in charge of performing the following tasks: orbit determination; attitude determination; computation, monitoring, and calibration of orbit maneuvers; computation, monitoring, and calibration of attitude maneuvers; and operational predictions. In order to fulfill this mission, the FDC receives telemetry from the satellite and localization measurements from ground stations (e.g., CNES, NASA, INTELSAT). These data are processed by space dynamics programs integrated in the MERCATOR system which is run on SUN workstations (UNIX O.S.). The main features of MERCATOR are redundancy, modularity, and flexibility: efficient, flexible, and user friendly man-machine interface; and four identical SUN stations redundantly linked in an Ethernet network. Each workstation can perform all the tasks from data acquisition to computation results dissemination through a video network. A team of four engineers can handle the space mechanics aspects of a complete geostationary positioning from the injection into a transfer orbit to the final maneuvers in the station-keeping window. MERCATOR has been or is to be used for operations related to more than ten geostationary positionings. Initially developed for geostationary satellites, MERCATOR's methodology was also used for satellite control centers and can be applied to a wide range of satellites and to future manned missions.

Tavernier, Gilles↗

NASA NTRS1994

Prediction of engine performance and wall erosion due to film cooling for the 'fast track' ablative thrust chamber

Efforts have been made at the Propulsion Laboratory (MSFC) to design and develop new liquid rocket engines for small-class launch vehicles. Emphasis of the efforts is to reduce the engine development time with the use of conventional designs while meeting engine reliability criteria. Consequently, the engine cost should be reduced. A demonstrative ablative thrust chamber, called 'fast-track', has been built. To support the design of the 'fast-track' thrust chamber, predictions of the wall temperature and ablation erosion rate of the 'fast-track' thrust chamber have been performed using the computational fluid dynamics program REFLEQS (Reactive Flow Equation Solver). The analysis is intended to assess the amount of fuel to be used for film cooling so that the erosion rate of the chamber ablation does not exceed its allowable limit. In addition, the thrust chamber performance loss due to an increase of the film cooling is examined.

Trinh, Huu P.↗

NASA NTRS1994

Optimal active control for Burgers equations

A method for active fluid flow control based on control theory is discussed. Dynamic programming and fixed point successive approximations are used to accommodate the nonlinear control problem. The long-term goal of this project is to establish an effective method applicable to complex flows such as turbulence and jets. However, in this report, the method is applied to stochastic Burgers equation as an intermediate step towards this goal. Numerical results are compared with those obtained by gradient search methods.

Ikeda, Yutaka↗

NASA NTRS1995

The role of overset grids in the development of the general purpose CFD code

A discussion of the strengths and weaknesses of overset composite grid and solution technology is given, along with a sampling of current work in the area. Major trends are identified, and the observation is made that generalized and hybridized overset methods provide a natural framework for combining disparate mesh types and physics models. Because of this, the author concludes that overset methods will be the foundation for the general purpose computational fluid dynamics programs of the future.

Belk, Davy M.↗

NASA NTRS1995

SOI/MDI studies of active region seismology and evolution

The solar oscillations investigation (SOI) will study solar active regions using both helioseismic and conventional observation techniques. The Michelson Doppler imager (MDI) can perform Doppler continuum and line depth imagery and can produce longitudinal magnetograms, showing either the full disk or a high resolution field of view. A dynamics program of continuous full disk Doppler observations for two months per year, campaign programs of eight hours of continuous observation per day, and a synoptic magnetic program of about 15 full disk magnetograms per day, are planned. The scientific plans, measurements and observation programs, are described.

Tarbell, Ted D.↗

NASA NTRS1996

Communications and information research: Improved space link performance via concatenated forward error correction coding

With the development of new advanced instruments for remote sensing applications, sensor data will be generated at a rate that not only requires increased onboard processing and storage capability, but imposes demands on the space to ground communication link and ground data management-communication system. Data compression and error control codes provide viable means to alleviate these demands. Two types of data compression have been studied by many researchers in the area of information theory: a lossless technique that guarantees full reconstruction of the data, and a lossy technique which generally gives higher data compaction ratio but incurs some distortion in the reconstructed data. To satisfy the many science disciplines which NASA supports, lossless data compression becomes a primary focus for the technology development. While transmitting the data obtained by any lossless data compression, it is very important to use some error-control code. For a long time, convolutional codes have been widely used in satellite telecommunications. To more efficiently transform the data obtained by the Rice algorithm, it is required to meet the a posteriori probability (APP) for each decoded bit. A relevant algorithm for this purpose has been proposed which minimizes the bit error probability in the decoding linear block and convolutional codes and meets the APP for each decoded bit. However, recent results on iterative decoding of 'Turbo codes', turn conventional wisdom on its head and suggest fundamentally new techniques. During the past several months of this research, the following approaches have been developed: (1) a new lossless data compression algorithm, which is much better than the extended Rice algorithm for various types of sensor data, (2) a new approach to determine the generalized Hamming weights of the algebraic-geometric codes defined by a large class of curves in high-dimensional spaces, (3) some efficient improved geometric Goppa codes for disk memory systems and high-speed mass memory systems, and (4) a tree based approach for data compression using dynamic programming.

Rao, T. R. N.↗

NASA NTRS1998

Optimal Scheduling of a Multi-User, Multi-Tasking Automatic Robotic Telescope

An algorithm is introduced to generate the optimal schedule of observations for a multi-user, multi-tasking automatic robotic telescope. The schedule is optimal m that it will take the highest possible quality data, perform the largest number of tasks, and fairly serve multiple users in terms of data quality, allocated telescope time, and observation priorities. In addition, the algorithm addresses problems due to overloading and underloading the telescope. The algorithm, which employs dynamic-programming-based decision theory, is analytically proven to produce the optimal schedule using set theory. Simulations conducted using actual astronomical data are presented which show significant improvement over existing scheduling techniques. Once completed the new scheduling algorithm will be tested on the Tennessee State University/Harvard-Smithsonian Center for Astrophysics 32-inch automatic Photoelectric Telescope at Fairborn Observatory, Arizona.

Tantaris, R. N.↗

NASA NTRS1998

Three-Dimensional Road Network by Fusion of Polarimetric and Interferometric SAR Data

In this paper a fuzzy classification procedure is applied to polarimetric radar measurements, and street pixels are detected. These data are successively grouped into consistent roads by means of a dynamic programming approach based on the fuzzy membership function values. Further fusion of the 2D road network extracted and 3D TOPSAR measurements provides a powerful way to analyze urban infrastructures.

Gamba, P.↗

NASA NTRS1996

Uncertainty Analysis for Oil-Film Interferometry Skin-Friction Measurement Techniques

Over the past 20 years, the use of oil-film interferometry to measure the skin friction coefficient (C(sub f) = tau/q where tau is the surface shear stress and q is the dynamic pressure) has increased. Different forms of this oil-film technique with various levels of accuracy and ease of use have been successfully applied in a wide range of flows. The method's popularity is growing due to its relative ease of implementation and minimal intrusiveness as well as an increased demand for C(sub f) measurements. Nonetheless, the accuracy of these methods has not been rigorously addressed to date. Most researchers have simply shown that the skin-friction measurements made using these techniques compare favorably with other measurements and theory, most of which are only accurate to within 5-20%. The use of skin-friction data in the design of commercial aircraft, whose drag at cruise is 50% skin-friction drag, and in the validation of computational fluid dynamics programs warrants better uncertainty estimates. Additional information is contained in the original extended abstract.

Naughton, Jonathan W.↗

NASA NTRS1996

Fuzzy Q-Learning for Generalization of Reinforcement Learning

Fuzzy Q-Learning, introduced earlier by the author, is an extension of Q-Learning into fuzzy environments. GARIC is a methodology for fuzzy reinforcement learning. In this paper, we introduce GARIC-Q, a new method for doing incremental Dynamic Programming using a society of intelligent agents which are controlled at the top level by Fuzzy Q-Learning and at the local level, each agent learns and operates based on GARIC. GARIC-Q improves the speed and applicability of Fuzzy Q-Learning through generalization of input space by using fuzzy rules and bridges the gap between Q-Learning and rule based intelligent systems.

Berenji, Hamid R.↗

NASA NTRS1997

Collaborating Fuzzy Reinforcement Learning Agents

Earlier, we introduced GARIC-Q, a new method for doing incremental Dynamic Programming using a society of intelligent agents which are controlled at the top level by Fuzzy Relearning and at the local level, each agent learns and operates based on ANTARCTIC, a technique for fuzzy reinforcement learning. In this paper, we show that it is possible for these agents to compete in order to affect the selected control policy but at the same time, they can collaborate while investigating the state space. In this model, the evaluator or the critic learns by observing all the agents behaviors but the control policy changes only based on the behavior of the winning agent also known as the super agent.

Berenji, Hamid R.↗

NASA NTRS2005

Path Planning Algorithms for the Adaptive Sensor Fleet

The Adaptive Sensor Fleet (ASF) is a general purpose fleet management and planning system being developed by NASA in coordination with NOAA. The current mission of ASF is to provide the capability for autonomous cooperative survey and sampling of dynamic oceanographic phenomena such as current systems and algae blooms. Each ASF vessel is a software model that represents a real world platform that carries a variety of sensors. The OASIS platform will provide the first physical vessel, outfitted with the systems and payloads necessary to execute the oceanographic observations described in this paper. The ASF architecture is being designed for extensibility to accommodate heterogenous fleet elements, and is not limited to using the OASIS platform to acquire data. This paper describes the path planning algorithms developed for the acquisition phase of a typical ASF task. Given a polygonal target region to be surveyed, the region is subdivided according to the number of vessels in the fleet. The subdivision algorithm seeks a solution in which all subregions have equal area and minimum mean radius. Once the subregions are defined, a dynamic programming method is used to find a minimum-time path for each vessel from its initial position to its assigned region. This path plan includes the effects of water currents as well as avoidance of known obstacles. A fleet-level planning algorithm then shuffles the individual vessel assignments to find the overall solution which puts all vessels in their assigned regions in the minimum time. This shuffle algorithm may be described as a process of elimination on the sorted list of permutations of a cost matrix. All these path planning algorithms are facilitated by discretizing the region of interest onto a hexagonal tiling.

Stoneking, Eric↗

NASA NTRS2006

Central East Pacific Flight Routing

With the introduction of the Federal Aviation Administration s Advanced Technology and Oceanic Procedures system at the Oakland Oceanic Center, a level of automation now exists in the oceanic environment to potentially begin accommodating increased user preferred routing requests. This paper presents the results of an initial feasibility assessment which examines the potential benefits of transitioning from the fixed Central East Pacific routes to user preferred routes. As a surrogate for the actual user-provided routing requests, a minimum-travel-time, wind-optimal dynamic programming algorithm was developed and utilized in this paper. After first describing the characteristics (e.g., origin airport, destination airport, vertical distribution and temporal distribution) of the westbound flights utilizing the Central East Pacific routes on Dec. 14-16 and 19-20, the results of both a flight-plan-based simulation and a wind-optimal-based simulation are presented. Whereas the lateral and longitudinal distribution of the aircraft trajectories in these two simulations varied dramatically, the number of simulated first-loss-of-separation events remained relatively constant. One area of concern that was uncovered in this initial analysis was a potential workload issue associated with the redistribution of traffic in the oceanic sectors due to thc prevailing wind patterns.

Grabbe, Shon↗