Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONNECT algorithm”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Distributed decision-making for space operations

A programmatic and technical perspective in the context of future space applications is presented, that includes some of the management challenges that arise as the decision-making process becomes increasingly more decentralized. Three challenges are discussed: (1) the degree to which the planners must communicate with each other and with those who are seeking space operations resources, (2) the collection, management, employment and dissemination of the information needed to make decisions, and (3) the challenges connected with schedule integration. The technical perspective presented leads to recommended adaptations to the normal scheduling algorithms that retain the 'degrees of freedom' in the planning result. It is shown that these adaptations are specific technical responses to the programmatic challenges discussed.

Hornstein, Rhoda Shaller↗
NASA NTRS1990

Learning control system design based on 2-D theory - An application to parallel link manipulator

An approach to iterative learning control system design based on two-dimensional system theory is presented. A two-dimensional model for the iterative learning control system which reveals the connections between learning control systems and two-dimensional system theory is established. A learning control algorithm is proposed, and the convergence of learning using this algorithm is guaranteed by two-dimensional stability. The learning algorithm is applied successfully to the trajectory tracking control problem for a parallel link robot manipulator. The excellent performance of this learning algorithm is demonstrated by the computer simulation results.

Geng, Z.↗
NASA NTRS1999

Lightweight Battery Charge Regulator Used to Track Solar Array Peak Power

A battery charge regulator based on the series-connected boost regulator (SCBR) technology has been developed for high-voltage spacecraft applications. The SCBR regulates the solar array power during insolation to prevent battery overcharge or undercharge conditions. It can also be used to provide regulated battery output voltage to spacecraft loads if necessary. This technology uses industry-standard dc-dc converters and a unique interconnection to provide size, weight, efficiency, fault tolerance, and modularity benefits over existing systems. The high-voltage SCBR shown in the photograph has demonstrated power densities of over 1000 watts per kilogram (W/kg). Using four 150-W dc-dc converter modules, it can process 2500 W of power at 120 Vdc with a minimum input voltage of 90 Vdc. Efficiency of the SCBR was 94 to 98 percent over the entire operational range. Internally, the unit is made of two separate SCBR s, each with its own analog control circuitry, to demonstrate the modularity of the technology. The analog controllers regulate the output current and incorporate the output voltage limit with active current sharing between the two units. They also include voltage and current telemetry, on/off control, and baseplate temperature sensors. For peak power tracking, the SCBR was connected to a LabView-based data acquisition system for telemetry and control. A digital control algorithm for tracking the peak power point of a solar array was developed using the principle of matching the source impedance with the load impedance for maximum energy transfer. The algorithm was successfully demonstrated in a simulated spacecraft electrical system at the Boeing PhantomWorks High Voltage Test Facility in Seattle, Washington. The system consists of a 42-string, high-voltage solar array simulator, a 77-cell, 80-ampere-hour (A-hr) nickel-hydrogen battery, and a constant power-load module. The SCBR and the LabView control algorithm successfully tracked the solar array peak power point through various load transients, including sunlight discharge transients when the total load exceeded the maximum solar array output power.

Soeder, James F.↗
NASA NTRS2010

Thermoelectric Converter for Loop Heat Pipe Temperature Control: Experience and Lessons Learned

This paper describes the theoretical background and implementation methodology of using a thermoelectric converter (TEC) for operating temperature control of a loop heat pipe (LHP). In particular, experimental results from ambient and thermal vacuum tests of an LHP are presented for illustrations. The most commonly used state-of-the-art method to control the LHP operating temperature is to cold bias its compensation chamber (CC) and use an electrical heater to maintain the CC at the desired set point temperature. Although effective, this approach has its shortcomings in that the electrical heater can only provide heating to the CC, and the required power can be large under certain conditions. An alternative method is to use a TEC, which is capable of providing both heating and cooling to the CC. In this method, one side of the TEC is attached to the CC, and the other side is connected to the evaporator via a thermal strap. Using a bipolar power supply and a control algorithm, a TEC can function as a heater or a cooler, depending on the direction of the current flow. Extensive ground tests of several LHPs have demonstrated that a TEC can provide very tight temperature control for the CC. It also offers several additional advantages: (1) The LHP can operate at temperatures below its natural operating temperature at low heat loads; (2) The required heater power for a TEC is much less than that for an electrical heater; and (3) It enhances the LHP start-up success. Although the concept of using a TEC for LHP temperature control is simple, there are many factors to be considered in its implementation for space applications because the TEC is susceptible to the shear stress and yet has to sustain the dynamic load under the spacecraft launch environment. The added features that help the TEC to withstand the dynamic load will inevitably affect the TEC thermal performance. Some experiences and lessons learned are addressed in this paper.

