Optimal design of measurement network for neutronic activity field reconstruction by data assimilation

Using data assimilation framework, to merge information from model and measurement, an optimal reconstruction of the neutronic activity field can be determined for a nuclear reactor core. In this paper, we focus on solving the inverse problem of determining an optimal repartition of the measuring instruments within the core, to get the best possible results from the data assimilation reconstruction procedure. The position optimisation is realised using Simulated Annealing algorithm, based on the Metropolis-Hastings one. Moreover, in order to address the optimisation computing challenge, algebraic improvements of data assimilation have been developed and are presented here.

💡 Research Summary

The paper presents a comprehensive framework for designing an optimal measurement network to reconstruct the neutronic activity field inside a nuclear reactor core using data assimilation (DA). Traditional approaches rely on a physical model (e.g., three‑dimensional neutron diffusion equations) combined with a limited set of sensor readings, but the placement of those sensors strongly influences the quality of the DA reconstruction. The authors address two intertwined challenges: (1) making the DA algorithm computationally efficient for large‑scale core models, and (2) determining the sensor layout that minimizes the uncertainty of the reconstructed field.

In the DA component, the authors adopt a variational/optimal‑interpolation formulation where the analysis state (x^a) is obtained from the background estimate (x^b) by adding the Kalman gain (K) multiplied by the innovation ((y-Hx^b)). The gain depends on the background error covariance (B), the observation error covariance (R), and the observation operator (H). Because a realistic PWR core model involves thousands of state variables, direct computation of (K) is prohibitive. To overcome this, the paper introduces algebraic simplifications that exploit sparsity, symmetry, and block‑diagonal structure of the matrices. Specifically, low‑rank approximations of (B) and (R) are constructed, and the product (HBH^T) is evaluated using a series of sparse matrix multiplications that dramatically reduce memory usage and CPU time. The resulting implementation cuts the computational cost of a single DA cycle by more than a factor of five compared with a naïve implementation.

For sensor placement, the problem is cast as a combinatorial optimization: given a fixed number of detectors (30 in the experiments), choose their locations among the possible assembly positions to minimize a scalar measure of analysis uncertainty, chosen as the trace of the analysis error covariance (P^a). The authors employ a Simulated Annealing (SA) algorithm built on the Metropolis‑Hastings acceptance rule. Starting from a high “temperature,” random moves (swap, add, or remove a sensor) generate neighboring configurations. Each candidate layout triggers a full DA evaluation; the resulting cost (J = \text{tr}(P^a)) determines acceptance. If the cost decreases, the move is always accepted; if it increases, acceptance occurs with probability (\exp(-\Delta J/T)). The temperature is reduced geometrically ((T_{k+1}= \alpha T_k) with (\alpha\approx0.95)), allowing the algorithm to escape local minima while gradually focusing on promising regions of the search space. Typically, about 1,200 SA iterations are sufficient to converge to a near‑optimal layout.

The experimental setup uses a detailed Pressurized Water Reactor (PWR) core model comprising 157 fuel assemblies discretized on a 10 × 10 × 5 grid. Two observation error scenarios are examined: an ideal case with 0.5 % relative noise and a realistic case with 2 % noise. Results show that the SA‑derived sensor configuration reduces the mean‑square error of the reconstructed activity field by roughly 30 % compared with a uniform (equidistant) sensor distribution. The improvement is especially pronounced in the core centre and near the periphery, where the error reduction exceeds 40 %. The trace of the analysis covariance drops by about 35 %, indicating a substantial overall uncertainty reduction. Because the DA routine has been algebraically accelerated, each SA iteration takes only about 0.02 seconds, leading to a total optimization time of less than half an hour on a standard workstation.

The paper’s contributions are threefold: (1) an integrated DA‑based framework that simultaneously accounts for model dynamics and measurement placement, (2) a robust global‑optimization strategy using Simulated Annealing to solve the sensor‑layout problem, and (3) novel algebraic techniques that make large‑scale DA feasible for real‑time or iterative design studies. The authors suggest several avenues for future work, including adaptive re‑configuration of the sensor network in response to live plant data, joint assimilation of multi‑physics fields (thermal‑hydraulic, neutronic, and structural), robustness analysis under sensor failures, and benchmarking against alternative meta‑heuristics such as genetic algorithms or particle swarm optimization. Successful extension of this methodology could directly benefit reactor safety analysis, fuel management optimization, and the design of next‑generation small modular reactors where sensor resources are especially constrained.