Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network convergence”

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 109 records · Page 6

High-Performance CCSDS Encapsulation Service Implementation in FPGA

The Consultative Committee for Space Data Systems (CCSDS) Encapsulation Service is a convergence layer between lower-layer space data link framing protocols, such as CCSDS Advanced Orbiting System (AOS), and higher-layer networking protocols, such as CFDP (CCSDS File Delivery Protocol) and Internet Protocol Extension (IPE). CCSDS Encapsulation Service is considered part of the data link layer. The CCSDS AOS implementation is described in the preceding article. Recent advancement in RF modem technology has allowed multi-megabit transmission over space links. With this increase in data rate, the CCSDS Encapsulation Service needs to be optimized to both reduce energy consumption and operate at a high rate. CCSDS Encapsulation Service has been implemented as an intellectual property core so that the aforementioned problems are solved by way of operating the CCSDS Encapsulation Service inside an FPGA. The CCSDS En capsula tion Service in FPGA implementation consists of both packetizing and de-packetizing features

Clare, Loren P.↗

Entry Abort Determination Using Non-Adaptive Neural Networks for Mars Precision Landers

The 2009 Mars Science Laboratory (MSL) will attempt the first precision landing on Mars using a modified version of the Apollo Earth entry guidance program. The guidance routine, Entry Terminal Point Controller (ETPC), commands the deployment of a supersonic parachute after converging the range to the landing target. For very dispersed cases, ETPC may not converge the range to the target and safely command parachute deployment within Mach number and dynamic pressure constraints. A full-lift up abort can save 85% of these failed trajectories while abandoning the precision landing objective. Though current MSL requirements do not call for an abort capability, an autonomous abort capability may be desired, for this mission or future Mars precision landers, to make the vehicle more robust. The application of artificial neural networks (NNs) as an abort determination technique was evaluated by personnel at the National Aeronautics and Space Administration (NASA) Johnson Space Center (JSC). In order to implement an abort, a failed trajectory needs to be recognized in real time. Abort determination is dependent upon several trajectory parameters whose relationships to vehicle survival are not well understood, and yet the lander must be trained to recognize unsafe situations. Artificial neural networks (NNs) provide a way to model these parameters and can provide MSL with the artificial intelligence necessary to independently declare an abort. Using the 2009 Mars Science Laboratory (MSL) mission as a case study, a non-adaptive NN was designed, trained and tested using Monte Carlo simulations of MSL descent and incorporated into ETPC. Neural network theory, the development history of the MSL NN, and initial testing with severe dust storm entry trajectory cases are discussed in Reference 1 and will not be repeated here. That analysis demonstrated that NNs are capable of recognizing failed descent trajectories and can significantly increase the survivability of MSL for very dispersed cases. NN testing was then broadened to evaluate fully dispersed entry trajectories. The NN correctly classified 99.7% of descent trajectories as abort or nonabort and reduced the probability of an unsafe parachute deployment by 83%. This second, broader testing phase is discussed in this paper.

Graybeal, Sarah R.↗

Neural Generalized Predictive Control: A Newton-Raphson Implementation

An efficient implementation of Generalized Predictive Control using a multi-layer feedforward neural network as the plant's nonlinear model is presented. In using Newton-Raphson as the optimization algorithm, the number of iterations needed for convergence is significantly reduced from other techniques. The main cost of the Newton-Raphson algorithm is in the calculation of the Hessian, but even with this overhead the low iteration numbers make Newton-Raphson faster than other techniques and a viable algorithm for real-time control. This paper presents a detailed derivation of the Neural Generalized Predictive Control algorithm with Newton-Raphson as the minimization algorithm. Simulation results show convergence to a good solution within two iterations and timing data show that real-time control is possible. Comments about the algorithm's implementation are also included.

Soloway, Donald↗

GRAPEVINE: Grids about anything by Poisson's equation in a visually interactive networking environment

A proven 3-D multiple-block elliptic grid generator, designed to run in 'batch mode' on a supercomputer, is improved by the creation of a modern graphical user interface (GUI) running on a workstation. The two parts are connected in real time by a network. The resultant system offers a significant speedup in the process of preparing and formatting input data and the ability to watch the grid solution converge by replotting the grid at each iteration step. The result is a reduction in user time and CPU time required to generate the grid and an enhanced understanding of the elliptic solution process. This software system, called GRAPEVINE, is described, and certain observations are made concerning the creation of such software.

