Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed construction”

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 19 records

A novel resource sharing algorithm based on distributed construction for radiant enclosure problems

This study demonstrates a novel approach to solving inverse radiant enclosure problems based on distributed construction. Specifically, the problem of determining the temperature distribution needed on the heater surfaces to achieve a desired design surface temperature profile is recast as a distributed construction problem in which a shared resource, temperature, is distributed by computational agents moving blocks. The sharing of blocks between agents enables them to achieve their desired local state, which in turn achieves the desired global state. Each agent uses the current state of their local environment and a simple set of rules to determine when to exchange blocks, each block representing a discrete unit of temperature change. This algorithm is demonstrated using the established two-dimensional inverse radiation enclosure problem. The temperature profile on the heater surfaces is adjusted to achieve a desired temperature profile on the design surfaces. The resource sharing algorithm was able to determine the needed temperatures on the heater surfaces to obtain the desired temperature distribution on the design surfaces in the nine cases examined.

97 MATHEMATICS AND COMPUTING↗

Live Virtual Constructive Distributed Test Environment Characterization Report

This report documents message latencies observed over various Live, Virtual, Constructive, (LVC) simulation environment configurations designed to emulate possible system architectures for the Unmanned Aircraft Systems (UAS) Integration in the National Airspace System (NAS) Project integrated tests. For each configuration, four scenarios with progressively increasing air traffic loads were used to determine system throughput and bandwidth impacts on message latency.

UAS↗

Integration Test and Evaluation (IT&E) Flight Test Series 6 Live Virtual Constructive - Distributed Environment (LVC-DE) Test Report

The goals of the Unmanned Aircraft Systems (UAS) Integration in the National Airspace System (NAS) (also UAS-NAS) Project are to reduce the barriers for UAS access and its integration into the NAS. The UAS-NAS project and industry stakeholders conducted a series of flight tests integrating technologies from the Modeling & Simulation (M&S), Human Systems Integration (HSI), and Communication and Control (C2), and Integration, Test & Evaluation (IT&E) research areas. The last of the flight test series, Flight Test Series 6 (FT6) was conducted in late 2019 and focused on evaluating the interaction of the airborne non-cooperative surveillance system and the Detect and Avoid (DAA) technology. The DAA system generated conflict alert and guidance for pilots using a Research Ground Control System (RGCS) to avoid intruder aircraft. The conflict alerting and guidance information was presented on the RGCS’s display using symbology developed by the human factors team. The objective of FT6 was to investigate the interoperability of Low Size, Weight, and Power (Low SWaP) sensors with the DAA alerting, guidance, and display requirements. To support this goal, the distributed test environments (DTE) were developed at Ames Research Center (ARC) and Armstrong Flight Research Center (AFRC) and securely linked over a Virtual Private Network (VPN). These environments took advantage of existing Live Virtual Constructive (LVC) technologies to support research observation at both Centers with the insertion of live UAS and manned intruder aircraft into a simulated NAS environment with Air Traffic Control (ATC) and constructive manned aircraft. The experiment was distributed between AFRC flight operations and research facilities and the Distributed Simulation Research Laboratory (DSRL) and Software Development Laboratory (SDL) in building N243 at ARC. The Air Traffic Controller and pseudo pilots operated from the DSRL and SDL, respectively, using the Multi-Aircraft Control System (MACS). The test subject and researchers operated from the Research Ground Control Station (RGCS) at AFRC using the Vigilant Spirit Control Station (VSCS) and associated DAA software and displays. Flight Operation for the unmanned aircraft (UA) and manned intruder traffic was conducted at AFRC. Virtual traffic was managed by ARC. Voice distribution was accomplished using a combination of disparate communication systems at ARC and AFRC. The purpose of this document is to record the development, design, and execution of activities in support of the FT6 efforts from the perspective of the ARC IT&E team. Furthermore, the Armstrong IT&E team has published a thorough FT6 Test Report, with emphasis on flight test support, facilities and vehicle development; this report complements the Armstrong report. Analysis of collected FT6 data will be conducted and reported by the M&S and HSI teams and will be published in separate reports.

UAS-NAS↗

Investigating the ecological fallacy through sampling distributions constructed from finite populations

