Search NASA⌕ Search

SEARCH · Search NASA

Results for “consensus 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 19 records

Distributed Consensus to Enable Merging and Spacing of UAS in an Urban Environment

This paper presents a novel approach to enable multiple Unmanned Aerial Systems approaching a common intersection to independently schedule their arrival time while maintaining a safe separation. Aircraft merging at a common intersection are grouped into a network and each aircraft broadcasts its arrival time interval to the network. A distributed consensus algorithm elects a leader among the aircraft approaching the intersection and helps synchronize the information received by each aircraft. The consensus algorithm ensures that each aircraft computes a schedule with the same input information. The elected leader also dictates when a schedule must be computed, which may be triggered when a new aircraft joins the network. Preliminary results illustrating the collaborative behavior of the vehicles are presented.

Balachandran, Swee↗

NASA Ocean Altimeter Pathfinder Project: Data Processing Handbook - Report 1

The NOAA/NASA Pathfinder program was created by the Earth Observing System (EOS) Program Office to determine how satellite-based data sets can be processed and used to study global change. The data sets are designed to be long time-sedes data processed with stable calibration and community consensus algorithms to better assist the research community. The Ocean Altimeter Pathfinder Project involves the reprocessing of all altimeter observations with a consistent set of improved algorithms, based on the results from TOPEX/POSEIDON (T/P), into easy-to-use data sets for the oceanographic community for climate research. This report describes the processing schemes used to produce a consistent data set and two of the products derived f rom these data. Other reports have been produced that: a) describe the validation of these data sets against tide gauge measurements and b) evaluate the statistical properties of the data that are relevant to climate change. The use of satellite altimetry for earth observations was proposed in the early 1960s. The first successful space based radar altimeter experiment was flown on SkyLab in 1974. The first successful satellite radar altimeter was flown aboard the Geos-3 spacecraft between 1975 and 1978. While a useful data set was collected from this mission for geophysical studies, the noise in the radar measured and incomplete global coverage precluded ft from inclusion in the Ocean Altimeter Pathfinder program. This program initiated its analysis with the Seasat mission, which was the first satellite radar altimeter flown for oceanography.

Koblinsky, C. J.↗

NASA Ocean Altimeter Pathfinder Project: Data Set Validation - Report 2

The NOAA/NASA Pathfinder program was created by the Earth Observing System (EOS) Program Office to determine how existing satellite-based data sets can be processed and used to study global change. The data sets are designed to be long time-series data processed with stable calibration and community consensus algorithms to better assist the research community. The Ocean Altimeter Pathfinder Project involves the reprocessing of all altimeter observations with a consistent set of improved algorithms, based on the results from TOPEX/POSEIDON (T/P), into easy-to-use data sets for the oceanographic community for climate research. Details are currently presented in two technical reports: Report# 1: Data Processing Handbook Report #2: Data Set Validation This report describes the validation of the data sets against a global network of high quality tide gauge measurements and provides an estimate of the error budget. The first report describes the processing schemes used to produce the geodetic consistent data set comprised of SEASAT, GEOSAT, ERS-1, TOPEX/ POSEIDON, and ERS-2 satellite observations.

Koblinsky, C. J.↗

Time-Critical Coordination of UAS with Non-Ideal Autopilots under Lossy Communication Networks

In this presentation we will explore several distributed consensus algorithms developed to maintain coordination among a fleet of heterogeneous UAS subject to external disturbances. An overview of the network assumptions and autopilot performance bounds required to meet the coordination objective will be provided. In particular, we will leverage passivity-based stability conditions for bidirectional networks that require the communication graph to be connected in an integral sense, but may fail to connect pointwise in time during the entire mission. Non-ideal autopilots that can only track a desired speed profile with a prescribed precision induce an error in vehicle coordination. The autopilot performance bounds will be propagated through the coordination dynamics to understand the limits introduced by autopilots.

conensus↗

Software reliability through fault-avoidance and fault-tolerance

Twenty independently developed but functionally equivalent software versions were used to investigate and compare empirically some properties of N-version programming, Recovery Block, and Consensus Recovery Block, using the majority and consensus voting algorithms. This was also compared with another hybrid fault-tolerant scheme called Acceptance Voting, using dynamic versions of consensus and majority voting. Consensus voting provides adaptation of the voting strategy to varying component reliability, failure correlation, and output space characteristics. Since failure correlation among versions effectively reduces the cardinality of the space in which the voter make decisions, consensus voting is usually preferable to simple majority voting in any fault-tolerant system. When versions have considerably different reliabilities, the version with the best reliability will perform better than any of the fault-tolerant techniques.