Sorenson, Reese L.↗

A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs

This paper presents a self-stabilizing distributed clock synchronization protocol in the absence of faults in the system. It is focused on the distributed clock synchronization of an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period. We present an outline of a deductive proof of the correctness of the protocol. A bounded model of the protocol was mechanically verified for a variety of topologies. Results of the mechanical proof of the correctness of the protocol are provided. The model checking results have verified the correctness of the protocol as they apply to the networks with unidirectional and bidirectional links. In addition, the results confirm the claims of determinism and linear convergence. As a result, we conjecture that the protocol solves the general case of this problem. We also present several variations of the protocol and discuss that this synchronization protocol is indeed an emergent system.

Malekpour, Mahyar R.↗

Strain accumulation in the Shumagin Islands: Results of initial GPS measurements

Deformation in the Shumagin seismic gap has been monitored with repeated trilateration (EDM) in the 1980-1987 interval and with the Global Positioning System (GPS) in the 1987-1991 interval. The geodetic network extends for 100-km across the Shumagin Islands to the Alaska Peninsula. Results from the GPS surveys are consistent with those previously reported for the EDM surveys: we failed to detect significant strain accumulation in the N30 deg W direction of plate convergence. Using the method of simultaneous reduction for position and strain rates, we found the average rate of extension in the direction of plate convergence to be -25 +/- 25 nanostrain/yr (nstrain/yr) during the 1987-1991 interval of GPS surveys compared with -20 +/- 15 nstrain/yr during the 1981-1987 interval of complete EDM surveys. We found a marginally significant -26 +/- 12 nstrain/yr extension rate in the 1981-1991 interval covered by the combined EDM and GPS surveys. Strain rates are higher, but not significantly so, in the part of the network closest to the trench. Spatial variation in the deformation is observed in the 1980-1991 average station velocities, where three of the four stations closest to the trench have an arcward velocity of a few mm/yr. The observed strain rates are an order of magnitude lower than the -200 nstrain/yr rate predicted by dislocation models.

Larson, Kristine M.↗

An introduction to the global positioning system and some geological applications

The fundamental principles of the global positioning system (GPS) are reviewed, with consideration given to geological and geophysical applications and related accuracy requirements. Recent improvements are emphasized which relate to areas such as equipment cost, limitations in the GPS satellite constellation, data analysis, uncertainties in satellite orbits and propagation delays, and problems in resolving carrier phase cycle ambiguities. Earthquake processes and near-fault crustal deformation monitoring have been facilitated by advances in GPS data acquisition and analysis. Horizontal positioning capability has been improved by new satellite constellation, better models, and global tracking networks. New classes of tectonic problems may now be studied through GPS, such as kinematic descriptions of crustal deformation and the measurement of relative plate motion at convergent boundaries. Continued improvements in the GPS are foreseen.

Dixon, T. H.↗

Case Study: Test Results of a Tool and Method for In-Flight, Adaptive Control System Verification on a NASA F-15 Flight Research Aircraft

Adaptive control technologies that incorporate learning algorithms have been proposed to enable autonomous flight control and to maintain vehicle performance in the face of unknown, changing, or poorly defined operating environments [1-2]. At the present time, however, it is unknown how adaptive algorithms can be routinely verified, validated, and certified for use in safety-critical applications. Rigorous methods for adaptive software verification end validation must be developed to ensure that. the control software functions as required and is highly safe and reliable. A large gap appears to exist between the point at which control system designers feel the verification process is complete, and when FAA certification officials agree it is complete. Certification of adaptive flight control software verification is complicated by the use of learning algorithms (e.g., neural networks) and degrees of system non-determinism. Of course, analytical efforts must be made in the verification process to place guarantees on learning algorithm stability, rate of convergence, and convergence accuracy. However, to satisfy FAA certification requirements, it must be demonstrated that the adaptive flight control system is also able to fail and still allow the aircraft to be flown safely or to land, while at the same time providing a means of crew notification of the (impending) failure. It was for this purpose that the NASA Ames Confidence Tool was developed [3]. This paper presents the Confidence Tool as a means of providing in-flight software assurance monitoring of an adaptive flight control system. The paper will present the data obtained from flight testing the tool on a specially modified F-15 aircraft designed to simulate loss of flight control faces.

