Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multiple agents”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Scheduling Multiple Agents in a Persistent Monitoring Task Using Reachability Analysis

We consider the problem of controlling the dynamic state of each of a finite collection of targets distributed in physical space using a much smaller collection of mobile agents. Each agent can attend to no more than one target at a given time, thus agents must move between targets to control the collective state, implying that the states of each of the individual targets are only controlled intermittently. We assume that the state dynamics of each of the targets are given by a linear, time-invariant, controllable system, and develop conditions on the visiting schedules of the agents to ensure that the property of controllability is maintained in the face of the intermittent control. We then introduce constraints on the magnitude of the control input and a bounded disturbance into the target dynamics and develop a method to evaluate system performance under this scenario. Finally, we use this method to determine how the amount of time the agents spend at a given target, before switching to the next in its sequence, influences the control of the states of the entire collection of targets.

42 ENGINEERING↗
DOE OSTI2025

Topology-Aware Reinforcement Learning for Voltage Control: Centralized and Decentralized Strategies

Volt-VAR control (VVC) methods based on deep reinforcement learning (DRL) can effectively control distribution grid voltage and minimize power loss by implementing corrective and preventive control measures on the reactive power output of inverter-based distributed energy resources (DERs). However, model-free DRL-based VVC approaches usually cannot capture the important topological feature of the power system since they use a fully-connected network (FCN) to deliver the action. Therefore, this paper proposes a graph convolutional network (GCN)-based DRL approach that can employ the topological information of the network to take better control action for regulating the voltage. Our implementation allows for both centralized and decentralized configurations, utilizing a single agent and multiple agents respectively. Although the centralized GCN-based DRL approach has its advantages of minimizing voltage fluctuation and power loss, it is not suitable for large scale power systems due to its challenges in terms of scalability, computation speed and potential single points of failure. Therefore, these problems can be resolved using the decentralized GCN-based DRL approach. Moreover, to ensure the safe operation of the model, our proposed approach incorporates an exponential barrier function while formulating the reward function for each agent. To validate performance of the proposed approaches, the proposed model is tested on modified IEEE test systems and the performances are measured in terms on voltage fluctuation reduction, minimization of power loss and computational speed. Finally, the results show that the proposed topology-aware approach outperforms the FCN-based DRL approach in terms of reducing voltage fluctuation and minimizing power loss of the network. Moreover, it is shown that the decentralized GCN-based DRL has faster computational speed than other approaches.

42 ENGINEERING↗
DOE OSTI2022

The role of information structures in game-theoretic multi-agent learning

Multi-agent learning (MAL) studies how agents learn to behave optimally and adaptively from their experience when interacting with other agents in dynamic environments. The outcome of a MAL process is jointly determined by all agents’ decision-making. Hence, each agent needs to think strategically about others’ sequential moves, when planning future actions. The strategic interactions among agents makes MAL go beyond the direct extension of single-agent learning to multiple agents. With the strategic thinking, each agent aims to build a subjective model of others decision-making using its observations. Such modeling is directly influenced by agents’ perception during the learning process, which is called the information structure of the agent’s learning. As it determines the input to MAL processes, information structures play a significant role in the learning mechanisms of the agents. This review creates a taxonomy of MAL and establishes a unified and systematic way to understand MAL from the perspective of information structures. Here we define three fundamental components of MAL: the information structure (i.e., what the agent can observe), the belief generation (i.e., how the agent forms a belief about others based on the observations), as well as the policy generation (i.e., how the agent generates its policy based on its belief). In addition, this taxonomy enables the classification of a wide range of state-of-the-art algorithms into four categories based on the belief-generation mechanisms of the opponents, including stationary, conjectured, calibrated, and sophisticated opponents. We introduce Value of Information (VoI) as a metric to quantify the impact of different information structures on MAL. Finally, we discuss the strengths and limitations of algorithms from different categories and point to promising avenues of future research.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

