Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm testing”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Classical Simulation of Boson Sampling Based on Graph Structure

Boson sampling is a fundamentally and practically important task that can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In this Letter, we present classical sampling algorithms for single-photon and Gaussian input states that take advantage of a graph structure of a linear-optical circuit. The algorithms’ complexity grows as so-called treewidth, which is closely related to the connectivity of a given linear-optical circuit. Using the algorithms, we study approximated simulations for local Haar-random linear-optical circuits. For equally spaced initial sources, we show that, when the circuit depth is less than the quadratic in the lattice spacing, the efficient simulation is possible with an exponentially small error. Notably, right after this depth, photons start to interfere each other and the algorithms’ complexity becomes subexponential in the number of sources, implying that there is a sharp transition of its complexity. Finally, when a circuit is sufficiently deep enough for photons to typically propagate to all modes, the complexity becomes exponential as generic sampling algorithms. We numerically implement a likelihood test with a recent Gaussian boson sampling experiment and show that the treewidth-based algorithm with a limited treewidth renders a larger likelihood than the experimental data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Extended Low Load Boiler Operation to Improve Performance and Economics of an Existing Coal Fired Power Plant (Final Report)

The overall goal is to improve the performance and economics of existing coal fired power plants by extending low load boiler operation to lower loads than is currently achievable. The objective of this program is to develop and validate sensor hardware and analytical algorithms to lower plant operating expenses (OPEX) for the currently operating pulverized coal utility boiler fleet. Coal fired utility boilers are increasingly under grid dispatch pressure. In some cases, the coal fired cost of generation is noncompetitive with respect to natural gas generation and subsidized renewable sources. To remain profitable and remain fully compliant with existing environmental regulations, the installed coal fired fleet must find technologies which allow it to move into a more flexible cyclic load dispatch model. Today the installed coal fired utility fleet must be cost of generation competitive, fully emissions compliant, and responsive to the variability inherent in renewable energy generation sources. In the Phase I of the project, GE Steam Power, Inc. (GE) performed modeling of different operating scenarios for low load operation using an existing full plant dynamic model developed for a 660MW steam power plant. Sensors and analytic algorithms to enable a stable and steady coal supply for low load pulverizer operation were identified and tested at the Pulverizer Development Facility (PDF) at GE’s Clean Energy Center in Bloomfield, Connecticut. Sensors and analytic algorithms to enable stable combustion for low load operation were identified and tested at the 15 MWth Industrial Scale Burner facility (ISBF) at GE’s Clean Energy Center. A concept was developed to test the sensors and control algorithms, down selected after testing, at a full-scale coal fired power plant. A budget estimate was then developed, and the concept was implemented at an existing utility power plant. The specific objectives of the experimental work were to: • Identify and select sensors and analytic algorithms for monitoring coal pulverizer operation at lower loads to provide stable operation and appropriate coal fineness at lower coal throughput; Identify and select sensors and analytic algorithms for a Boiler Flame Stability Monitor to better balance air and fuel at each burner. This enables a reduction in a coal boiler’s safe low load power level while maintaining stable flame characteristics; Develop a concept in Phase I for low load operation of a full-scale power plant and develop a budget estimate for testing and execute the test plan at an existing plant in Phase II; Validate the capability of the extended low load boiler system to extend the minimum load operating point in a safe and reliable manner on an existing full-scale utility boiler. At the completion of this experimental study, GE has developed a set of sensors and analytic algorithms, down selected after testing, that have the potential to enable safe low load operation of a utility boiler. GE has also identified a host site for testing these identified sensors and analytic algorithms. GE has generated a full set of deliverables that provide sufficient information to proceed with the next step of testing at a host site. This includes a potential host site and budget estimate for concept testing at host site. In the Phase II of the project, a series of field tests were completed to validate the extended low load boiler operation, which consisted of detailed engineering, installation, commissioning, and testing the additional sensors and analytics for the coal-fired combustion system on an existing full-scale utility boiler. The optimization work has been supported by the host plant and endorsed by their engineering and operation staff.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2024

