Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational tractability”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

On Computationally Efficient Radiative Transfer Calculations for Three-Dimensional Entry Problems

The current work presents an efficient simulation framework for rigorously modeling radiative fields emanating from non-equilibrium planetary entry flows in complex three-dimensional domains. Key to this endeavor is adoption of finite-volume discretization in lieu of brute-force ray tracing. This change in conjunction with mesh sweeping and Lebedev-type quadrature for angular integration allows spatial-angular resolution of radiative transfer to be performed in a computationally tractable manner. Additionally, a new methodology has been established to build standalone reduced-order spectral databases for non-equilibrium radiative properties that can be applied to a broad range of hypersonic planetary entry problems with minimal loss in accuracy. The efficacy of the new framework has been demonstrated on the atomic nitrogen radiative system. The resulting reduced-order model requires three orders-of-magnitude fewer spectral evaluations and results in a 95% decrease in memory footprint. A comparative study for representative forebody and afterbody lines-of-sight from Stardust, FIRE II, and meteor entries into the Earth atmosphere indicates that both total intensity variation and detailed spectra can be retrieved with as few as 625 reduced-order groups (contrasting with the 100,000 frequencies in the original full set model). Similarly, three-dimensional predictions of radiative heating experienced by the Orion forebody are in excellent agreement with legacy radiation solvers while requiring only a sliver (roughly 0.5%) of computing wall time.

3D radiation↗
NASA NTRS2003

Application of a data-mining method based on Bayesian networks to lesion-deficit analysis

Although lesion-deficit analysis (LDA) has provided extensive information about structure-function associations in the human brain, LDA has suffered from the difficulties inherent to the analysis of spatial data, i.e., there are many more variables than subjects, and data may be difficult to model using standard distributions, such as the normal distribution. We herein describe a Bayesian method for LDA; this method is based on data-mining techniques that employ Bayesian networks to represent structure-function associations. These methods are computationally tractable, and can represent complex, nonlinear structure-function associations. When applied to the evaluation of data obtained from a study of the psychiatric sequelae of traumatic brain injury in children, this method generates a Bayesian network that demonstrates complex, nonlinear associations among lesions in the left caudate, right globus pallidus, right side of the corpus callosum, right caudate, and left thalamus, and subsequent development of attention-deficit hyperactivity disorder, confirming and extending our previous statistical analysis of these data. Furthermore, analysis of simulated data indicates that methods based on Bayesian networks may be more sensitive and specific for detecting associations among categorical variables than methods based on chi-square and Fisher exact statistics.

NASA Discipline Neuroscience↗
NASA NTRSDate not supplied

Adding GPU Support to the Markov Chain Monte Carlo Code Catmip

In geophysics, we are confronted with many under-determined inverse problems. For example, all of our observations of earthquakes are made at the Earth’s surface. So, when we try to infer how slip during an earthquake evolves in space and time, we find that there are many potential slip histories that are consistent with our limited observations and our understanding of earthquake physics. One way to approach these problems is with Bayesian analysis which allows us to infer the ensemble of all potential slip models that satisfy the observations and our prior knowledge of earthquake physics. In Bayesian analysis, our prior knowledge is known as the prior probability density function or prior PDF, the fit to the data is known as the data likelihood, and the target PDF that satisfies both the prior PDF and data likelihood is known as the posterior PDF. However, simulating the posterior PDF typically requires using Markov Chain Monte Carlo (MCMC) to draw tens of billions of random realizations of earthquake slip models, which may not be computationally feasible. To make this and similar geophysical inversions computationally tractable, we developed the Cascading Adaptive Transitional Metropolis In Parallel (CATMIP) algorithm. CATMIP is an efficient parallel Markov Chain Monte Carlo (MCMC) sampler that is used for model fitting and uncertainty quantification in geophysics. Example use cases are earthquake rupture modeling, determining mineral composition on Mars, reconstructing the history of ocean salinity, and historical earthquake relocation. CATMIP employs many parallel instances of the Metropolis algorithm for sampling in a transitioning framework. Transitioning is a process in which a set of random samples at equilibrium with a known probability density function (PDF) are used as seeds for the Markov chains to sample successive target PDFs that incrementally move the distribution from the starting seeds to the final desired PDF that describes the relative plausibility of potential values for the model parameters. The algorithm is implemented as a Master-Worker model employing MPI for communication. The worker processes are loosely coupled with global parameters periodically optimized by the master process. This provides a very high amount of parallelism with little communication between updates. During the presentation we will discuss the history of the algorithm and elaborate the earthquake rupture modeling use case for the CATMIP package. Our first step toward GPU optimization was to optimize the code for the CPU. CPU profiling revealed that most of the compute time is spent in calls to level 2 BLAS routines and calls to GSL random number generators. We revised the algorithm to employ level 3 BLAS routines instead. In our presentation we will describe how this was accomplished. Adding GPU support to CATMIP consisted mostly of replacing the calls to GSL with calls to GPU vendor-provided library routines. A small number of loops were directly implemented in CUDA. In the presentation will provide implementation details. Finally, we will discuss methods for profiling and opportunities for further optimizing GPU execution. By creating a code with the flexibility to run on either a CPU or GPU architecture, CATMIP can be used on systems ranging from large CPU-based HPC environments to single servers with GPU acceleration and everything in between.