An agent-based blackboard system for multi-objective optimization

In the field of multi-objective optimization, there are a multitude of algorithms from which to choose. Each algorithm has strengths and weaknesses associated with the mechanics for finding the Pareto front. Recently, researchers have begun to examine how multi-agent environments can be used to help solve multi-objective optimization problems. In this work, we propose a multi-objective optimization algorithm based on a multi-agent blackboard system (MABS). The MABS framework allows for multiple agents to read and write pertinent optimization problem data to a central blackboard agent. Agents can stochastically search the design space, use previously discovered solutions to explore local optima, or update and prune the Pareto front. A centralized blackboard framework allows the optimization problem to be solved in a cohesive manner and permits stopping, restarting, or updating the optimization problem. The MABS framework is tested against three alternative optimization algorithms across a suite of engineering design problems and typically outperforms the other algorithms in discovering the Pareto front. A parallelizability study is performed where we find that the MABS is able to evaluate a set number of designs, which require an evaluation time ranging from 0 to 300 seconds, quicker than a traditional optimization algorithm: this fact becomes more apparent the longer it takes to evaluate a design. To provide context for the benefits provided by MABS, a real-world nuclear engineering design problem is examined. MABS is used to examine the placement of experiments in a nuclear reactor, where we are able to evaluate hundreds of configurations for experimental placement while maintaining a strict set of safety constraints.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

A Novel Multi-Agent Deep Reinforcement Learning-enabled Distributed Power Allocation Scheme for mmWave Cellular Networks

We consider the power allocation problem over shared spectrum for millimeter-Wave (mmWave) cellular downlink. Existing approaches usually find sub-optimal solutions by solving a non-convex optimization which leads to scalability issues due to centralized control. Therefore, distributed and adaptive approaches are desirable. Recently, model-free Deep Reinforcement Learning (DRL) has achieved success in such wireless resource management tasks. By modeling the radio environment as a Markov Decision Process (MDP) with the base stations (BSs) being the agents, power allocation can be automated at the agent level with comparable throughput performance to conventional centralized schemes. The multi-agent setting presents new challenges as the radio environment is impacted by the joint actions of the agents and is no longer stationary from any individual agent’s perspective. Existing literature bypasses this non-stationarity violation by ignoring it which may cause performance degradation. To tackle this issue, we propose a distributed continuous power allocation scheme based on a modified version of multi-agent Deep Deterministic Policy Gradient (MADDPG) that is tailored for the distributed multiple-agent setting. The proposed scheme employs a centralized-training distributed-execution framework where Q-functions are trained over subsets of BSs while each BS determines its transmit power based only on its own local observation. It admits constant per-BS communication and computation complexity and is thus scalable to large networks. Numerical evaluation shows that the proposed scheme adapts well to a wide range of interference conditions and can achieve comparable or better performance than several state-of-the-art non-learning approaches.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2024

Multi-Agent Graph-Attention Deep Reinforcement Learning for Post-Contingency Grid Emergency Voltage Control

Grid emergency voltage control (GEVC) is paramount in electric power systems to improve voltage stability and prevent cascading outages and blackouts in case of contingencies. While most deep reinforcement learning (DRL)-based paradigms perform single agents in a static environment, real-world agents for GEVC are expected to cooperate in a dynamically shifting grid. Moreover, due to high uncertainties from combinatory natures of various contingencies and load consumption, along with the complexity of dynamic grid operation, the data efficiency and control performance of the existing DRL-based methods are challenged. To address these limitations, we propose a multi-agent graph-attention (GATT)-based DRL algorithm for GEVC in multi-area power systems. Here, we develop graph convolutional network (GCN)-based agents for feature representation of the graph-structured voltages to improve the decision accuracy in a data-efficient manner. Furthermore, a cutting-edge attention mechanism concentrates on effective information sharing among multiple agents, synergizing different-sized subnetworks in the grid for cooperative learning. We address several key challenges in the existing DRL-based GEVC approaches, including low scalability and poor stability against high uncertainties. Test results in the IEEE benchmark system verify the advantages of the proposed method over several recent multi-agent DRL-based algorithms.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