(Doublon) Benchmarking of Different Inverse Point Kinetics Implementations for an Autocorrected Reactimeter Algorithm

In November 2017, the Transient Reactor Test Facility returned to operation. Since that time, many transient test series have been completed, such as the Transient Heatsink Overpower Response capsule (THOR), the Transient Water Irradiation System for TREAT (TWIST), and Sirius. Each has provided valuable data for materials performance and reactor safety that can be applied in future designs. During each experimental series, detector count rates provided important information on the core behavior during transients. However, a limitation of these data is that variations in the neutron distribution during experiments can cause errors when attempting to infer reactivity evolution from detector signals. Neutron physics codes can be used to compute the flux shape variations. However, this is a poor solution when the experimental data is used for code verification, validation and uncertainty quantification. Indeed, if the output of the code is used both as a reference and to correct what the reference is compared to, the circular dependency limits the quality of the verification, validation and uncertainty quantification approach. To overcome this problem, the autocorrected reactimeter algorithm (ACRA) has been developed. This approach infers a time-dependent reactivity evolution by testing different spatial corrections and selecting the one that minimizes reactivity variations when the core is in a frozen configuration (i.e., when there is no variation in parameters affecting reactivity). However, the scope of this method was limited to transients where there were negligible thermal feedback. Indeed, the core is never in a frozen configuration when the fuel temperature varies during the whole transient. This is our motivation for developing an improved version of the ACRA that does not require frozen configurations. To develop this new algorithm, we need a precise and unbiased implementation of the inverse point kinetic equations (IPKEs) as any error in the reactivity evaluation will be propagated into the choice of the optimal spatial correction. Indeed, the previous reactimeter algorithm would use approximations, such as a negligible flux amplitude derivative, to focus on rapidity. For the numerical validation of ACRA, we aim at absolute error under for reactivity derived from signals similar to the one of this study. In this summary, we test eight different IPKE implementations. Each will process a mockup signal built for this study, similar to those that the future ACRA will process. Each reactivity output will be compared to the reference reactivity that has been used to generate the mockup signal. The implementation minimizing the difference with the reference reactivity will be used in the development of a new ACRA formulation.

73 - NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Chimera Events for Performance Studies of the MicroBooNE Deep Learning-based Low Energy Excess Search

MicroBooNE is a short baseline neutrino oscillation experiment based at Fermilab that employs Liquid Argon Time Projection Chamber (LArTPC) technology. One of its target measurements is to investigate the nature of the excess of low energy electron-like events observed by MiniBooNE. This measurement will require an excellent understanding of systematic uncertainties, obtained through testing the performance of reconstruction algorithms on samples with known properties. However, using exclusively Monte Carlo events for this task is limited by how well the discrepancies between simulation and data are understood. An alternative is to test against samples of “chimera” events, which are made up of separate single-particle components from data that are combined to create neutrino-like events. These chimera events can be used to help quantify systematic uncertainties. This note covers the performance and status of creating and using chimera events that match a target neutrino topology in MicroBooNE.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Post-extreme-event restoration using linear topological constraints and DER scheduling to enhance distribution system resilience

In this paper, a post-extreme-event restoration (PEER) algorithm is proposed to improve distribution system resilience. Linear topological constraints are proposed to ensure radial topology after N-k contingencies, possibly in multiple islands. The approach is made comprehensive by considering dispatchable distributed energy resources (DERs), non-dispatchable DERs, and demand responses, as well as on-load tap changers (OLTCs) and shunt capacitors. The goal is to minimize the accumulative expense caused by load reduction payment or penalty, as well as DER operation cost. As a result, the overall system will survive longer with higher resilience during an extreme event. To verify the effectiveness of the PEER algorithm, we proposed a resilience evaluation algorithm using Monte Carlo simulation (MCS) with reduced scenarios. This is based on a probabilistic model for generating random scenarios which consider the uncertainty of line faults and solar irradiance. Combined with the proposed PEER algorithm, this reduced-scenario MCS can evaluate the expected energy not served (EENS) which is an essential index for distribution system resilience. Case studies of the IEEE 33-bus and 123-bus test systems validate the proposed algorithm in reducing EENS.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Detection and Characterization of Intrusions to Network Parameter Data in Electric Power Systems