Correlation coefficients and linear regression values computed from group averages can differ from correlation coefficients and linear regression values computed using individual scores. This observation known as the ecological fallacy often assumes that all the individual scores are available from a population. In many situations, one must use a sample from the larger population. In such cases, the computed correlation coefficient and linear regression values will depend on the sample that is chosen and the underlying sampling distribution. The sampling distribution of correlation coefficients and linear regression values for group averages will be identical to the sampling distribution for individuals for normally distributed variables for random samples drawn from infinitely large continuous distributions. However, data that is acquired in practice is often acquired when sampling without replacement from a finite population. Our objective is to demonstrate through Monte Carlo simulations that the sampling distributions for correlation and linear regression will also be similar for individuals and group averages when sampling without replacement from normally distributed variables. These simulations suggest that when a random sample from a population is selected, the correlation coefficients and linear regression values computed from individual scores will not be more accurate in estimating the entire population values compared to samples when group averages are used as long as the sample size is the same.

97 MATHEMATICS AND COMPUTING↗

An Intelligent Distributed Ledger Construction Algorithm for IoT

Blockchain is the next generation of secure data management that creates near-immutable decentralized storage. Secure cryptography created a niche for blockchain to provide alternatives to well-known security compromises. However, design bottlenecks with traditional blockchain data structures scale poorly with increased network usage and are extremely computation-intensive. This made the technology difficult to combine with limited devices, like those in Internet of Things networks. In protocols like IOTA, replacement of blockchain's linked-list queue processing with a lightweight dynamic ledger showed remarkable throughput performance increase. However, current stochastic algorithms for ledger construction suffer distinct trade-offs between efficiency and security. This work proposed a machine-learning approach with a multi-arm bandit that resolved these issues and was designed for auditing on limited devices. This algorithm was tested in a reinforcement-learning environment simulating the IOTA ledger's construction with a decision tree. This study showed through regret analysis and experimentation that this approach was secure against impulse manipulation attacks while remaining energy-efficient. Although the IOTA protocol was a pioneer for lightweight distributed ledgers, it is expected that future blockchain protocols will adopt techniques similar to those presented in this work.

multi-arm bandit↗

Constructing angular distributions of neutrinos in core-collapse supernovae from zeroth and first moments calibrated by full Boltzmann neutrino transport

Two-moment neutrino transport methods have been widely used for developing theoretical models of core-collapse supernovae (CCSN), since they substantially reduce the computational burden inherent in the multidimensional neutrino-radiation hydrodynamical simulations. The approximation, however, comes at a price; the detailed structure of angular distribution of neutrinos is sacrificed, that is the main drawback of this approach. In this paper, we develop a novel method by which to construct angular distributions of neutrinos from the zeroth and first angular moments. In our method, the angular distribution is expressed with two quadratic functions of the neutrino angle in a piecewise fashion. We determine the best parameters in the fitting function by comparing to the neutrino data in a spherically symmetric CCSN model with full Boltzmann neutrino transport. We demonstrate the capability of our method by using our recent 2D CCSN model. In this work, we find that the essential features of the angular distributions can be well reconstructed, whereas the angular distributions of incoming neutrinos tend to have large errors that increase with flux factor ($\textit{κ}$). This issue originates from the insensitiveness of incoming neutrinos to $\textit{κ}$, that is an intrinsic limitation in moment methods. Based on the results of the demonstration, we assess the reliability of electron- neutrinos lepton number (ELN)-crossing searches with the two-moment neutrino transport. This analysis is complementary to our [L. Johns and H. Nagakura arXiv:2104.04106] that scrutinizes the limitation of crossing searches with a few moments. We find that the systematic errors of angular distributions for incoming neutrinos lead to misjudgements of the crossing at $\textit{κ}$ ≳ 0.5. This casts doubt on the results of ELN-crossing searches based on two-moment methods in some previous studies.

79 ASTRONOMY AND ASTROPHYSICS↗

A distributed telerobotics construction set

During the course of our research on distributed telerobotic systems, we have assembled a collection of generic, reusable software modules and an infrastructure for connecting them to form a variety of telerobotic configurations. This paper describes the structure of this 'Telerobotics Construction Set' and lists some of the components which comprise it.

Wise, James D.↗

Virtual Solar Observatory Distributed Query Construction