Ku, Jentung↗
NASA NTRS2022

Quantifying Spatial Drought Propagation Potential in North America Using Complex Network Theory

Droughts have a dominant three-dimensional (3-D) spatiotemporal structure typically spanning hundreds of kilometers and often lasting for months to years. Here, we introduced a novel framework to explore the 3-D structure of the evolution of droughts based on network theory concepts. The proposed framework is applied to identify critical source regions responsible for large-scale drought onsets during 1901–2014 for the North American continent using the Standardized Precipitation Evaporation Index (SPEI). We built a spatial network connecting the drought onset timings for the North American continent. Using a spatially weighted network partitioning algorithm, the whole continent is then classified into regional spatial drought networks (RSN), where droughts are more likely to propagate within these regional systems. Finally, a customized network metric was applied to identify locations (source regions) where the drought onsets further propagate to other areas within the regional spatial network. Our results indicated that the West coast, Texas coastal region, and Southeastern Arkansas as major source regions through which atmospheric drought propagates to Western, South Central, and Eastern North America. The formation of drought source regions are due to presence of high pressure ridges and anomalous wind patterns. Furthermore, our results indicate that the drought propagation from these source regions may be due to inadequate moisture transport. The proposed framework can help to develop an early warning detection system for droughts and other spatially extensive extreme events such as heatwaves and floods.

Goutam Konapala↗
NASA NTRS1984

Generating soft shadows with a depth buffer algorithm

Computer-synthesized shadows used to appear with a sharp edge when cast onto a surface. At present the production of more realistic, soft shadows is considered. However, significant costs arise in connection with such a representation. The current investigation is concerned with a pragmatic approach, which combines an existing shadowing method with a popular visible surface rendering technique, called a 'depth buffer', to generate soft shadows resulting from light sources of finite extent. The considered method represents an extension of Crow's (1977) shadow volume algorithm.

Brotman, L. S.↗
NASA NTRS1989

Learning in stochastic neural networks for constraint satisfaction problems

Researchers describe a newly-developed artificial neural network algorithm for solving constraint satisfaction problems (CSPs) which includes a learning component that can significantly improve the performance of the network from run to run. The network, referred to as the Guarded Discrete Stochastic (GDS) network, is based on the discrete Hopfield network but differs from it primarily in that auxiliary networks (guards) are asymmetrically coupled to the main network to enforce certain types of constraints. Although the presence of asymmetric connections implies that the network may not converge, it was found that, for certain classes of problems, the network often quickly converges to find satisfactory solutions when they exist. The network can run efficiently on serial machines and can find solutions to very large problems (e.g., N-queens for N as large as 1024). One advantage of the network architecture is that network connection strengths need not be instantiated when the network is established: they are needed only when a participating neural element transitions from off to on. They have exploited this feature to devise a learning algorithm, based on consistency techniques for discrete CSPs, that updates the network biases and connection strengths and thus improves the network performance.

Johnston, Mark D.↗
NASA NTRS1985

AOTV bluff body flow - Relaxation algorithm

Preliminary investigations have led to the consideration of two classes of energy efficient aeroassisted orbital transfer vehicle (AOTV) concepts, with high and low L/D. The AOTV represent reentry space vehicles which are to fly hypersonically in the continuum upper reaches of the atmosphere. Problems arise in connection with convective and nonequilibrium radiative heating. As the possibilities for obtaining needed information by experimentation are limited, reliance must be placed on computational techniques to simulate testing of design concepts. A new relaxation algorithm for the compressible Navier-Stokes equations has been developed in the context of recent work with a conservative flux difference eigenvector split implicit upwind scheme CSCM (conservative supracharacteristics method). Attention is given to the CSCM implicit method, and early results for axisymmetric bluff body flow including complete forebody and base flow for a free flight range model drag brake AOTV.