Combating cyberattacks is an emerging challenge in maintaining the reliable and economic operation of electric power systems. Possible cyberattacks include intrusions to the parameter data at a control center. In this class of attacks, algorithms at the control center are correctly executed, but the attacker's modification of the associated parameter data yields improper results. This paper proposes an algorithm for detecting and characterizing cyberattacks to network parameter data, with specific application to optimal power flow problems. The proposed algorithm evaluates whether historical operating point data are consistent with the network parameters. Inconsistencies indicating potential cyberattacks are characterized using historical operational data (power injections and voltage phasors) along with network parameter data. Simulated test cases illustrate the proposed algorithm's detection and characterization capabilities.

cybersecurity↗
DOE OSTI2024

Benchmarking of Different Inverse Point Kinetics Implementations for an Autocorrected Reactimeter Algorithm

In November 2017, the Transient Reactor Test Facility returned to operation. Since that time, many transient test series have been completed; each has provided valuable data for materials performance, reactor safety that can be applied in future designs. During each experimental series, detector count rates provided important information on the core behavior during transients. However, a limitation of these data is that variations in the neutron distribution during experiments cause errors when attempting to infer reactivity evolution from detector signals. Neutron physics codes can be used to compute the flux shape variations. However, this is a poor solution when the experimental data is used to do verification, validation and uncertainty quantification (VVUQ) on codes. Indeed, if the output of the code is used both as a reference and to correct what the reference is compared to, the circular dependency limits the quality of the VVUQ approach. To overcome this problem, an Autocorrected Reactimeter Algorithm (ACRA) has been developed. This approach infers time-dependent reactivity evolution by testing different spatial corrections and selecting the one that minimizes reactivity variations when the core is in a frozen configuration (i.e. when there is no variation in parameters affecting reactivity). However, the scope of this method was limited to transients where there were negligible thermal feedback. Indeed, the core is never in a frozen configuration when the fuel temperature varies during the whole transient. This is our motivation for the development of an improved version of the ACRA which does not require frozen configurations

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Multi-Federate Co-Convergence with HELICS

In co-simulation studies, convergence refers to the ability of different simulation tools involved to achieve a consistent and stable solution. Convergence is a critical aspect of co-simulation as it determines the accuracy of the results obtained from the simulation. Convergence in co-simulation studies depends on several factors, this includes system complexity, the accuracy of the models used, and the numerical methods employed by the simulation tools. It is essential to ensure that the coupling interfaces between the different tools are designed to allow for data exchange in a consistent and accurate manner. Hierarchical Engine for Large-scale Infrastructure Co-Simulation (HELICS) is an open-source co-simulation framework developed for the energy domain. This paper explores the convergence performance of a set of co-simulation use cases. We further explore the use of a co-convergence helper federate to help with co-simulation convergence. The convergence efficacy of several algorithms (both gradient-based and gradient-free) is tested against these use cases. Finally, the sensitivity of these algorithms to several factors, such as system scaling and others, is tested and detailed in this paper. Our results show that for a subset of use cases, the co-convergence helper federate is able to improve co-simulation convergence significantly.

co-convergence↗
DOE OSTI2024

Analyzing Prospects for Quantum Advantage in Topological Data Analysis

Lloyd [Nat. Commun. , 10138 (2016)] were first to demonstrate the promise of quantum algorithms for computing Betti numbers, a way to characterize topological features of data sets. Here, we propose, analyze, and optimize an improved quantum algorithm for topological data analysis (TDA) with reduced scaling, including a method for preparing Dicke states based on inequality testing, a more efficient amplitude estimation algorithm using Kaiser windows, and an optimal implementation of eigenvalue projectors based on Chebyshev polynomials. We compile our approach to a fault-tolerant gate set and estimate constant factors in the Toffoli complexity. Our analysis reveals that superquadratic quantum speedups are only possible for this problem when targeting a multiplicative error approximation and the Betti number grows asymptotically. Further, we propose a dequantization of the quantum TDA algorithm that shows that having exponentially large dimension and Betti number are necessary, but insufficient conditions, for superpolynomial advantage. We then introduce and analyze specific problem examples which have parameters in the regime where superpolynomial advantages may be achieved, and argue that quantum circuits with tens of billions of Toffoli gates can solve seemingly classically intractable instances. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Automated Identification of Characteristic Droplet Size Distributions in Stratocumulus Clouds Utilizing a Data Clustering Algorithm