Jacklin, Stephen A.↗

Numerical Modeling of Pressurization of Cryogenic Propellant Tank for Integrated Vehicle Fluid System

This paper presents a numerical model of pressurization of a cryogenic propellant tank for the Integrated Vehicle Fluid (IVF) system using the Generalized Fluid System Simulation Program (GFSSP). The IVF propulsion system, being developed by United Launch Alliance, uses boiloff propellants to drive thrusters for the reaction control system as well as to run internal combustion engines to develop power and drive compressors to pressurize propellant tanks. NASA Marshall Space Flight Center (MSFC) has been running tests to verify the functioning of the IVF system using a flight tank. GFSSP, a finite volume based flow network analysis software developed at MSFC, has been used to develop an integrated model of the tank and the pressurization system. This paper presents an iterative algorithm for converging the interface boundary conditions between different component models of a large system model. The model results have been compared with test data.

Majumdar, Alok K.↗

A Trilateration Scheme for Relative Positioning

We introduce a trilateration scheme that evaluates the 3-dimensional (3-D) relative position between a reference spacecraft and a target spacecraft using raw-range measurements from a distance baseline of known locations, which we call “anchors”. The anchors can be antennas of a ground-based network (e.g., Deep Space Network (DSN) or Near Earth Network (NEN) stations), or satellites of a spacebased network (e.g., global positioning system (GPS) or tracking and data relay satellite (TDRS)). We define raw-range as the range that includes all the systematic errors that occur during range measurements. A unique feature of this approach is that accurate relative position is derived from a “differencing function” of raw-range measurements of the reference spacecraft and target spacecraft, thereby eliminating most of the systematic errors, such as media effects, ephemeris errors, instrument delays, clock bias, etc. There can be an arbitrary number of target spacecraft, and relative positioning of target spacecraft with respect to the reference spacecraft can be done simultaneously. In this paper, we first assume an idealized system in which clocks on the reference and target spacecraft are synchronized, with clocks of the anchors synchronized as well. We develop a novel iterative algorithm that computes the relative position of the target spacecraft with respect to the reference spacecraft. We illustrate the relative positioning method using the scenario of a network of three ground stations (i.e., the anchors) at Goldstone, California, USA, Madrid, Spain, and Marlargue, Argentina tracking two spacecraft at geosynchronous orbit distance. We demonstrate that the algorithm converges to submeter accuracy in estimating the relative position, in the presence of random errors and systematic errors in raw-range measurements, and in the presence of angular errors in estimating the pointing vectors between the anchors and the reference spacecraft. Next, we relax the requirement of perfect time synchronization between spacecraft, and show that by using an additional anchor, one can estimate and remove the clock biases between the reference and target spacecraft. We add a ground station at Kourou to the above example of three ground stations of Goldstone, Madrid, and Marlargue, and demonstrate that the updated algorithm also converges to meter-level accuracy (submeter in some cases) in the presence of clock biases in addition to the random errors, systematic errors, and angular errors as shown in the above case. We compare this scheme with a similar trilateration scheme for relative positioning scheme first proposed by Montenbruck in 2002.

Cheung, Kar-Ming↗

New Horizons for a Practical and Performance-Optimized Solar System Internet

The High-rate Delay Tolerant Networking (HDTN) project at the NASA Glenn Research Center (GRC) is developing a performance-optimized Delay Tolerant Networking (DTN) implementation using the Bundle Protocol (BP) both for infusion in modern, distributed spacecraft systems and for foundational network research purposes. While one purpose of networking is to enable a returns-to-scale with communicating assets, it is recognized that neither the protocol nor its implementations may impose a bottleneck on data delivery if expected to be implemented. With this in mind, this paper explores the current status of the HDTN software, including its capabilities and also various performance metrics at the bundle layer, the convergence layers (e.g. performance-optimized Licklider Transmission Protocol, or LTP), and bundle storage and retrieval. This includes goals of software implementations that support multi-gigabit per second communications regardless of payload size. A discussion on the current software architecture and internal scheduling and routing is included. Interoperability with such extant DTN implementations as Interplanetary Overlay Network (ION) and DTN Marshall Enterprise Implementation (DTNME) are included. The research goals of the project are also listed, including Software-Defined Networking (SDN) and the theory of DTNs. A table-based filtration system for the Bundle Protocol (BP), called BP Filter, is also explored: this addition enables table-based policies within the context of a DTN for management purposes. Infusion begins with systems testing in the Johnson Space Center (JSC) Software Development and Integration Laboratory (SDIL), which supports International Space Station (ISS) Flight Software development, integration, and verification. Observations made from the results of testing in the SDIL and in flight testing are also discussed, pointing to a path for infusion into high data return low-earth orbit (LEO) missions. The paper concludes with areas for future work.