“Multiagent” Screening Improves Directed Enzyme Evolution by Identifying Epistatic Mutations

Enzyme evolution has enabled numerous advances in biotechnology and synthetic biology, yet still requires many iterative rounds of screening to identify optimal mutant sequences. This is due to the sparsity of the fitness landscape, which is caused by epistatic mutations that only offer improvements when combined with other mutations. We report an approach that incorporates diverse substrate analogues in the screening process, where multiple substrates act like multiple agents navigating the fitness landscape, identifying epistatic mutant residues without a need for testing the entire combinatorial search space. We initially validate this approach by engineering a malonyl-CoA synthetase and identify numerous epistatic mutations improving activity for several diverse substrates. The majority of these mutations would have been missed upon screening for a single substrate alone. We expect that this approach can accelerate a wide array of enzyme engineering programs.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Layered Coordination Architecture for Resilient Restoration of Power Distribution Systems

The current practices for restoring critical services in the distribution system during a disaster, align with the traditional centralized ideology of distribution systems operations. A central processor evaluates the distribution system after a disruption and attains a restoration plan. However, the centralized operational paradigm is susceptible to single-point failures, requires full situational awareness of the distribution system, and poses scalability challenges for large multifeeder distribution systems. This motivates a distributed decision-making paradigm where multiple agents solve smaller subproblems and jointly coordinate their individual decisions to achieve the global/network-level objective. Toward this goal, we propose a layered architecture for distributed algorithms for resilience and a two-stage distributed algorithm for distribution system restoration. The proposed distributed decision-making framework enables the bottom-up restoration of the distribution system using all available resources, including distributed generation, while only requiring local awareness and limited communications with neighboring connected regions. The proposed framework is robust to single-point failures, enables autonomy using distributed algorithms, and had reduced computational cost compared to centralized optimization solutions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Integrating the evidence for a terrestrial carbon sink caused by increasing atmospheric CO 2

Atmospheric carbon dioxide concentration ([CO 2 ]) is increasing, which increases leaf-scale photosynthesis and intrinsic water-use efficiency. These direct responses have the potential to increase plant growth, vegetation biomass, and soil organic matter; transferring carbon from the atmosphere into terrestrial ecosystems (a carbon sink). A substantial global terrestrial carbon sink would slow the rate of [CO 2 ] increase and thus climate change. However, ecosystem CO 2 -responses are complex or confounded by concurrent changes in multiple agents of global change and evidence for a [CO 2 ]-driven terrestrial carbon sink can appear contradictory. In this work, we synthesise theory and broad, multi-disciplinary evidence for the effects of increasing [CO 2 ] (iCO 2 ) on the global terrestrial carbon sink. Evidence suggests a substantial increase in global photosynthesis since pre-industry. Established theory, supported by experiments, indicates that iCO 2 is likely responsible for about half of the increase. Global carbon budgeting, atmospheric data, and forest inventories indicate a historical carbon sink, and these apparent iCO 2 -responses are high in comparison with experiments and theory. Plant mortality and soil carbon iCO 2 -responses are highly uncertain. In conclusion, a range of evidence supports a positive terrestrial carbon sink in response to iCO 2 , albeit with uncertain magnitude and strong suggestion of a role for additional agents of global change.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

How robust are estimates of key parameters in standard viral dynamic models?