Lombard, C. K.↗
NASA NTRS1991

New developments in astrodynamics algorithms for autonomous rendezvous

A the core of any autonomous rendezvous guidance system must be two algorithms for solving Lambert's and Kepler's problems, the two fundamental problems in classical astrodynamics. Lambert's problem is to determine the trajectory connecting specified initial and terminal position vectors in a specified transfer time. The solution is the initial and terminal velocity vectors. Kepler's problem is to determine the trajectory that stems from a given initial state (position and velocity). The solution is the state of an earlier or later specified time. To be suitable for flight software, astrodynamics algorithms must be totally reliable, compact, and fast. Although solving Lambert's and Kepler's problems has challenged some of the world's finest minds for over two centuries, only in the last year have algorithms appeared that satisfy all three requirements just stated. This paper presents an evaluation of the most highly regarded Lambert and Kepler algorithms.

Klumpp, Allan R.↗
NASA NTRS1987

A system for routing arbitrary directed graphs on SIMD architectures

There are many problems which can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from connecting vertices. A method is given for parallelizing such problems on an SIMD machine model that is bit-serial and uses only nearest neighbor connections for communication. Each vertex of the graph will be assigned to a processor in the machine. Algorithms are given that will be used to implement movement of data along the arcs of the graph. This architecture and algorithms define a system that is relatively simple to build and can do graph processing. All arcs can be transversed in parallel in time O(T), where T is empirically proportional to the diameter of the interconnection network times the average degree of the graph. Modifying or adding a new arc takes the same time as parallel traversal.

Tomboulian, Sherryl↗
NASA NTRS1994

Model reduction of nonsquare linear MIMO systems using multipoint matrix continued-fraction expansions

This paper deals with the multipoint Cauer matrix continued-fraction expansion (MCFE) for model reduction of linear multi-input multi-output (MIMO) systems with various numbers of inputs and outputs. A salient feature of the proposed MCFE approach to model reduction of MIMO systems with square transfer matrices is its equivalence to the matrix Pade approximation approach. The Cauer second form of the ordinary MCFE for a square transfer function matrix is generalized in this paper to a multipoint and nonsquare-matrix version. An interesting connection of the multipoint Cauer MCFE method to the multipoint matrix Pade approximation method is established. Also, algorithms for obtaining the reduced-degree matrix-fraction descriptions and reduced-dimensional state-space models from a transfer function matrix via the multipoint Cauer MCFE algorithm are presented. Practical advantages of using the multipoint Cauer MCFE are discussed and a numerical example is provided to illustrate the algorithms.

Guo, Tong-Yi↗
NASA NTRS2009

Multiscale Computer Simulation of Tensile and Compressive Strain in Polymer- Coated Silica Aerogels

While the low thermal conductivities of silica aerogels have made them of interest to the aerospace community as lightweight thermal insulation, the application of conformal polymer coatings to these gels increases their strength significantly, making them potentially useful as structural materials as well. In this work we perform multiscale computer simulations to investigate the tensile and compressive strain behavior of silica and polymer-coated silica aerogels. Aerogels are made up of clusters of interconnected particles of amorphous silica of less than bulk density. We simulate gel nanostructure using a Diffusion Limited Cluster Aggregation (DLCA) procedure, which produces aggregates that exhibit fractal dimensions similar to those observed in real aerogels. We have previously found that model gels obtained via DLCA exhibited stress-strain curves characteristic of the experimentally observed brittle failure. However, the strain energetics near the expected point of failure were not consistent with such failure. This shortcoming may be due to the fact that the DLCA process produces model gels that are lacking in closed-loop substructures, compared with real gels. Our model gels therefore contain an excess of dangling strands, which tend to unravel under tensile strain, producing non-brittle failure. To address this problem, we have incorporated a modification to the DLCA algorithm that specifically produces closed loops in the model gels. We obtain the strain energetics of interparticle connections via atomistic molecular statics, and abstract the collective energy of the atomic bonds into a Morse potential scaled to describe gel particle interactions. Polymer coatings are similarly described. We apply repeated small uniaxial strains to DLCA clusters, and allow relaxation of the center eighty percent of the cluster between strains. The simulations produce energetics and stress-strain curves for looped and nonlooped clusters, for a variety of densities and interaction parameters.