HECC↗
NASA NTRS2001

Suppression of Soot Formation and Shapes of Laminar Jet Diffusion Flames

Laminar nonpremixed (diffusion) flames are of interest because they provide model flame systems that are far more tractable for analysis and experiments than practical turbulent flames. In addition, many properties of laminar diffusion flames are directly relevant to turbulent diffusion flames using laminar flamelet concepts. Finally, laminar diffusion flame shapes have been of interest since the classical study of Burke and Schumann because they involve a simple nonintrusive measurement that is convenient for evaluating flame shape predictions. Motivated by these observations, the shapes of round hydrocarbon-fueled laminar jet diffusion flames were considered, emphasizing conditions where effects of buoyancy are small because most practical flames are not buoyant. Earlier studies of shapes of hydrocarbon-fueled nonbuoyant laminar jet diffusion flames considered combustion in still air and have shown that flames at the laminar smoke point are roughly twice as long as corresponding soot-free (blue) flames and have developed simple ways to estimate their shapes. Corresponding studies of hydrocarbon-fueled weakly-buoyant laminar jet diffusion flames in coflowing air have also been reported. These studies were limited to soot-containing flames at laminar smoke point conditions and also developed simple ways to estimate their shapes but the behavior of corresponding soot-free flames has not been addressed. This is unfortunate because ways of selecting flame flow properties to reduce soot concentrations are of great interest; in addition, soot-free flames are fundamentally important because they are much more computationally tractable than corresponding soot-containing flames. Thus, the objectives of the present investigation were to observe the shapes of weakly-buoyant laminar jet diffusion flames at both soot-free and smoke point conditions and to use the results to evaluate simplified flame shape models. The present discussion is brief.

Xu, F.↗
DOE OSTI2022

Methods for Translating ReEDS Solutions to Production Cost Modeling Tools

Capacity expansion modeling tools are increasingly being utilized to investigate a wide range of potential future scenarios, particularly with high penetrations of variable and energy-constrained resources that may be operated differently than current dispatch paradigms. While capacity expansion models are particularly adept at making investment decisions for future years, they must make compromises in operational aspects to maintain computational tractability. However, it is of high interest to determine if such future systems would be able to maintain reliability during a variety of grid conditions, and to identify any potential operational challenges for these systems at finer temporal resolution than is typically captured in CEMs. As such, there is value in having an automated tool that can convert many CEM investment pathways into inputs for a more detailed production cost model, in this case the PLEXOS commercial software package. This paper describes the methodology used to make that translation for the NREL-developed ReEDS model, making use of two internally developed tools - PIDG and beetle - along with a set of processing scripts. We describe the current assumptions, data sets, and important operational characteristics of these translations along with an example of the extended analyses that may be done through this connection.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

Monitoring and prediction of porosity in laser powder bed fusion using physics-informed meltpool signatures and machine learning