Mathematical models of viral infection have been developed, fitted to data, and provide insight into disease pathogenesis for multiple agents that cause chronic infection, including HIV, hepatitis C, and B virus. However, for agents that cause acute infections or during the acute stage of agents that cause chronic infections, viral load data are often collected after symptoms develop, usually around or after the peak viral load. Consequently, we frequently lack data in the initial phase of viral growth, i.e., when pre-symptomatic transmission events occur. Missing data may make estimating the time of infection, the infectious period, and parameters in viral dynamic models, such as the cell infection rate, difficult. However, having extra information, such as the average time to peak viral load, may improve the robustness of the estimation. Here, we evaluated the robustness of estimates of key model parameters when viral load data prior to the viral load peak is missing, when we know the values of some parameters and/or the time from infection to peak viral load. Although estimates of the time of infection are sensitive to the quality and amount of available data, particularly pre-peak, other parameters important in understanding disease pathogenesis, such as the loss rate of infected cells, are less sensitive. Viral infectivity and the viral production rate are key parameters affecting the robustness of data fits. Fixing their values to literature values can help estimate the remaining model parameters when pre-peak data is missing or limited. We find a lack of data in the pre-peak growth phase underestimates the time to peak viral load by several days, leading to a shorter predicted growth phase. On the other hand, knowing the time of infection (e.g., from epidemiological data) and fixing it results in good estimates of dynamical parameters even in the absence of early data. While we provide ways to approximate model parameters in the absence of early viral load data, our results also suggest that these data, when available, are needed to estimate model parameters more precisely.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Genetic Complexity of CC5 Staphylococcus aureus Isolates Associated with Sternal Bursitis in Chickens: Antimicrobial Resistance, Virulence, Plasmids, and Biofilm Formation

Sternal bursitis, a common inflammatory condition in poultry, poses significant challenges to both animal welfare and public health. This study aimed to investigate the prevalence, antimicrobial resistance, and genetic characteristics of Staphylococcus aureus isolates associated with sternal bursitis in chickens. Ninety-eight samples were collected from affected chickens, and 24 S. aureus isolates were identified. Antimicrobial susceptibility testing revealed resistance to multiple agents, with a notable prevalence of aminoglycoside resistance genes. Whole genome sequencing elucidated the genetic diversity and virulence profiles of the isolates, highlighting the predominance of clonal complex 5 (CC5) strains. Additionally, biofilm formation assays demonstrated moderate biofilm production capacity among the isolates. These findings underscore the importance of vigilant monitoring and targeted interventions to mitigate the impact of sternal bursitis in poultry production systems.

Silva, Vanessa (ORCID:0000000194068433)↗
DOE OSTI2022

Non-target RNA depletion strategy to improve sensitivity of next-generation sequencing for the detection of RNA viruses in poultry

PCR-based assays have become the benchmark for detecting pathogens of poultry and other livestock; however, these techniques are limited in their ability to detect multiple infecting agents, provide limited genetic information on the pathogen, and, for RNA viruses, must be reviewed frequently to assure high sensitivity and specificity. In contrast, untargeted, high-throughput sequencing can rapidly detect all infecting agents in a sample while providing genomic sequence information to allow more in-depth characterization of viruses. Although next-generation sequencing (NGS) offers many advantages, one of its primary limitations is low sensitivity to pathogens given the abundance of host and other non-target sequences in sequencing libraries. We explored methods for improving the sensitivity of NGS to detect respiratory and enteric viruses in poultry from RNA extracts of swab samples. We employed commercial and custom-designed negative enrichment strategies to selectively deplete the most abundant rRNA reads from the host and non-target bacteria; host RNA was diminished from up to 40% of total reads to as low as 3%, and the total number of reads assigned to abundant bacterial classes were reduced greatly. Our treatment resulted in up to a 700-fold increase in the number of viral reads, detection of a greater number of viral agents, and higher average genome coverage for pathogens. Depletion assays added only 2 h to the NGS library preparation workflow. Custom depletion probe design offered significant cost savings (US$7–12 per sample) compared to commercial kits (US$30–50 per sample).

Parris, D. Joshua↗
DOE OSTI2023

Projected Multi-Agent Consensus Equilibrium (PMACE) With Application to Ptychography