Good, Brian↗
NASA NTRSDate not supplied

Introducing Tropical Geometric Approaches to Delay Tolerant Networking Optimization

Delay Tolerant Networking (DTN) is the standard approach to the networking of space systems with the goal of supporting the Solar System Internet (SSI). Current space networks have a small scale and often depend on rigorously scheduled (pre-determined) contact opportunities; this manual approach inhibits scalability. The goal of this paper is to recast these scheduling problems in order to apply the optimization machinery of tropical geometry. Contact opportunities in space are dependent on such factors as orbital mechanics and asset availability, which induce time-varying connectivity; indeed, end-to-end connectivity might never occur. Routing optimization within this structure is classically difficult and typically utilizes Dijkstra's algorithm as applied to contact graphs. Alternatively, we follow the successes of tropical geometry in train schedule optimization, job assignments, and even traditional networking, by extending this approach to this more general (i.e. disconnected) problem space. These successes imply tropical geometry provides a useful framework in the context of DTNs, starting with applications to queuing theory and long-haul links. Recently, tropical geometry has been applied to parametric path optimization on graphs with variable edge weights. In this work, we extend these advances to account for the problem of routing in a space network, and find that tropical geometry is well-suited to the challenges offered by this new setting, including contact schedules featuring probabilities. Our approach leverages the combinatorial nature of the problem to give feasible shortest path trees in the presence of variable channel conditions and latency, evolving topologies, and uncertainty inherent in space routing. We discuss our tropical approach to DTN for two Python implementations, a Verilog Tropical ALU implementation, tropical frameworks for other parametric graph problems, and solution stability. Lastly, a program for future work is included to illuminate the path ahead.

Delay Tolerant Networking↗
NASA NTRS2023

Control and Scaling Approach for the Emulation of Dynamic Subscale Torque Loads

Research and development of electrified aircraft propulsion powertrains are relying on the use of electromechanical systems to emulate turbomachinery/rotor loads. Replacing a physical turbomachinery/rotor with a model driving a subscale electromechanical system capable of emulating subscale torque loads and responses is a lower risk, lower cost alternative to using the full-scale turbomachinery/rotor for initial control system verification. This paper outlines a novel control and scaling approach for emulating dynamic subscale torque loads using electric machine (EM) hardware for electrified aircraft propulsion research and development purposes. The approach, known as the Sliding Mode Impedance Controller with Scaling (SMICS), drives a mechanically coupled, two-EM system to behave like a subscale hardware representation of a hybrid-electric turbomachinery shaft. One EM reflects the inertial dynamics and torque load of the subscale turbomachinery under steady-state and transient operation while the second EM represents a motor/generator connected to the shaft, which is intended to hybridize the turbomachinery. This closed loop control and scaling algorithm applies impedance and sliding mode control schemes, along with parameter scaling, to match subscale, desired dynamics in real-time and to allow this system to be driven by a full-scale hybrid-electric turbomachinery model and control. The paper elaborates on the concept of the closed loop control and scaling approach and explains the significance of using impedance and sliding mode control. It shows a derivation of the closed loop control and scaling algorithm, its implementation, and presents a comparison of theoretical and actual simulation results acquired during hardware-in-the-loop testing of a partial turboelectric propulsion concept aircraft at the NASA Electric Aircraft Testbed (NEAT).The results show that the intended dynamic responses of the hardware and the aircraft model are achieved in both the time and frequency domain. Full scale propulsion control systems can be tested using this hardware and software approach.

Emulation↗
NASA NTRSDate not supplied

