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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Develop Wake Mitigation Strategy (CRADA CRD-17-00693 Final Report)

17 WIND ENERGY↗

DOE OSTI2019

Data-driven cyber attack detection and mitigation for decentralized wide-area protection and control in smart grids

Modern power systems have already evolved into complicated cyber physical systems (CPS), often referred to as smart grids, due to the continuous expansion of the electrical infrastructure, the augmentation of the number of heterogeneous system components and players, and the consequential application of a diversity of information and telecommunication technologies to facilitate the Wide Area Monitoring, Protection and Control (WAMPAC) of the day-to-day power system operation. Because of the reliance on cyber technologies, WAMPAC, among other critical functions, is prone to various malicious cyber attacks. Successful cyber attacks, especially those sabotage the operation of Bulk Electric System (BES), can cause great financial losses and social panics. Application of conventional IT security solutions is indispensable, but it often turns out to be insufficient to mitigate sophisticated attacks that deploy zero-day vulnerabilities or social engineering tactics. To further improve the resilience of the operation of smart grids when facing cyber attacks, it is desirable to make the WAMPAC functions per se capable of detecting various anomalies automatically, carrying out adaptive activity adjustments in time and thus staying unimpaired even under attack. Most of the existing research efforts attempt to achieve this by adding novel functional modules, such as model-based anomaly detectors, to the legacy centralized WAMPAC functions. In contrast, this dissertation investigates the application of data-driven algorithms in cyber attack detection and mitigation within a decentralized architecture aiming at improving the situational awareness and self-adaptiveness of WAMPAC. First part of the research focuses on the decentralization of System Integrity Protection Scheme (SIPS) with Multi-Agent System (MAS), within which the data-driven anomaly detection and optimal adaptive load shedding are further explored. An algorithm named as Support Vector Machine embedded Layered Decision Tree (SVMLDT) is proposed for the anomaly detection, which provides satisfactory detection accuracy as well as decision-making interpretability. The adaptive load shedding is carried out by every agent individually with dynamic programming. The load shedding relies on the load profile propagation among peer agents and the attack adaptiveness is accomplished by maintaining the historical mean of load shedding proportion. Load shedding only takes place after the consensus pertaining to the anomaly detection is achieved among all interconnected agents and it serves the purpose of mitigating certain cyber attacks. The attack resilience of the decentralized SIPS is evaluated using IEEE 39 bus model. It is shown that, unlike the traditional centralized SIPS, the proposed solution is able to carry out the remedial actions under most Denial of Service (DoS) attacks. The second part investigates the clustering based anomalous behavior detection and peer-assisted mitigation for power system generation control. To reduce the dimensionality of the data, three metrics are designed to interpret the behavior conformity of generator within the same balancing area. Semi-supervised K-means clustering and a density sensitive clustering algorithm based on Hierarchical DBSCAN (HDBSCAN) are both applied in clustering in the 3D feature space. Aiming to mitigate the cyber attacks targeting the generation control commands, a peer-assisted strategy is proposed. When the control commands from control center is detected as anomalous, i.e. either missing or the payload of which have been manipulated, the generating unit utilizes the peer data to infer and estimate a new generation adjustment value as replacement. Linear regression is utilized to obtain the relation of control values received by different generating units, Moving Target Defense (MTD) is adopted during the peer selection and 1-dimensional clustering is performed with the inferred control values, which are followed by the final control value estimation. The mitigation strategy proposed requires that generating units can communicate with each other in a peer-to-peer manner. Evaluation results suggest the efficacy of the proposed solution in counteracting data availability and data integrity attacks targeting the generation controls. However, the strategy stays effective only if less than half of the generating units are compromised and it is not able to mitigate cyber attacks targeting the measurements involved in the generation control.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2018

Atmospheric River Tracking Method Intercomparison Project (ARTMIP): Report of the Second ARTMIP Workshop