Multi-Agent Consensus Equilibrium (MACE) formulates an inverse imaging problem as a balance among multiple update agents such as data-fitting terms and denoisers. However, each such agent operates on a separate copy of the full image, leading to redundant memory use and slow convergence when each agent affects only a small subset of the full image. In this article, we extend MACE to Projected Multi-Agent Consensus Equilibrium (PMACE), in which each agent updates only a projected component of the full image, thus greatly reducing memory use for some applications. We describe PMACE in terms of an equilibrium problem and an equivalent fixed-point problem and show that in most cases the PMACE equilibrium is not the solution of an optimization problem. To demonstrate the value of PMACE, we apply it to the problem of ptychography, in which a sample is reconstructed from the diffraction patterns resulting from coherent X-ray illumination at multiple overlapping spots. In our PMACE formulation, each spot corresponds to a separate data-fitting agent, with the final solution found as an equilibrium among all the agents. In conclusion, our results demonstrate that the PMACE reconstruction algorithm generates more accurate reconstructions at a lower computational cost than existing ptychography algorithms when the spots are sparsely sampled.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Genomic surveillance indicates clonal replacement of hypervirulent Klebsiella pneumoniae ST881 and ST29 lineage strains in vivo

The emergence of hypervirulent Klebsiella pneumoniae (hvKp) poses a significant public health threat, particularly regarding its carriage in the healthy population. However, the genomic epidemiological characteristics and population dynamics of hvKp within a single patient across distinct infection episodes remain largely unknown. This study aimed to investigate the clonal replacement of hvKp K2-ST881 and K54-ST29 lineage strains in a single patient experiencing multiple-site infections during two independent episodes. Two strains, designated EDhvKp-1 and EDhvKp-2, were obtained from blood and cerebrospinal fluid during the first admission, and the strain isolated from blood on the second admission was named EDhvKp-3. Whole-genome sequencing, utilizing both short-read Illumina and long-read Oxford Nanopore platforms, was conducted. In silico multilocus sequence typing (MLST), identification of antimicrobial resistance and virulence genes, and the phylogenetic relationship between our strains and other K. pneumoniae ST881 and ST29 genomes retrieved from the public database were performed. Virulence potentials were assessed through a mouse lethality assay. Our study indicated that the strains were highly susceptible to multiple antimicrobial agents. Plasmid sequence analysis confirmed that both virulence plasmids, pEDhvKp-1 (166,008 bp) and pEDhvKp-3 (210,948 bp), belonged to IncFIB type. Multiple virulence genes, including rmpA , rmpA2 , rmpC , rmpD , iroBCDN , iucABCD , and iutA , were identified. EDhvKp-1 and EDhvKp-2 showed the closest relationship to strain 502 (differing by 51 SNPs), while EDhvKp-3 exhibited 69 SNPs differences compared to strain TAKPN-1, which all recovered from Chinese patients in 2020. In the mouse infection experiment, both ST881 EDhvKp-1 and ST29 EDhvKp-3 displayed similar virulence traits, causing 90 and 100% of the mice to die within 72 h after intraperitoneal infection, respectively. Our study expands the spectrum of hvKp lineages and highlights genomic alterations associated with clonal switching between two distinct lineages of hvKP that successively replaced each other in vivo . The development of novel strategies for the surveillance, diagnosis, and treatment of high-risk hvKp is urgently needed.

Liu, Ning↗
DOE OSTI2020

Exploring the Effects of Node Topology, Connectivity, and Metal Identity on the Binding of Nerve Agents and Their Hydrolysis Products in Metal–Organic Frameworks