Vouk, Mladen A.↗

GPM Plans for Radiometer Intercalibration

The international Global Precipitation Measurement (GPM) mission led by NASA and JAXA is planned as a multi-radiometer constellation mission. A key mission component is the ability to intercalibrate the Tb from the partner constellation radiometers and create inter-calibrated, mission consistent Tc. One of the enabling strategies for this approach is the launching of a joint NASA/JAXA core satellite which contains a JAXA/NICT provided dual precipitation radar and a NASA provided Microwave Imaging passive radiometer. The observations from these instruments on the core satellite provide the opportunity to develop a transfer reference standard that can then be applied across the partner provided constellation radiometers that enables the creation of mission consistent brightness temperatures. The other aspect of the strategy is the development of a community consensus intercalibration algorithm that will be applied to the Tb observations from partner radiometers and create the best calibrated Tc. Also described is the development of the framework in which the inter-calibration is included in the final algorithm. A part of the latter effort has been the development of a generic, logical structure which can be applied across radiometer types and which guarantees the user community that key information for using Tc properly is recorded. Key

Stocker, Erich Franz↗

SeaWiFS Technical Report Series: Satellite Primary Productivity Data and Algorithm Development: A Science Plan for Mission to Planet Earth - Volume 42

Two issues regarding primary productivity, as it pertains to the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) Program and the National Aeronautics and Space Administration (NASA) Mission to Planet Earth (MTPE) are presented in this volume. Chapter 1 describes the development of a science plan for deriving primary production for the world ocean using satellite measurements, by the Ocean Primary Productivity Working Group (OPPWG). Chapter 2 presents discussions by the same group, of algorithm classification, algorithm parameterization and data availability, algorithm testing and validation, and the benefits of a consensus primary productivity algorithm.

Falkowski, Paul G.↗

Survivable algorithms and redundancy management in NASA's distributed computing systems

The design of survivable algorithms requires a solid foundation for executing them. While hardware techniques for fault-tolerant computing are relatively well understood, fault-tolerant operating systems, as well as fault-tolerant applications (survivable algorithms), are, by contrast, little understood, and much more work in this field is required. We outline some of our work that contributes to the foundation of ultrareliable operating systems and fault-tolerant algorithm design. We introduce our consensus-based framework for fault-tolerant system design. This is followed by a description of a hierarchical partitioning method for efficient consensus. A scheduler for redundancy management is introduced, and application-specific fault tolerance is described. We give an overview of our hybrid algorithm technique, which is an alternative to the formal approach given.

Malek, Miroslaw↗

An Updated TRMM Composite Climatology of Tropical Rainfall and Its Validation

An updated 15-yr Tropical Rainfall Measuring Mission (TRMM) composite climatology (TCC) is presented and evaluated. This climatology is based on a combination of individual rainfall estimates made with data from the primaryTRMMinstruments: theTRMM Microwave Imager (TMI) and the precipitation radar (PR). This combination climatology of passive microwave retrievals, radar-based retrievals, and an algorithm using both instruments simultaneously provides a consensus TRMM-based estimate of mean precipitation. The dispersion of the three estimates, as indicated by the standard deviation sigma among the estimates, is presented as a measure of confidence in the final estimate and as an estimate of the uncertainty thereof. The procedures utilized by the compositing technique, including adjustments and quality-control measures, are described. The results give a mean value of the TCC of 4.3mm day(exp -1) for the deep tropical ocean beltbetween 10 deg N and 10 deg S, with lower values outside that band. In general, the TCC values confirm ocean estimates from the Global Precipitation Climatology Project (GPCP) analysis, which is based on passive microwave results adjusted for sampling by infrared-based estimates. The pattern of uncertainty estimates shown by sigma is seen to be useful to indicate variations in confidence. Examples include differences between the eastern and western portions of the Pacific Ocean and high values in coastal and mountainous areas. Comparison of the TCC values (and the input products) to gauge analyses over land indicates the value of the radar-based estimates (small biases) and the limitations of the passive microwave algorithm (relatively large biases). Comparison with surface gauge information from western Pacific Ocean atolls shows a negative bias (~16%) for all the TRMM products, although the representativeness of the atoll gauges of open-ocean rainfall is still in question.

(GPCP) Global Precipitation Project analysis↗

Network Analysis of Rodent Transcriptomes in Spaceflight