Abstract Droplet-level interactions in clouds are often parameterized by a modified gamma fitted to a “global” droplet size distribution. Do “local” droplet size distributions of relevance to microphysical processes look like these average distributions? This paper describes an algorithm to search and classify characteristic size distributions within a cloud. The approach combines hypothesis testing, specifically, the Kolmogorov–Smirnov (KS) test, and a widely used class of machine learning algorithms for identifying clusters of samples with similar properties: density-based spatial clustering of applications with noise (DBSCAN) is used as the specific example for illustration. The two-sample KS test does not presume any specific distribution, is parameter free, and avoids biases from binning. Importantly, the number of clusters is not an input parameter of the DBSCAN-type algorithms but is independently determined in an unsupervised fashion. As implemented, it works on an abstract space from the KS test results, and hence spatial correlation is not required for a cluster. The method is explored using data obtained from the Holographic Detector for Clouds (HOLODEC) deployed during the Aerosol and Cloud Experiments in the Eastern North Atlantic (ACE-ENA) field campaign. The algorithm identifies evidence of the existence of clusters of nearly identical local size distributions. It is found that cloud segments have as few as one and as many as seven characteristic size distributions. To validate the algorithm’s robustness, it is tested on a synthetic dataset and successfully identifies the predefined distributions at plausible noise levels. The algorithm is general and is expected to be useful in other applications, such as remote sensing of cloud and rain properties. Significance Statement A typical cloud can have billions of drops spread over tens or hundreds of kilometers in space. Keeping track of the sizes, positions, and interactions of all of these droplets is impractical, and, as such, information about the relative abundance of large and small drops is typically quantified with a “size distribution.” Droplets in a cloud interact locally, however, so this work is motivated by the question of whether the cloud droplet size distribution is different in different parts of a cloud. A new method, based on hypothesis testing and machine learning, determines how many different size distributions are contained in a given cloud. This is important because the size distribution describes processes such as cloud droplet growth and light transmission through clouds.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Using dorsal surface for individual identification of dairy calves through 3D deep learning algorithms

Advances in machine learning techniques have allowed the development of computer vision systems (CVS) that can accurately predict several phenotypes of interest for livestock operations. In this context, 3D images taken from a top-down view are particularly useful for estimating body condition score, growth development, and body biometrics in cattle. Frequently, such CVS rely on identification (ID) systems, such as electronic tags, as a way to match animal ID and the predicted phenotype. However, the same 3D images used to predict body weight and other animal biometrics could be adopted for animal recognition as well. Such alternative would optimize CVS to recognize animal ID and monitor growth development simultaneously while leveraging the same hardware infrastructure. Furthermore, this strategy could be used to recognize animals with similar color patterns. Nonetheless, growing animals are continuously changing body shape, which could limit its use as an invariant feature for pattern recognition. Thus, the objectives of this study were: (1) to compare algorithms for different 3D object representations to identify individual animals; and (2) to evaluate how short-term changes in body shape due to animal growth affect the predictive performance of these algorithms. For objective 1, the algorithms were trained (n = 4,558) and tested (n = 1,139) using images from 38 Holstein calves. For objective 2, we designed three different experiments using images (n = 2,347) from five Holstein calves taken over six weeks during their growing period, always training and testing on different weeks. Each experiment evaluated how changing a different parameter of the image capturing procedure affected the predictive ability of the trained algorithms. In the first experiment, we varied the total number of images per animal in the training set; in the second experiment, we varied the number of weeks while keeping a fixed number of images in the training set; and in the third experiment, we skipped weeks between images in the training and test sets. The F 1 score for objective (1) was up to 0.804 when testing with the last frames of each video, and up to 0.959 when using random frames for testing. For objective (2), the F 1 score was up to 0.947 for the first experiment when using 130 images per animal; up to 0.979 for the second experiment when using all five weeks; and up to 0.917 when not skipping weeks between training and testing. In conclusion, these results show that deep learning algorithms can be used to identify individual animals through their dorsal area 3D surfaces, and, from our experiments using calves in their growing period, that they are robust enough to account for changes in body shape and size, making them a promising tool for animal recognition during growth.