Recent studies have shown that metal–organic frameworks (MOFs) built from hexanuclear M(IV) oxide cluster nodes are effective catalysts for nerve agent hydrolysis, where the properties of the active sites on the nodes can strongly influence the reaction energetics. The connectivity and metal identity of these M6 nodes can be easily tuned, offering extensive opportunities for computational screening to predict promising new materials. Thus, we used density functional theory (DFT) to examine the effects of node topology, connectivity, and metal identity on the binding energies of multiple nerve agents and their corresponding hydrolysis products. By computing an optimization metric based on the relative binding strengths of key hydrolysis reaction species (water, agent, and bidentate-bound products), we predicted optimal M6 nodes for hydrolyzing specific nerve agent and simulant molecules, where our results are in qualitative agreement with observed experimental trends. This analysis highlighted the notion that no single metal or node topology is optimal for all possible organophosphates, suggesting that MOFs should be selected based on the agent of interest. Using the large amount of data generated from our DFT calculations, we then derived quantitative structure–activity relationship (QSAR) models to help explain the complex trends observed in the binding energies. Through linear regression, we identified the most important descriptors for describing the binding of nerve agents and their hydrolysis products to M6 nodes. These results suggested that both molecular and node properties, including both structural and chemical features, collectively contribute to the binding energetics. By performing a thorough statistical analysis, we showed that our QSAR models are capable of making quantitatively accurate binding energy predictions for nerve agents and their hydrolysis products in a wide variety of M(IV)-MOFs. In conclusion, the insights gained herein can be used to guide future experiments for the synthesis of MOFs with enhanced catalytic activity for organophosphate hydrolysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Titrating Controlled Defects into Si-LTA Zeolite Crystals Using Multiple Organic Structure-Directing Agents

Controlling defects in zeolites is crucial for tuning their adsorption and catalytic properties. In this work, we have performed an integrated zeolite synthesis, spectroscopy, and density functional theory study to test the limit of F– as a charge-balancing agent that mitigates defects in siliceous zeolites. We focused on the synthesis of siliceous zeolite LTA at 150 °C with 1,2-dimethyl-3-(4-methylbenzyl) imidazolium as the primary organic structure-directing agent (OSDA) and tetramethyl ammonium (TMA) as the secondary OSDA. By varying the amount of TMA in the synthesis gel, positive charges were titrated into the resulting as-made Si-LTA. Surprisingly, we found that greater TMA concentration does not induce more F– to enter into the zeolite. 29Si solid-state MAS NMR, Raman spectroscopy, and density functional theory suggest that this system has surpassed its capacity for F– to balance OSDA charge, and additional positive charge is balanced by Si–O– framework defects. The number of defects in the as-made Si-LTA can be precisely titrated by the amount of TMA in the zeolite structures. For the Si-LTA synthesized without TMA, framework defects formed in the early stage of crystal growth were found to heal during later crystallization, leading to defect-free Si-LTA. However, for the Si-LTA synthesized with TMA, the defects formed in early stages do not heal. A DFT thermodynamic analysis explains that crowding of Si-LTA pores by TMA impedes defect healing; this prediction is corroborated by synthesis experiments at an elevated temperature (170 °C). These results indicate that F– can have a limited capacity to balance OSDA charge in zeolite synthesis, opening up a third route to zeolite synthesis intermediate between the fluoride and hydroxide routes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

A Randomization-Based, Zero-Trust Cyberattack Detection Method for Hierarchical Systems

This paper demonstrates a novel randomization-based approach for verifying power system control signals with application to detecting cyberattacks. We consider fully connected hierarchical systems containing multiple local agents and a global "trust" agent. The global agent uses a time-varying randomized assignment scheme to identify corrupt network links based on principles of zero trust and majority rule. To evaluate the performance of this detection approach, we implement our algorithm in MATLAB and run it against nearly 43 million unique attack scenarios spanning a range of system sizes. For each scenario, the algorithm determines whether the identified corruptions satisfy a set of validity constraints reflecting network topology and uses that result to say whether the recovered state value for one or more local agents is malicious. We compare the algorithm's determination to the true state of the system to assess performance and find that classification accuracy converges to 100% as system size increases, suggesting that the validity constraints become more difficult to satisfy for larger systems. We further explore the scenarios that evade detection to understand practical implications for employing this detection approach.

cybersecurity↗