A Proposed Clock Synchronization Method for the Solar System Internet

Networked communications in space are necessary to achieve scalability in terms of the number of communicating nodes but also in terms of the overall system complexity. A key component to such a system is the ability to synchronize clocks, which is the focus of this paper. The so-called Solar System Internet (SSI) will be built upon Delay Tolerant Networking (DTN), which, in analogy to the Internet Protocol (IP), can be considered a suite of protocols necessary for networking in the space domain. Therefore, our goal is to extend this suite to include a DTN clock synchronization capability, analogous to the Network Time Protocol (NTP) used in the Internet. A motivating example of a network in space is NASA’s LunaNet, a vision for a multi-hop multi-path network extending to the moon wherein not all nodes will have direct connections to an authoritative reference clock. In this paper, we propose a general clock synchronization methodology and algorithm that could be used for LunaNet as well as more elaborate time-varying networks. In recent years, DTN has benefited from modeling efforts founded on the mathematical tool of sheaves. Here we continue this work to provide an approach to clock synchronization. Due to the time-varying nature of space networks, absolute consensus is not possible. However, the sheaf Laplacian provides a practical, distributed approach to approximating consensus by allowing data to diffuse through the network. In particular, the sheaf Laplacian is readily computable, lending our approach to implementation. Our approach is well suited to handle the difficulties of space networks. For instance, differences in clock accuracy mean certain nodes are more authoritative than others; we can account for these differences through hierarchies in the network, generalizing the strata in NTP. Furthermore, just as error estimation is an integral part of NTP, we are able to give concrete error bounds for our approach. Indeed, different applications (e.g., communications schedules, pointing, navigation, distributed science) will have different requirements, hence it is necessary to maintain clocks within a given tolerance. We outline some of the necessary steps to turn our approach into a practical network protocol that could be used in DTN, and we conclude the paper with suggestions for future research.

Michael Moy↗
NASA NTRS1984

Adaptive triangular mesh generation

A general adaptive grid algorithm is developed on triangular grids. The adaptivity is provided by a combination of node addition, dynamic node connectivity and a simple node movement strategy. While the local restructuring process and the node addition mechanism take place in the physical plane, the nodes are displaced on a monitor surface, constructed from the salient features of the physical problem. An approximation to mean curvature detects changes in the direction of the monitor surface, and provides the pulling force on the nodes. Solutions to the axisymmetric Grad-Shafranov equation demonstrate the capturing, by triangles, of the plasma-vacuum interface in a free-boundary equilibrium configuration.

Erlebacher, G.↗
NASA NTRS1984

Application of differential GPS to civil helicopter terminal guidance

NASA is conducting a research program to evaluate differential Global Positioning System (GPS) concepts for civil helicopter navigation. It is pointed out that the civil helicopter community will probably be an early user of GPS because of the unique mission operations in areas where precise navigation aids are not available. Applications with very demanding accuracy requirements are related to remote area search and rescue, offshore oil platform approach, remote area precision landing, and other precise navigation operations. Differential GPS appears to provide a solution for meeting the accuracy requirements involved in the considered operations. The present investigation is concerned with results obtained in three areas studied in connection with the conducted research program. Attention is given to mission-tailored satellite selection, a satellite selection algorithm concept, satellite selection algorithm simulation results, and differential GPS ground station design.

Denaro, R. P.↗
NASA NTRS1989

Systolic array processing of the Viterbi algorithm

Results on efficient forms of decoding convolutional codes based on the Viterbi algorithm by using systolic arrays are presented. Various properties of convolutional codes are discussed. A technique called strongly connected trellis decoding is introduced to increase the efficient utilization of all the systolic array processors. Issues dealing with the composite branch metric generation, survivor updating, overall system architecture, throughput rate, and computational overhead ratio also investigated. The scheme is applicable to both hard and soft decoding of any rate b/n convolutional code. It is shown that as the length of the code becomes large, the systolic Viterbi decoder maintains a regular and general interconnection structure as well as moderate throughput rate gain over the sequential Viterbi decoder.

Chang, Chi-Yung↗