In this work we accomplished the monitoring and prediction of porosity in laser powder bed fusion (LPBF) additive manufacturing process. This objective was realized by extracting physics-informed meltpool signatures from an in-situ dual-wavelength imaging pyrometer, and subsequently, analyzing these signatures via computationally tractable machine learning approaches. Porosity in LPBF occurs despite extensive optimization of processing conditions due to stochastic causes. Hence, it is essential to continually monitor the process with in-situ sensors for detecting and mitigating incipient pore formation. In this work a tall cuboid-shaped part (10 mm × 10 mm × 137 mm, material ATI 718Plus) was built with controlled porosity by varying laser power and scanning speed. This test caused various types of porosity, such as lack-of-fusion and keyhole formation, with varying degrees of severity in the part. The meltpool was continuously monitored using a dual-wavelength imaging pyrometer installed in the machine. Physically intuitive process signatures, such as meltpool length, temperature distribution, and ejecta (spatter) characteristics, were extracted from the meltpool images. Subsequently, relatively simple machine learning models, e.g., K-Nearest Neighbors, were trained to predict both the severity and type of porosity as a function of these physics-informed meltpool signatures. These models resulted in a prediction accuracy exceeding 95% (statistical F1-score). The same analysis was carried out with a complex, black-box deep learning convolutional neural network which directly used the meltpool images instead of physics-informed features. The convolutional neural network produced a comparable F1-score in the range of 89–97%. Finally, these results demonstrate that using pragmatic, physics-informed meltpool signatures within a simple machine learning model is as effective for flaw prediction in LPBF as using a complex and computationally demanding black-box deep learning model.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows

The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-off solution quality for computational tractability. Among the various heuristics, a common strategy is problem decomposition, that is, the reduction of a large-scale problem into a collection of smaller sub-problems, with spatial and temporal decompositions being two natural approaches. While spatial decomposition has been successful in certain settings, effective temporal decomposition has been challenging due to the difficulty of stitching together the sub-problem solutions across the decomposition boundaries. In this work, we introduce a novel temporal decomposition scheme for solving a class of PDPTWs that have narrow time windows, for which it is able to provide both fast and high-quality solutions. We utilize techniques that have been popularized recently in the context of online dial-a-ride problems along with the general idea of rolling horizon optimization. To the best of our knowledge, this is the first attempt to solve offline PDPTWs using such an approach. To show the performance and scalability of our framework, we use the optimization of paratransit services as a motivating example. Due to the lack of benchmark solvers similar to ours (i.e., temporal decomposition with an online solver), we compare our results with an offline heuristic algorithm using Google OR-Tools. In smaller problem instances (with an average of 129 requests per instance), the baseline approach is as competitive as our framework. However, in larger problem instances (approximately 2,500 requests per instance), our framework is more scalable and can provide good solutions to problem instances of varying degrees of difficulty, while the baseline algorithm often fails to find a feasible solution within comparable compute times.

Kim, Youngseo↗
DOE OSTI2024

Super Resolving Unrolled Neural Networks for Remote Sensing