Atmospheric rivers (ARs) have for the last decade been broadly recognized for their global and regional significance in mediating energy and water cycles. As a distinct large-scale circulation feature, ARs can be characterized by long, narrow bands of atmospheric moisture transport from the tropics to higher latitudes. They are both an important source of water supply to coastal regions as well as a hazard because of their predisposition to increase flood risk. However, predicting ARs poses a significant challenge to the scientific community, as they exhibit large variability from subseasonal-to-interannual time scales. On multi-decadal and longer time scales, it is unclear how the frequency and intensity of ARs will change with a warming climate. Hence ARs play a significant role in understanding predictability of water cycle variability and extremes as well as becoming a factor in assessing risks to future infrastructures. There is a large body of literature that has explored ARs from both global and regional perspectives and from timescales spanning hourly to centennial. Despite significant progress in understanding ARs, significant gaps remain, e.g., in characterizing the dynamical and thermodynamical processes associated with ARs, improving predictions of ARs at weather and subseasonal-to-seasonal timescales, and understanding and quantifying the impacts of ARs on the design and management of built infrastructures. Furthermore, the consensus definition of ARs remains essentially qualitative, and investigators have had to rely on heuristic definitions of ARs for quantitative studies. In the First Atmospheric River Tracking Method Intercomparison Project (ARTMIP) workshop held in May 2017, it was recognized that (1) there are many heuristic AR tracking algorithms employed in the literature, (2) our quantitative—and possibly qualitative— understanding of ARs and their impacts may depend on the details of the algorithm used, (3) no data set yet exists to systematically explore the impact of AR tracking algorithm choice on scientific results, and (4) the broader scientific community therefore lacks any formal guidance on the advantages and disadvantages of different AR tracking methods. The First ARTMIP workshop defined and launched a multi-tiered intercomparison experiment designed to fill this community need. The first tier of ARTMIP was aimed at understanding the impact of AR algorithms on quantitative baseline statistics and characteristics of ARs, and the second tier includes sensitivity studies designed around specific science questions, such as reanalysis uncertainty and influences associated with climate change. The Second ARTMIP workshop was convened on April 23-24, 2018, as a two-day event, and following the completion of Tier 1 of the ARTMIP effort: an experiment in which most existing AR tracking algorithms were run on a standardized data set of reanalyzed weather conditions.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS2002

Continual coordination of shared activities

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

multiple agents coordination planning scheduling M↗

NASA NTRS2011

Local Estimators for Spacecraft Formation Flying

A formation estimation architecture for formation flying builds upon the local information exchange among multiple local estimators. Spacecraft formation flying involves the coordination of states among multiple spacecraft through relative sensing, inter-spacecraft communication, and control. Most existing formation flying estimation algorithms can only be supported via highly centralized, all-to-all, static relative sensing. New algorithms are needed that are scalable, modular, and robust to variations in the topology and link characteristics of the formation exchange network. These distributed algorithms should rely on a local information-exchange network, relaxing the assumptions on existing algorithms. In this research, it was shown that only local observability is required to design a formation estimator and control law. The approach relies on breaking up the overall information-exchange network into sequence of local subnetworks, and invoking an agreement-type filter to reach consensus among local estimators within each local network. State estimates were obtained by a set of local measurements that were passed through a set of communicating Kalman filters to reach an overall state estimation for the formation. An optimization approach was also presented by means of which diffused estimates over the network can be incorporated in the local estimates obtained by each estimator via local measurements. This approach compares favorably with that obtained by a centralized Kalman filter, which requires complete knowledge of the raw measurement available to each estimator.

Fathpour, Nanaz↗

DOE OSTI2026

The DESI DR1 peculiar velocity survey: growth rate measurements from the maximum likelihood fields method

We present the constraint on the growth rate of structure from the combination of DESI DR1 BGS sample, Fundamental Plane, and Tully-Fisher peculiar velocity catalogues using the maximum likelihood fields method. The combined catalogue contains 415,523 galaxy redshifts and 76,616 peculiar velocity measurements. To handle the large amount of data in the DESI DR1 peculiar velocity catalogue, we significantly improve the computational efficiency by rewriting the algorithm with JAX. After removing outliers and Tully-Fisher galaxies that are affected by systematics, we find fσ 8 = 0.483 -0.043 +0.080 (stat) ± 0.018(sys), consistent within 1σ with the power spectrum and correlation function analysis using the same dataset. Combining all three measurements with appropriate correlations, the consensus measurement is fσ 8 (z eff = 0.07) = 0.450±0.055, consistent with Planck +ΛCDM cosmology (fσ 8 = 0.449±0.008). Combining with the high redshift growth rate of structure measurements from DESI ShapeFit, the constraint on the growth index is γ = 0.58±0.11, consistent with GR.