Delay Tolerant Networking↗

Prediction of Aerodynamic Coefficient using Genetic Algorithm Optimized Neural Network for Sparse Data

Wind tunnels use scale models to characterize aerodynamic coefficients, Wind tunnel testing can be slow and costly due to high personnel overhead and intensive power utilization. Although manual curve fitting can be done, it is highly efficient to use a neural network to define the complex relationship between variables. Numerical simulation of complex vehicles on the wide range of conditions required for flight simulation requires static and dynamic data. Static data at low Mach numbers and angles of attack may be obtained with simpler Euler codes. Static data of stalled vehicles where zones of flow separation are usually present at higher angles of attack require Navier-Stokes simulations which are costly due to the large processing time required to attain convergence. Preliminary dynamic data may be obtained with simpler methods based on correlations and vortex methods; however, accurate prediction of the dynamic coefficients requires complex and costly numerical simulations. A reliable and fast method of predicting complex aerodynamic coefficients for flight simulation I'S presented using a neural network. The training data for the neural network are derived from numerical simulations and wind-tunnel experiments. The aerodynamic coefficients are modeled as functions of the flow characteristics and the control surfaces of the vehicle. The basic coefficients of lift, drag and pitching moment are expressed as functions of angles of attack and Mach number. The modeled and training aerodynamic coefficients show good agreement. This method shows excellent potential for rapid development of aerodynamic models for flight simulation. Genetic Algorithms (GA) are used to optimize a previously built Artificial Neural Network (ANN) that reliably predicts aerodynamic coefficients. Results indicate that the GA provided an efficient method of optimizing the ANN model to predict aerodynamic coefficients. The reliability of the ANN using the GA includes prediction of aerodynamic coefficients to an accuracy of 110% . In our problem, we would like to get an optimized neural network architecture and minimum data set. This has been accomplished within 500 training cycles of a neural network. After removing training pairs (outliers), the GA has produced much better results. The neural network constructed is a feed forward neural network with a back propagation learning mechanism. The main goal has been to free the network design process from constraints of human biases, and to discover better forms of neural network architectures. The automation of the network architecture search by genetic algorithms seems to have been the best way to achieve this goal.

Rajkumar, T.↗

A stable second order method for training back propagation networks

A simple method for improving the learning rate of the back-propagation algorithm is described. The basis of the method is that approximate second order corrections can be incorporated in the output units. The extended method leads to significant improvements in the convergence rate.

Nachtsheim, Philip R.↗

Investigation of mesoscale pre-convective forcing mechanisms

The installation and testing of a numerical mesoscale boundary layer model is discussed. A data analysis is first made using the rawinsonde network which shows a strong baroclinic zone developing in the region where convection was initiated. The observed wind field shows an easterly component developing in opposition to the synoptic flow producing convergence. The numerical boundary layer model is used to diagnose the physical development of the thermal and flow fields. Two physical mechanisms are examined; topography and cloud shading. The results shows that while heated sloping topography alone does create a baroclinic zone and convergence values, cloud shading is a stronger mechanism for producing a thermal field representative of observed conditions

Mcnider, R. T.↗

Heat Transfer in a Complex Trailing Edge Passage for a High Pressure Turbine Blade - Part 1: Experimental Measurements: Experimental Measurements - Part 1