3D neural networks↗
DOE OSTI2021

Quantum-classical hybrid algorithm for the simulation of all-electron correlation

While chemical systems containing hundreds to thousands of electrons remain beyond the reach of quantum devices, hybrid quantum-classical algorithms present a promising pathway toward a quantum advantage. Hybrid algorithms treat the exponentially scaling part of the calculation-the static correlation-on the quantum computer and the non-exponentially scaling part-the dynamic correlation-on the classical computer. While a variety of algorithms have been proposed, the dependence of many methods on the total wave function limits the development of easy-to-use classical post-processing implementations. Here, we present a novel combination of quantum and classical algorithms, which computes the all-electron energy of a strongly correlated molecular system on the classical computer from the 2-electron reduced density matrix (2-RDM) evaluated on the quantum device. Significantly, we circumvent the wave function in the all-electron calculations by using density matrix methods that only require input of the statically correlated 2-RDM. Although the algorithm is completely general, we test it with two classical density matrix methods, the anti-Hermitian contracted Schrödinger equation (ACSE) and multiconfiguration pair-density functional theories, using the recently developed quantum ACSE method for simulating the statically correlated 2-RDM. Furthermore, we obtain experimental accuracy for the relative energies of all three benzyne isomers and thereby demonstrate the ability of the developed algorithm to achieve chemically relevant and accurate results on noisy intermediate-scale quantum devices.

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

Pressure-Based Inversion and Data Assimilation System (PIDAS) for CO 2 Leakage Detection (Final Report)

This project aims to develop a Pressure-based Inversion and Data Assimilation System (PIDAS) for detecting CO 2 leakage from storage formations. Carbon capture, utilization, and sequestration (CCUS) has the potential to enable deep reductions in global carbon emissions if high storage efficiency can be achieved. A major hurdle to industrial-scale implementation of geological carbon sequestration (GCS) projects is the potential migration of fluids (either brine or injected CO 2 ) from the storage formations and the resulting legal and financial liabilities. The capability to accurately identify leakage pathways by which stored CO 2 could leak, has leaked, or is leaking from the targeted storage zone is thus of paramount importance to site licensees and regulators. Although many MVA techniques have been devised, pressure-based monitoring technology remains the most sensitive and reliable technique for early detection. Pressure-based monitoring has consistently received the highest score in terms of benefit/cost ratio and it provides the greatest potential for leakage detection with broad areal coverage. Under this project we have (a) demonstrated the utility of the proposed well testing technique for leakage detection through integrated theoretical and numerical analysis, laboratory experiments, and field tests; (b) developed effective data analysis and inversion algorithms for identifying leakage pathways by fusing data generated during well testing; (c) provided a designing tool for maximizing the utility of the developed PIDAS tool for early leakage detection.

02 PETROLEUM↗
DOE OSTI2022

An Immersed Finite Element Lagrangian-Eulerian Code-Coupling Framework

This report presents an assessment of immersed Eulerian-Lagrangian code-coupling techniques suitable for use in a broad range of mechanics applications. The coupling algorithm is based on an immersed finite element method that considers the Lagrangian and Eulerian overlap regions in the overall variational formulation. In this report the basic formulation details are presented followed by various aspects of the code-coupling algorithm using OpenIFEM as the Lagrangian/coupling framework. A series of representative test cases that illustrate the code-coupling algorithm are discussed. The current work provides an in-depth investigation into the immersed finite element method for the purposes of providing a rigorous coupling technique that is minimally invasive in the respective Eulerian and Lagrangian codes. A number of extensions to the base immersed finite element method have been examined. These extension include nodal and quadrature-based indicator functions, a Lagrangian volume-fraction calculation in regions of overlap, and the use of penalty constraints between the Lagrangian and Eulerian domains. A unique MPI-based coupling strategy that retains the independent MPI structure of each code has been demonstrated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Hardware-in-the-Loop Experimental Testbed Using Air Conditioners for Grid Balancing