In remote sensing systems, the capabilities of the system are constrained by the complex interactions between size, weight, and power (SWAP) of potential designs. In electro-optical (EO) systems, examples of these critical parameters include the system’s sensitivity and resolution. Those parameters can be increased by ever larger optical apertures and focal planes but at the cost of more SWAP. Multi-image super resolution (MISR) techniques allow resolution to be enhanced via computation rather than more sophisticated optical hardware. These algorithms combine multiple images together into a single, higher resolution image, trading temporal resolution and computation for spatial resolution. Fielded MISR techniques, such as Drizzle, can require several hundred images to create a single super resolved image, implying reduced temporal resolution, increased data acquisition load, and limiting mission applications. Iterative techniques, such as model-based image reconstruction and compressive sensing, have been shown to create super resolved images using fewer images than Drizzle. They do this by posing an optimization problem that balances accuracy between a highly accurate physical model and an image model. In the case of super resolution, the physical model is defined by the relation between low resolution input images and the desired high resolution output image. The image model encodes some assumptions about the super resolved image. These assumptions are meant to suppress reconstruction artifacts that arise due to deterministic physical model error, stochastic measurement noise, and potential undersampling. In practice, the performance of iterative methods are limited by imaging models compatible with optimization. Deep learning-based methods can effectively learn image models of arbitrary complexity, but lack the theoretical explainability and robustness of iterative techniques. Consensus equilibrium (CE) generalizes the iterative techniques beyond optimization, enabling blackbox algorithms such as traditional and neural image denoisers to be used as the image model. CE-based approaches retain much of the explainability and robustness of iterative techniques while allowing the expressiveness of machine learning image models to be used. Additionally, by unrolling iterations of CE with an embedded image denoiser, the image denoiser can be further trained and specialized to the specific application with potentially higher quality reconstructions. Under this project, we demonstrated the feasibility of training an unrolled neural network based upon CE. While we didn’t train one, we showed that the CE process is differentiable and its gradient can be tractably computed. We also explored the usage of a variants of CE akin to generative neural works. Most importantly, we applied the CE framework to a number of problems including non-blind deconvolution, upsampling, single-image super resolution, MISR, event-based sensing, and saturated deconvolution. Our MISR prototype creates high quality reconstructions with an order of magnitude fewer images than previous approaches and, critically, produces these reconstructions fast enough for practical usage.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Lax-Oleinik-Type Formulas and Efficient Algorithms for Certain High-Dimensional Optimal Control Problems

Two of the main challenges in optimal control are solving problems with state-dependent running costs and developing efficient numerical solvers that are computationally tractable in high dimension. In this paper, we provide analytical solutions to certain optimal control problems whose running cost depends on the state variable and with constraints on the control. We also provide Lax-Oleinik-type representation formulas for the corresponding Hamilton-Jacobi partial differential equations with state-dependent Hamiltonians. Additionally, we present an efficient, grid-free numerical solver based on our representation formulas, which is shown to scale linearly with the state dimension, and thus, to overcome the curse of dimensionality. Using existing optimization methods and the min-plus technique, we extend our numerical solvers to address more general classes of convex and nonconvex initial costs. We demonstrate the capabilities of our numerical solvers using implementations on a central processing unit (CPU) and a field-programmable gate array (FPGA). In several cases, our FPGA implementation obtains over a 10 times speedup compared to the CPU, which demonstrates the promising performance boosts FPGAs can achieve. Furthermore, our numerical results show that our solvers have the potential to serve as a building block for solving broader classes of high-dimensional optimal control problems in real-time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Multidimensional Distributional Neural Network Output Demonstrated in Super‐Resolution of Surface Wind Speed

Accurate quantification of uncertainty in neural network predictions remains a central challenge for scientific applications involving high-dimensional, correlated data. While existing methods capture either aleatoric or epistemic uncertainty, few offer closed-form, multidimensional distributions that preserve spatial correlation while remaining computationally tractable. In this work, we present a framework for training neural networks with a multidimensional Gaussian loss, generating a closed-form predictive distribution over outputs informed by non-identically distributed training data. Our approach captures aleatoric uncertainty by iteratively estimating the means and covariance matrices, and is demonstrated on a super-resolution example out-of-training-sample. We leverage a Fourier representation of the covariance matrix to stabilize network training and preserve spatial correlation. We introduce a novel regularization strategy—referred to as information sharing—that interpolates between image-specific and global covariance estimates, enabling convergence of the super-resolution downscaling network trained on image-specific distributional loss functions. This framework allows for efficient sampling, explicit correlation modeling, and extensions to more complex distribution families all without disrupting prediction performance. We demonstrate the method on a surface wind speed downscaling task and discuss its broader applicability to uncertainty-aware prediction in scientific models.

17 WIND ENERGY↗
DOE OSTI2025

An Assessment of the Error Due to Computing Waste Isolation Pilot Plant Porosity Using the Porosity Response Surface Approach