cosmic flows↗

DOE OSTI2024

Graph Analytics on Jellyfish topology

Because large unstructured datasets is important for many science domains, distributed graph analytics is critical to many scientists. Unfortunately, obtaining scaling and performance for irregular communication is challenging because contemporary network interconnects are primarily designed to maximize bandwidths of fixed-neighborhoods large-message exchanges (e.g., stencils). Although there is no consensus on the “best” network topologies for irregular communication, unstructured graph-based interconnects can be more suitable. We analyze three popular graph workloads – clustering, pattern enumeration, and traversal — on comparable networks (in terms of resources and costs) constructed from Jellyfish Random Regular, Dragonfly and Fat tree topologies, varying the routing algorithms. Using packet-level simulations, we demonstrate up to 60% improvement in communication time with Jellyfish due to diversity of the short paths between arbitrary endpoints, which can reduce overall network stalls and congestion.

Graph Analytics, network topology, interconnect, H↗

DOE OSTI2020

Clustering Analysis of Commercial Vehicles Using Automatically Extracted Features from Time Series Data

Standard of practice approaches to time series cluster analysis involve careful feature engineering, often utilizing expert input to tune and select features by hand. In many cases, expert input may not be readily available, or there may not yet exist a community consensus on the ideal features for a given application. This paper compares the results of several cluster analysis methods, using both hand selected features and those extracted automatically, when applied to large geospatial time series telematics data from commercial trucking fleets. The impacts of feature selection, dimensionality reduction, and choice of clustering algorithm on the quality of clustering results are explored. Results from this analysis confirm prior results that domain agnostic features are competitive with the hand engineered features with respect to clustering quality metrics. These results also provide new insight into the most successful strategies for identifying structure in large unstructured vehicle telematics data, and suggest that time series clustering using automatic feature extraction can be an effective approach to extract structure from large scale geospatial time series data in cases when hand selected features are not available.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2022

Robust Decentralized Learning Using ADMM With Unreliable Agents

Many signal processing and machine learning problems can be formulated as consensus optimization problems which can be solved efficiently via a cooperative multi-agent system. However, the agents in the system can be unreliable due to a variety of reasons: noise, faults and attacks. Providing erroneous updates leads the optimization process in a wrong direction, and degrades the performance of distributed machine learning algorithms. This paper considers the problem of decentralized learning using ADMM in the presence of unreliable agents. First, we rigorously analyze the effect of erroneous updates (in ADMM learning iterations) on the convergence behavior of the multi-agent system. We show that the algorithm linearly converges to a neighborhood of the optimal solution under certain conditions and characterize the neighborhood size analytically. Next, we provide guidelines for network design to achieve a faster convergence to the neighborhood. Here, we also provide conditions on the erroneous updates for exact convergence to the optimal solution. Finally, to mitigate the influence of unreliable agents, we propose ROAD , a robust variant of ADMM, and show its resilience to unreliable agents with an exact convergence to the optimum.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Automated evaluation of quaternary structures from protein crystals

A correct assessment of the quaternary structure of proteins is a fundamental prerequisite to understanding their function, physico-chemical properties and mode of interaction with other proteins. Currently about 90% of structures in the Protein Data Bank are crystal structures, in which the correct quaternary structure is embedded in the crystal lattice among a number of crystal contacts. Computational methods are required to 1) classify all protein-protein contacts in crystal lattices as biologically relevant or crystal contacts and 2) provide an assessment of how the biologically relevant interfaces combine into a biological assembly. In our previous work we addressed the first problem with our EPPIC (Evolutionary Protein Protein Interface Classifier) method. Here, we present our solution to the second problem with a new method that combines the interface classification results with symmetry and topology considerations. The new algorithm enumerates all possible valid assemblies within the crystal using a graph representation of the lattice and predicts the most probable biological unit based on the pairwise interface scoring. Our method achieves 85% precision (ranging from 76% to 90% for different oligomeric types) on a new dataset of 1,481 biological assemblies with consensus of PDB annotations. Although almost the same precision is achieved by PISA, currently the most popular quaternary structure assignment method, we show that, due to the fundamentally different approach to the problem, the two methods are complementary and could be combined to improve biological assembly assignments.