A combined experimental and computational study has been performed to investigate the detailed heat transfer coefficient distributions within a complex blade trailing edge passage. The experimental measurements are made using a steady liquid crystal thermography technique applied to one major side of the passage. The geometry of the trailing edge passage is that of a two-pass serpentine circuit with a sharp 180-degree turning region at the tip. The upflow channel is split by interrupted ribs into two major subchannels, one of which is turbulated. This channel has an average aspect ratio of roughly 14:1. The spanwise extent of the channel geometry includes both area convergence from root to tip, as well as taper towards the trailing edge apex. The average section Reynolds numbers tested in this upflow channel range from 55,000 to 98,000. The tip section contains a turning vane near the extreme comer. The downflow channel has an aspect ratio of about 5:1, and also includes convergence and taper. Turbulators of varying sizes are included in this channel also. Both detailed heat transfer and pressure distribution measurements are presented. The pressure measurements are incorporated into a flow network model illustrating the major loss contributors.

Bunker, Ronald S.↗

Preliminary Work for Examining the Scalability of Reinforcement Learning

Researchers began studying automated agents that learn to perform multiple-step tasks early in the history of artificial intelligence (Samuel, 1963; Samuel, 1967; Waterman, 1970; Fikes, Hart & Nilsonn, 1972). Multiple-step tasks are tasks that can only be solved via a sequence of decisions, such as control problems, robotics problems, classic problem-solving, and game-playing. The objective of agents attempting to learn such tasks is to use the resources they have available in order to become more proficient at the tasks. In particular, each agent attempts to develop a good policy, a mapping from states to actions, that allows it to select actions that optimize a measure of its performance on the task; for example, reducing the number of steps necessary to complete the task successfully. Our study focuses on reinforcement learning, a set of learning techniques where the learner performs trial-and-error experiments in the task and adapts its policy based on the outcome of those experiments. Much of the work in reinforcement learning has focused on a particular, simple representation, where every problem state is represented explicitly in a table, and associated with each state are the actions that can be chosen in that state. A major advantage of this table lookup representation is that one can prove that certain reinforcement learning techniques will develop an optimal policy for the current task. The drawback is that the representation limits the application of reinforcement learning to multiple-step tasks with relatively small state-spaces. There has been a little theoretical work that proves that convergence to optimal solutions can be obtained when using generalization structures, but the structures are quite simple. The theory says little about complex structures, such as multi-layer, feedforward artificial neural networks (Rumelhart & McClelland, 1986), but empirical results indicate that the use of reinforcement learning with such structures is promising. These empirical results make no theoretical claims, nor compare the policies produced to optimal policies. A goal of our work is to be able to make the comparison between an optimal policy and one stored in an artificial neural network. A difficulty of performing such a study is finding a multiple-step task that is small enough that one can find an optimal policy using table lookup, yet large enough that, for practical purposes, an artificial neural network is really required. We have identified a limited form of the game OTHELLO as satisfying these requirements. The work we report here is in the very preliminary stages of research, but this paper provides background for the problem being studied and a description of our initial approach to examining the problem. In the remainder of this paper, we first describe reinforcement learning in more detail. Next, we present the game OTHELLO. Finally we argue that a restricted form of the game meets the requirements of our study, and describe our preliminary approach to finding an optimal solution to the problem.

Clouse, Jeff↗

The diurnal interaction between convection and peninsular-scale forcing over South Florida

One of the outstanding problems in modern meterology is that of describing in detail the manner in which larger scales of motion interact with, influence and are influenced by successively smaller scales of motion. The present investigation is concerned with a study of the diurnal evolution of convection, the interaction between the peninsular-scale convergence and convection, and the role of the feedback produced by the cloud-scale downdrafts in the maintenance of the convection. Attention is given to the analysis, the diurnal cycle of the network area-averaged divergence, convective-scale divergence, convective mass transports, and the peninsular scale divergence. The links established in the investigation between the large scale (peninsular), the mesoscale (network), and the convective scale (cloud) are found to be of fundamental importance to the understanding of the initiation, maintenance, and decay of deep precipitating convection and to its theoretical parameterization.

Cooper, H. J.↗

User's guide for NETS/PROSSS

Expensive analysis programs are often combined with optimization procedures to solve engineering problems. To obtain an optimal solution requires numerous iterations between the analysis program and the optimizer. This often becomes prohibitive due to the cost and amount of computer time needed to converge to an optimal solution. NETS/PROSSS was developed to address this problem. The purpose of this paper is to serve as a user's guide for NETS/PROSSS. The key features include the neural network, determining the training pairs for the neural network, and the approximated analysis/optimization process. A small problem is given to serve as an example of how to apply the system.

Rogers, James L.↗