The Waste Isolation Pilot Plant Performance Assessment (WIPP PA) must predict the likelihood that radionuclides will escape into the biosphere via mechanisms that depend on geohydraulic flow. Ideally, one would predict the geohydraulic flow using coupled geohydraulic and geomechanical simulations, but such coupled simulations are not computationally tractable. Instead, Sandia has historically used a look-up table of porosities for a given fluid pressure and time, called the porosity response surface, but this approach can introduce porosity errors because it largely ignores the porosity’s dependence on the past fluid pressure history. This report discusses efforts to quantify these porosity errors for both the legacy and new porosity response surfaces. Six hundred different fluid pressure histories were fed through the legacy/new geomechanical model and the legacy/new porosity response surface to generate six hundred porosity error histories. The error associated with the legacy porosity surface was substantial, while the error associated with the new porosity surface was typically small, except when fluid pressures exceeded the lithostatic pressure at the repository. In response to the errors at high pressures, a preliminary study of the WIPP PA’s sensitivity to these porosity errors was conducted. The study found that reducing the porosity errors at high pressures negligibly affected predictions of radionuclide releases. Finally, an initial machine-learned model for porosity was developed. This ML model significantly reduced the porosity error at high pressures, but sizable errors remained, so more development is necessary before coupling an ML model to the geohydraulic model.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2022

Application of an equation‐oriented framework to formulate and estimate parameters of chemical looping reaction models

Abstract Accurate, predictive reaction models are critical for the design and optimization of chemical looping combustion (CLC) reactors. The formulation and estimation of kinetic parameters for these reaction models using a first‐principles equation‐oriented (EO) approach is particularly beneficial as large amounts of experimental data spanning process‐relevant conditions can be used to estimate parameters in a computationally tractable way. This work demonstrates the application of a novel EO framework to develop reduction reaction kinetic models of an iron‐based CLC oxygen carrier (OC). An optimization problem is formulated to estimate kinetic parameters that provide the best fit to the experimental data. The model predicts the state of the OC with mean square error values of 2.5%–4.4% across the full range of validation data, including multiple reduction cycles.

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

Modeling Flexible Generator Operating Regions via Chance- constrained Stochastic Unit Commitment

Here, we introduce a novel chance-constrained stochastic unit commitment model to address uncertainty in renewables' production uncertainty in power systems operation. For most thermal generators,underlying technical constraints that are universally treated as "hard" by deterministic unit commitment models are in fact based on engineering judgments, such that system operators can periodically request operation outside these limits in non-nominal situations, e.g., to ensure reliability. We incorporate this practical consideration into a chance-constrained stochastic unit commitment model, specifically by in-frequently allowing minor deviations from the minimum and maximum thermal generator power output levels. We demonstrate that an extensive form of our model is computationally tractable for medium-sized power systems given modest numbers of scenarios for renewables' production. We show that the model is able to potentially save significant annual production costs by allowing infrequent and controlled violation of the traditionally hard bounds imposed on thermal generator production limits. Finally, we conduct a sensitivity analysis of optimal solutions to our model under two restricted regimes and observe similar qualitative results.

42 ENGINEERING↗
DOE OSTI2023

Incorporation of market signals for the optimal design of post combustion carbon capture systems

Recent studies have shown that fossil generators equipped with post-combustion carbon capture (PCC) systems are needed to reduce the cost of deep decarbonization. Such generators need to be flexible and responsive to grid conditions, particularly in a high variable renewable energy (VRE) environment. In this work, we evaluate the net present value (NPV) of retrofitting an existing natural gas combined cycle (NGCC) unit with a flexible PCC system while incorporating market signals from a high VRE grid. We use our industrial partner’s NGCC configuration as representative of existing NGCC units and Svante’s rapid-temperature swing adsorption (TSA) for PCC. Because of its ability to rapidly startup/shutdown and ramp-up/ramp-down, the chosen capture technology is very attractive for load-following operations. For a given set of market signals, we formulate a two-stage stochastic multi-period optimization problem, under the price-taker assumption, to simultaneously optimize the design of the capture system and operation of the entire plant. Rigorous models for the NGCC unit, PCC system, and compression system are developed using commercial process simulators and validated with either plant or vendor data. For computational tractability, we develop surrogate/reduced-order models for use in the optimization problem. The surrogate model for the NGCC plant is constructed by linearizing the rigorous dynamic model at 75% load, while data-driven nonlinear surrogate models for the capture and compression systems are constructed using simulation data from the rigorous models. The optimization problem, formulated as a mixed integer bilinear program, is implemented in the IDAES® integrated platform and solved to global optimality using Gurobi 9.5. Using this formulation, we determine the profitability of retrofitting an existing NGCC unit with the chosen capture system for multiple regions in the U.S. under two scenarios with different carbon prices. Importantly, the results show that the optimal decision strongly depends on the region and on the carbon price, thereby demonstrating the importance of the inclusion of market signals in the design process.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2020