Network analysis methods leverage prior knowledge of cellular systems and the statistical and conceptual relationships between analyte measurements to determine gene connectivity. Correlation and conditional metrics are used to infer a network topology and provide a systems-level context for cellular responses. Integration across multiple experimental conditions and omics domains can reveal the regulatory mechanisms that underlie gene expression. GeneLab has assembled rich multi-omic (transcriptomics, proteomics, epigenomics, and epitranscriptomics) datasets for multiple murine tissues from the Rodent Research 1 (RR-1) experiment. RR-1 assesses the impact of 37 days of spaceflight on gene expression across a variety of tissue types, such as adrenal glands, quadriceps, gastrocnemius, tibalius anterior, extensor digitorum longus, soleus, eye, and kidney. Network analysis is particularly useful for RR-1 -omics datasets because it reinforces subtle relationships that may be overlooked in isolated analyses and subdues confounding factors. Our objective is to use network analysis to determine potential target nodes for therapeutic intervention and identify similarities with existing disease models. Multiple network algorithms are used for a higher confidence consensus.

genomics↗

cWINNOWER algorithm for finding fuzzy dna motifs

The cWINNOWER algorithm detects fuzzy motifs in DNA sequences rich in protein-binding signals. A signal is defined as any short nucleotide pattern having up to d mutations differing from a motif of length l. The algorithm finds such motifs if a clique consisting of a sufficiently large number of mutated copies of the motif (i.e., the signals) is present in the DNA sequence. The cWINNOWER algorithm substantially improves the sensitivity of the winnower method of Pevzner and Sze by imposing a consensus constraint, enabling it to detect much weaker signals. We studied the minimum detectable clique size qc as a function of sequence length N for random sequences. We found that qc increases linearly with N for a fast version of the algorithm based on counting three-member sub-cliques. Imposing consensus constraints reduces qc by a factor of three in this case, which makes the algorithm dramatically more sensitive. Our most sensitive algorithm, which counts four-member sub-cliques, needs a minimum of only 13 signals to detect motifs in a sequence of length N = 12,000 for (l, d) = (15, 4). Copyright Imperial College Press.

Evaluation Studies↗

cWINNOWER Algorithm for Finding Fuzzy DNA Motifs

The cWINNOWER algorithm detects fuzzy motifs in DNA sequences rich in protein-binding signals. A signal is defined as any short nucleotide pattern having up to d mutations differing from a motif of length l. The algorithm finds such motifs if multiple mutated copies of the motif (i.e., the signals) are present in the DNA sequence in sufficient abundance. The cWINNOWER algorithm substantially improves the sensitivity of the winnower method of Pevzner and Sze by imposing a consensus constraint, enabling it to detect much weaker signals. We studied the minimum number of detectable motifs qc as a function of sequence length N for random sequences. We found that qc increases linearly with N for a fast version of the algorithm based on counting three-member sub-cliques. Imposing consensus constraints reduces qc, by a factor of three in this case, which makes the algorithm dramatically more sensitive. Our most sensitive algorithm, which counts four-member sub-cliques, needs a minimum of only 13 signals to detect motifs in a sequence of length N = 12000 for (l,d) = (15,4).

Liang, Shoudan↗

Autonomous Formations of Multi-Agent Systems

Autonomous formation control of multi-agent dynamic systems has a number of applications that include ground-based and aerial robots and satellite formations. For air vehicles, formation flight ("flocking") has the potential to significantly increase airspace utilization as well as fuel efficiency. This presentation addresses two main problems in multi-agent formations: optimal role assignment to minimize the total cost (e.g., combined distance traveled by all agents); and maintaining formation geometry during flock motion. The Kuhn-Munkres ("Hungarian") algorithm is used for optimal assignment, and consensus-based leader-follower type control architecture is used to maintain formation shape despite the leader s independent movements. The methods are demonstrated by animated simulations.

Dhali, Sanjana↗

Biases in the In Situ Measurement of Particulate Organic Carbon and Its Effect on the Calibration and Validation of Ocean Color Sensors

Particulate organic carbon (POC) plays an oversize role, relative to its standing stock in the global carbon (C) cycle. Accurate measurement of POC is central to understanding the ocean C flux and its sensitivity to climate forcing. POC is a standard NASA ocean color data product, which lacks a consensus, quality-assured measurement protocol for satellite validation. Thus, algorithms based on field measurements lacking verified uncertainties have limited applicability towards climate data records. Different sampling and filtration protocols, and blank corrections, introduce biases in the magnitude of POC measured from the field. A significant filter blank attributable to dissolved organic C (DOC) adsorption that, until recently has been seldom corrected for, likely has introduced biases in POC global datasets.

Chaves, Joaquín E.↗