Driven by the need to offset the variability of renewable generation on the grid, development of load control is a highly active field of research. However, practical use of residential loads for grid balancing remains rare, in part due to the cost of communicating with large numbers of small loads and also the limited experimentation done so far to demonstrate reliable operation. To establish a basis for the safe and reliable use of fleets of compressor loads as distributed energy resources, we constructed an experimental testbed in a laboratory, so that load coordination schemes could be tested at extreme conditions. Here, this experimental testbed was used to tune a simulation testbed to which it was then linked, thereby augmenting the effective size of the fleet. Modeling of the system was done both to demonstrate the experimental testbed's behavior and also to understand how to tune the behavior of each load. Implementing this testbed has enabled rapid turnaround of experiments on various load control algorithms, and year-round testing without the constraints and limitations arising in seasonal field tests with real houses. Experimental results show the practical feasibility of an ensemble of small loads contributing to grid balancing.

Air Conditioners↗
DOE OSTI2019

Design and Construction of a 1/15th Scale Wave Tank Model of the Azura Commercial Wave Energy Converter

The design of a 1/15th geometrically scaled wave tank model of the Azura(TM) commercial-scale wave energy device is presented. The objectives of the wave tank tests, conducted at the University of Maine Harlod Alfond Wind/Wave Ocean Engineering Lab (W2), included verification of the Azura's energy capture in irregular waves, evaluation of performance in survival wave conditions, and testing of two advanced control algorithms. Due to the difficulty in properly Froude Scaling a hydraulic system, the model used a direct-drive rotary motor/generator power take-off (PTO), with the dynamics of the hydraulic PTO included via a hardware-in-the-loop simulation. This PTO implementation led to additional design requirements being imposed on the model drivetrain. In addition to the model PTO design, the instrumentation design, structural design, and test plans are presented. The resulting model and PTO achieved a high level of controllability, and accurately emulated the dynamics of the hydraulic PTO of the full-scale Azura prototype.

16 TIDAL AND WAVE POWER↗
DOE OSTI2025

A Comparison of Machine Learning Methods of Association Tested on Dense Nodal Arrays

The association of phase picks to form events is one of the fundamental components of seismology. Large and dense sensor networks, such as >1000 geophone arrays (and distributed acoustic sensing), offer unique challenges in association due to the vast numbers of observations and high likelihood of errant picks. In addition, the large number of stations can greatly increase the time it takes to perform the association. For this reason, machine learning (ML) methods might provide a more optimal method of association for such networks. In this work, we examine how well ML methods (e.g., Gaussian mixture model association, PhaseLink, and Graph Earthquake Neural Interpretation Engine) can incorporate dense seismic arrays into regional networks and how well they handle the increasing numbers of stations. Here, we test their capabilities on two dense seismic deployments, one within Rock Valley Nevada (52 nodes and a 9-station sparse local network), and the LArge-n Seismic Survey in Oklahoma dense nodal array (>1800 vertical-component geophones). Processing data from these two different styles of dense seismic deployments allows testing of how the ML algorithms can merge array data with a broader regional network, how they deal with poorly picked phases, and how they handle anthropogenic noise. We compare the ML-associated bulletins to those obtained using the Rapid Earthquake Association and Location algorithm, a more traditional method of association. We find that there are very small differences in results between the methods for small networks (<100 stations) with low pick rates. For large networks (>1000), there are enough errant picks that some of the ML methods start to create false events out of noise. We also find that the ML methods vary in computation time significantly but are all faster than the traditional method tested here.

58 GEOSCIENCES↗
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↗