Through a prototype implementation (Tian et al., this meeting) the VSO has already demonstrated the capability of unifying geographically distributed data sources following the Web Services paradigm and utilizing mechanisms such as the Simple Object Access Protocol (SOAP). So far, four participating sites (Stanford, Montana State University, National Solar Observatory and the Solar Data Analysis Center) permit Web-accessible, time-based searches that allow browse access to a number of diverse data sets. Our latest work includes the extension of the simple, time-based queries to include numerous other searchable observation parameters. For VSO users, this extended functionality enables more refined searches. For the VSO, it is a proof of concept that more complex, distributed queries can be effectively constructed and that results from heterogeneous, remote sources can be synthesized and presented to users as a single, virtual data product.

Gurman, J. B.↗

Truncated ARQ Statistical Link Analysis for Dynamic Links

The future deep space links are migrating towards higher frequency bands such as Ka band and optical. These links are susceptible to non Gaussian and non linear effects such as atmospheric turbulence, scintillation, antenna mis-pointing, jitter, etc. These dynamic links thus will experience various degrees of fading loss, and some of these link disruptions cannot be effectively mitigated by forward error correction coding and/or interleaving. One effective way to ensure reliable communication is by using Automatic Repeat Request (ARQ) protocol, where the receiver acknowledges to the transmitter whether or not a data unit is successfully received. If a data unit is not successfully received (such as after a pre-set time-out), the transmitter would then re-transmit the lost data unit to the receiver. In a previous paper, we derived a statistical link analysis method of finding the optimal operating Signal-to-Noise Ratio (SNR) and estimating the latency of an ARQ scheme. In a more recent paper, we demonstrated the above method using the SNR distribution constructed from the Ka-band (32 GHz) flight data. To simplify the discussion, we considered the academic approach that the ARQ scheme allows for an infinite number of retransmissions. In this paper, we consider the more practical case of a truncated ARQ scheme, where there is a limit on the number of retransmissions. We derive the error probability, the optimal SNR setting, and the latency statistics of the correctly received frames of the truncated ARQ schemes. We first discuss the truncated ARQ link analysis principles using the Gaussian assumption for SNR distribution with a large variance. Next, we demonstrate the statistical truncated ARQ link analysis using the SNR distribution constructed from the Ka-band flight data. The results in this paper can be applied in the design of reliable communication systems such as the Consultative Committee for Space Data System (CCSDS) File Transfer Protocol (CFTP) and the Delay Tolerant Network (DTN).

Morabito, David↗

Message Latency Characterization of a Distributed Live, Virtual, Constructive Simulation Environment

A distributed test environment incorporating Live, Virtual, Constructive, (LVC) concepts was developed to execute standalone and integrated simulations and flight-tests that support unmanned aircraft research for NASA’s Unmanned Aircraft Systems (UAS) in the National Airspace System (NAS) Project. The LVC components form the core infrastructure that supports simulation of UAS operations by integrating live and virtual aircraft in a realistic air traffic environment. This LVC infrastructure enables efficient testing by leveraging the use of existing distributed assets. The LVC concepts used for the UAS in the NAS project include live aircraft, flight simulators, and virtual air traffic control assets operating at facilities distributed across multiple NASA Centers. With a distributed network, however, there is a concern that message latency could impact the realism of a simulation and its data. The latencies associated with sending data among these distributed facilities were, therefore, measured to ensure that they fall within acceptable parameters. Several live and virtual test assets were integrated into the LVC infrastructure including NASA Armstrong’s Ikhana MQ-9 unmanned aircraft, NASA Glenn’s S3-B manned aircraft, and the B747 flight simulator at NASA Ames. Average latencies from 100 to 150 milliseconds were observed between the LVC System running at NASA Ames and each of the participating NASA Centers under a light-to-moderate (fifty aircraft) traffic sample.

Murphy, James R.↗

A Biologically Inspired Cooperative Multi-Robot Control Architecture

A prototype cooperative multi-robot control architecture suitable for the eventual construction of large space structures has been developed. In nature, there are numerous examples of complex architectures constructed by relatively simple insects, such as termites and wasps, which cooperatively assemble their nests. The prototype control architecture emulates this biological model. Actions of each of the autonomous robotic construction agents are only indirectly coordinated, thus mimicking the distributed construction processes of various social insects. The robotic construction agents perform their primary duties stigmergically i.e., without direct inter-agent communication and without a preprogrammed global blueprint of the final design. Communication and coordination between individual agents occurs indirectly through the sensed modifications that each agent makes to the structure. The global stigmergic building algorithm prototyped during the initial research assumes that the robotic builders only perceive the current state of the structure under construction. Simulation studies have established that an idealized form of the proposed architecture was indeed capable of producing representative large space structures with autonomous robots. This paper will explore the construction simulations in order to illustrate the multi-robot control architecture.