Collaborative Pose Estimation of An Unknown Target Using Multiple Spacecraft

A reliable method for pose estimation of an unknown and uncooperative space target using monocular vision remains an open problem. Vision-based pose determination can be challenging in case of unfavorable illumination, time-varying conditions due to rotational motion and relative orbit, and scale ambiguity resolution. To address these challenges, we propose a novel collaborative pose determination algorithm called Multi- Spacecraft Simultaneous Estimation of Pose and Shape algorithm or M-SEPS.Within M-SEPS, a team of chaser spacecraft, each equipped with a monocular camera, exchange information over a local network to jointly estimate the relative kinematic state of the target and its sparse shape landmarks. In this approach, each spacecraft processes its own images and observes particular target landmarks in parallel and in a distributed fashion. Then, the local network is exploited by the spacecraft to share their consensus proposals and aggregate them to achieve the joint estimate. We validate our algorithm using simulations of relative orbits and observations, captured by each chaser spacecraft. To the best of the authors’ knowledge, this is the first cooperative, vision-based algorithm for estimating the pose and shape of a space object for an arbitrary number of spacecraft.

Chung, Soon-Jo↗

Hybrid Collaborative Learning for Classification and Clustering in Sensor Networks

Traditionally, nodes in a sensor network simply collect data and then pass it on to a centralized node that archives, distributes, and possibly analyzes the data. However, analysis at the individual nodes could enable faster detection of anomalies or other interesting events as well as faster responses, such as sending out alerts or increasing the data collection rate. There is an additional opportunity for increased performance if learners at individual nodes can communicate with their neighbors. In previous work, methods were developed by which classification algorithms deployed at sensor nodes can communicate information about event labels to each other, building on prior work with co-training, self-training, and active learning. The idea of collaborative learning was extended to function for clustering algorithms as well, similar to ideas from penta-training and consensus clustering. However, collaboration between these learner types had not been explored. A new protocol was developed by which classifiers and clusterers can share key information about their observations and conclusions as they learn. This is an active collaboration in which learners of either type can query their neighbors for information that they then use to re-train or re-learn the concept they are studying. The protocol also supports broadcasts from the classifiers and clusterers to the rest of the network to announce new discoveries. Classifiers observe an event and assign it a label (type). Clusterers instead group observations into clusters without assigning them a label, and they collaborate in terms of pairwise constraints between two events [same-cluster (mustlink) or different-cluster (cannot-link)]. Fundamentally, these two learner types speak different languages. To bridge this gap, the new communication protocol provides four types of exchanges: hybrid queries for information, hybrid "broadcasts" of learned information, each specified for classifiers-to-clusterers, and clusterers-to-classifiers. The new capability has the potential to greatly expand the in situ analysis abilities of sensor networks. Classifiers seeking to categorize incoming data into different types of events can operate in tandem with clusterers that are sensitive to the occurrence of new kinds of events not known to the classifiers. In contrast to current approaches that treat these operations as independent components, a hybrid collaborative learning system can enable them to learn from each other.

Wagstaff, Kiri L.↗

Data Quality Assessment Methods for the Eastern Range 915 MHz Wind Profiler Network

The Eastern Range installed a network of five 915 MHz Doppler Radar Wind Profilers with Radio Acoustic Sounding Systems in the Cape Canaveral Air Station/Kennedy Space Center area to provide three-dimensional wind speed and direction and virtual temperature estimates in the boundary layer. The Applied Meteorology Unit, staffed by ENSCO, Inc., was tasked by the 45th Weather Squadron, the Spaceflight Meteorology Group, and the National Weather Service in Melbourne, Florida to investigate methods which will help forecasters assess profiler network data quality when developing forecasts and warnings for critical ground, launch and landing operations. Four routines were evaluated in this study: a consensus time period check a precipitation contamination check, a median filter, and the Weber-Wuertz (WW) algorithm. No routine was able to effectively flag suspect data when used by itself. Therefore, the routines were used in different combinations. An evaluation of all possible combinations revealed two that provided the best results. The precipitation contamination and consensus time routines were used in both combinations. The median filter or WW was used as the final routine in the combinations to flag all other suspect data points.

Lambert, Winifred C.↗

Continual coordination of spacecraft through shared activities

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently reach consensus. ShAC (Shared Activity Coordination) is a framework for designing coordination protocols with an algorithm for continually coordinating agents using these protocols during execution. We show how to construct a wide range of protocols using this framework and describe how ShAC coordinates two rovers and an orbiter in a simulated Mars scenario.

Multiple agents coordination planning scheduling M↗