59 BASIC BIOLOGICAL SCIENCES↗

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↗

DOE OSTI2022

Integrating multimodal data through interpretable heterogeneous ensembles

Motivation: Integrating multimodal data represents an effective approach to predicting biomedical characteristics, such as protein functions and disease outcomes. However, existing data integration approaches do not sufficiently address the heterogeneous semantics of multimodal data. In particular, early and intermediate approaches that rely on a uniform integrated representation reinforce the consensus among the modalities but may lose exclusive local information. The alternative late integration approach that can address this challenge has not been systematically studied for biomedical problems. Results: We propose Ensemble Integration (EI) as a novel systematic implementation of the late integration approach. EI infers local predictive models from the individual data modalities using appropriate algorithms and uses heterogeneous ensemble algorithms to integrate these local models into a global predictive model. We also propose a novel interpretation method for EI models. We tested EI on the problems of predicting protein function from multimodal STRING data and mortality due to coronavirus disease 2019 (COVID-19) from multimodal data in electronic health records. We found that EI accomplished its goal of producing significantly more accurate predictions than each individual modality. It also performed better than several established early integration methods for each of these problems. The interpretation of a representative EI model for COVID-19 mortality prediction identified several disease-relevant features, such as laboratory test (blood urea nitrogen and calcium) and vital sign measurements (minimum oxygen saturation) and demographics (age). These results demonstrated the effectiveness of the EI framework for biomedical data integration and predictive modeling.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS2011

Evaluating the Application of Multi-Satellite Observations in Hydrologic Modeling

When monitoring local or regional hydrosphere dynamics for applications such as agricultural productivity or drought and flooding events, it is necessary to have accurate, high-resolution estimates of terrestrial water and energy storages. Though in-situ observations provide reliable estimates of hydrologic states and fluxes, they are only capable of accurately capturing the dynamics at relatively discrete points in space and time, which makes them inadequate for characterizing the variability of the water budget across scales. In contrast, satellite-based remote sensing is ideal for providing observations of hydrological states and fluxes because it provides spatially-distributed observations at spatial and temporal scales required for regional land surface process modeling. Due to the continued progress in algorithm development and emerging satellite technology, we now have near-real time monitoring of several components of the water cycle including precipitation, soil moisture, lake and river height, terrestrial water storage, snow cover, and evapotranspiration. As these data become more readily available, their application to hydrologic modeling is becoming more common, however there remains little consensus on the most appropriate method for optimal integration and evaluation in regard to hydrological applications. Here we present two case studies operationally applying several remotely sensed products from AMSR-E, GRACE, and MODIS and discuss assimilation strategies, ease of integration and interpretation, and methods for quantifying the success of the application methodology.

Bolten, John↗

DOE OSTI2020

Multi-Agent Safe Policy Learning for Power Management of Networked Microgrids

This paper presents a supervised multi-agent safe policy learning (SMAS-PL) method for optimal power management of networked microgrids (MGs) in distribution systems. While unconstrained reinforcement learning (RL) algorithms are black-box decision models that could fail to satisfy grid operational constraints, our proposed method considers AC power flow equations and other operational limits. Accordingly, the training process employs the gradient information of operational constraints to ensure that the optimal control policy functions generate safe and feasible decisions. Furthermore, we have developed a distributed consensus-based optimization approach to train the agents’ policy functions while maintaining MGs’ privacy and data ownership boundaries. After training, the learned optimal policy functions can be safely used by the MGs to dispatch their local resources, without the need to solve a complex optimization problem from scratch. Lastly, numerical experiments have been devised to verify the performance of the proposed method.

, policy gradient↗

DOE OSTI2019

Consensus Control (Wind Farm Collective Yaw Control) [SWR-19-11]