Howsman, Tom↗

A Stigmergic Cooperative Multi-Robot Control Architecture

In nature, there are numerous examples of complex architectures constructed by relatively simple insects, such as termites and wasps, which cooperatively assemble their nests. A prototype cooperative multi-robot control architecture which may be suitable for the eventual construction of large space structures has been developed which emulates this biological model. Actions of each of the autonomous robotic construction agents are only indirectly coordinated, thus mimicking the distributed construction processes of various social insects. The robotic construction agents perform their primary duties stigmergically, i.e., without direct inter-agent communication and without a preprogrammed global blueprint of the final design. Communication and coordination between individual agents occurs indirectly through the sensed modifications that each agent makes to the structure. The global stigmergic building algorithm prototyped during the initial research assumes that the robotic builders only perceive the current state of the structure under construction. Simulation studies have established that an idealized form of the proposed architecture was indeed capable of producing representative large space structures with autonomous robots. This paper will explore the construction simulations in order to illustrate the multi-robot control architecture.

Howsman, Thomas G.↗

Charon Message-Passing Toolkit for Scientific Computations

The Charon toolkit for piecemeal development of high-efficiency parallel programs for scientific computing is described. The portable toolkit, callable from C and Fortran, provides flexible domain decompositions and high-level distributed constructs for easy translation of serial legacy code or design to distributed environments. Gradual tuning can subsequently be applied to obtain high performance, possibly by using explicit message passing. Charon also features general structured communications that support stencil-based computations with complex recurrences. Through the separation of partitioning and distribution, the toolkit can also be used for blocking of uni-processor code, and for debugging of parallel algorithms on serial machines. An elaborate review of recent parallelization aids is presented to highlight the need for a toolkit like Charon. Some performance results of parallelizing the NAS Parallel Benchmark SP program using Charon are given, showing good scalability.

VanderWijngaart, Rob F.↗

Charon Message-Passing Toolkit for Scientific Computations

The Charon toolkit for piecemeal development of high-efficiency parallel programs for scientific computing is described. The portable toolkit, callable from C and Fortran, provides flexible domain decompositions and high-level distributed constructs for easy translation of serial legacy code or design to distributed environments. Gradual tuning can subsequently be applied to obtain high performance, possibly by using explicit message passing. Charon also features general structured communications that support stencil-based computations with complex recurrences. Through the separation of partitioning and distribution, the toolkit can also be used for blocking of uni-processor code, and for debugging of parallel algorithms on serial machines. An elaborate review of recent parallelization aids is presented to highlight the need for a toolkit like Charon. Some performance results of parallelizing the NAS Parallel Benchmark SP program using Charon are given, showing good scalability. Some performance results of parallelizing the NAS Parallel Benchmark SP program using Charon are given, showing good scalability.

VanderWijngarrt, Rob F.↗

A Novel Multiagent Resource Sharing Algorithm for Control of Advanced Energy Systems

This paper implements a novel resource sharing control strategy on a fuel cell–gas turbine hybrid power system at the National Energy Technology Laboratory’s Hybrid Performance Facility (Hyper). In a fuel cell–gas turbine hybrid power system, the simultaneous interaction of the gas turbine and the fuel cell creates a tightly coupled environment characterized by conflicting dynamics. In this paper, a model-free control approach is applied to solve the tightly coupled control problem posed by this challenging environment. Specifically, this control problem is presented as a resource sharing problem that can be solved using a resource sharing algorithm that is defined based on the distribution construction concept. This algorithm creates computational agents and solves the problem through the distribution and redistribution of shared resources defined as blocks. Furthermore, two agents were created; the first agent (agent 1) controls the gas turbine speed by adjusting the electric load, and the second agent (agent 2) controls the cathode mass flow through the fuel cell using the cold-air bypass valve. A parametric study was performed over the course of 15 experimental tests for both agents 1 and 2 through an evaluation of the responses based on setpoint changes. The algorithm was shown to have behavior comparable to a previously implemented multi-input multioutput state-space controller, which was designed through a model-based control approach. The resource sharing algorithm was able to find stable performance during run-time operations without any prior system knowledge identification on the power plant and without creating models used in traditional control strategies.

25 ENERGY STORAGE↗