Integration of graphical approaches into optimization-based design of multistage liquid extraction

We propose two optimization models for designing two liquid extraction systems: simple multistage liquid extractors and extractors with extract reflux. Both models are motivated by the concepts of the modified McCabe-Thiele graphical method for multistage extractor design. The operating and equilibrium curves in the McCabe-Thiele method are represented by material balances and piece-wise linearized thermodynamics properties. The use of piece-wise approximations improves computational tractability of both optimization models. In addition, we consider some extensions such as dilute systems, insoluble solvents, and non-ideal stages. In conclusion, the applicability of the proposed models is demonstrated with four illustrative examples.

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

Optimal sizing of battery energy storage systems for peak shaving and demand response using a degradation-aware Bayesian Optimization-Mixed-Integer Linear Programming framework

The increasing integration of renewable energy and rising electricity demand highlight the importance of battery energy storage systems for peak shaving and demand response. Unlike prior approaches that overlook operational impacts on degradation, this study proposes a Bayesian Optimization–Mixed Integer Linear Programming framework for optimal battery energy storage system sizing. In this framework, Mixed Integer Linear Programming determines short-term scheduling while a calibrated electrochemical model iteratively evaluates degradation. The central hypothesis is that the framework can efficiently identify optimal sizes that yield realistic and economically robust outcomes. The method is tested across three scenarios: peak shaving, peak shaving with energy-reduction demand response, and peak shaving with power-reduction demand response. Results show that the framework converge to the optimum within 20 iterations out of 150 possible sizes. Under baseline conditions, the framework consistently selects the smallest feasible system, minimizing unnecessary degradation costs from oversized storage. Sensitivity analyses reveal that larger systems are favored as demand rates or incentives increase. Comparisons of demand response programs indicate that power-reduction demand response offers greater economic benefits than energy-reduction demand response, although demand savings from peak shaving remain the dominant contributor to overall performance. This study demonstrates that the proposed framework balances computational tractability with degradation fidelity, identifies critical economic thresholds for investment, and offers a practical, flexible tool to guide industrial stakeholders in cost-effective battery energy storage system deployment.

Batteries↗
DOE OSTI2024

A data-driven sensor placement approach for detecting voltage violations in distribution systems

Stochastic fluctuations in power injections from distributed energy resources (DERs) combined with load variability can cause constraint violations (e.g., exceeded voltage limits) in electric distribution systems. To monitor grid operations, sensors are placed to measure important quantities such as the voltage magnitudes. Here, in this paper, we consider a sensor placement problem which seeks to identify locations for installing sensors that can capture all possible violations of voltage magnitude limits. We formulate a bilevel optimization problem that minimizes the number of sensors and avoids false sensor alarms in the upper level while ensuring detection of any voltage violations in the lower level. This problem is challenging due to the nonlinearity of the power flow equations and the presence of binary variables. Accordingly, we employ recently developed conservative linear approximations of the power flow equations that overestimate or underestimate the voltage magnitudes. By replacing the nonlinear power flow equations with conservative linear approximations, we can ensure that the resulting sensor locations and thresholds are sufficient to identify any constraint violations. Additionally, we apply various problem reformulations to significantly improve computational tractability while simultaneously ensuring an appropriate placement of sensors. Lastly, we improve the quality of the results via an approximate gradient descent method that adjusts the sensor thresholds. We demonstrate the effectiveness of our proposed method for several test cases, including a system with multiple switching configurations.

24 POWER TRANSMISSION AND DISTRIBUTION↗