Wind turbines in a wind farm typically operate individually to maximize their own performance and do not take into account information from nearby turbines. In an autonomous wind farm, enabling cooperation to achieve farm-level objectives, turbines will need to use information from nearby turbines to optimize performance, ensure resiliency when other sensors fail, and adapt to changing local conditions. A key element of achieving an autonomous wind farm is to develop algorithms that provide necessary information to ensure reliable, robust, and efficient operation of wind turbines in a wind plant using local sensor information that is already being collected, such as supervisory control and data acquisition (SCADA) data, local meteorological stations, and nearby radars/sodars/lidars. This code implements a framework for implementing an autonomous wind farm that incorporates information from local sensors in real time to better align turbines in a wind farm. Oftentimes, measurements made at an individual turbine are noisy and unreliable. By incorporating measurements from multiple nearby turbines, a more robust estimate of the wind direction can be obtained at an individual turbine. Results indicate that this estimate of the wind direction can be used to improve the turbine's knowledge of the wind direction and could decrease dynamic yaw misalignment, decrease the amount of time a turbine spends yawing due to a more robust input to the yaw controller, and increase resiliency to faulty wind-vane measurements.

King, Jennifer↗

NASA NTRS1975

Quantification of geologic lineaments by manual and machine processing techniques

A study was conducted to investigate the effect of operator variability and subjectivity in lineament mapping and to examine methods to minimize or eliminate these problems by use of several machine preprocessing methods. LANDSAT scenes from the Anadarko Basin of Oklahoma and the Colorado Plateau were analyzed as test cases. Four geologists mapped lineaments on an Anadarko Basin scene, using transparencies of MSS bands 4-7, and their results are compared statistically. The total number of fractures mapped by the operators and their average lengths varied considerably, although comparison of lineament directions revealed some consensus. A summary map (785 linears) produced by overlaying the maps generated by the four operators showed that only 0.4% were recognized by all four operators, 4.7% by three, 17.8% by two and 77% by one operator. Two methods of machine aided mapping were tested, both simulating directional filters. One consists of computer (digital) processing of CCTs using edge enhancement algorithms, the other employs a television (analog) scanning of an image transparency which superimposes the original image and one offset in the direction of the scan line.

Podwysocki, M. H.↗

NASA NTRS2018

NASA's SnowEx Campaign and Measuring Global Snow from Space

Snow blankets 30% of Earth's land surface (60% of northern hemisphere land) in midwinter, dramatically changing our planet's land surface and affecting our weather for months. Seasonal snow is critically important to society for the management of water resources, natural hazards, water security, and in many economic sectors. The only practical way to estimate the quantity of snow on a global scale is through satellites. Despite 4 decades of satellite observations, the highly variable nature of snow still presents significant challenges toward achieving this goal. For example, current space-based techniques underestimate snow water equivalent (SWE) by as much as 50%, and model-based estimates can differ greatly versus estimates based on remotely-sensed observations. Snow community consensus is that a multi-sensor approach is needed to adequately address global snow, combined with modeling and data assimilation to fill the gaps in space and time. What remains, then, is how best to combine and use the various sensors under different types of snow conditions and confounding factors. NASA's multi-year SnowEx airborne campaign is designed to collect measurements needed to enable algorithm development and to guide those mission trade studies. Year 1 (2017) focused on the distribution of snow-water equivalent (SWE) and the snow energy balance in a forested environment. This paper will discuss the various remote sensing options for snow, the challenging factors, and describe the recently-completed first year of SnowEx in Colorado, USA. Ground-based remote sensing and in situ data collection involved nearly 100 participants over three weeks. The airborne campaign included nine sensors on five aircraft. We will conclude by discussing options for a future snow satellite mission.

campaign↗

DOE OSTI2017

Concurrent conversation modeling and parallel simulation of the naming game in social networks

The Naming Game is an effective self-organization model to understand the emergence of linguistic consensus and to investigate the system dynamics in a variety of phenomena over social networks of autonomous agents. The Naming Game is an effective description for the evolution of consensus despite the absence of any central coordination or specialized initialization even in large-scale networks. While the classical game is effective in description, it was defined with inherently sequential evaluation semantics over the entire network. Here, we develop a new concurrent model as a relaxation of the classical formulation and express it in a discrete event style of evaluation. Further, with the uncovered concurrency that was absent in the classical algorithm, we map the concurrent model to parallel discrete event simulation. Using a prototype implementation, we present an initial parallel performance study on networks containing hundreds of thousands of individuals, with a decrease in simulation time in the best-observed case from 4800 seconds down to 1400 seconds.

Perumalla, Kalyan↗