{'fraction_non_alphanumeric': 0.012165450121654502, 'fraction_numerical': 0.0, 'mean_word_length': 5.480314960629921, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The Infinite-Dimensional Optimal Filtering Problem with Mobile and Stationary Sensor Networks

In this article, we introduce a framework to address filtering and smoothing with mobile sensor networks for distributed parameter systems. The main problem is formulated as the minimization of a functional involving the trace of the solution of a Riccati integral equation with constraints given by the trajectory of the sensor network. We prove existence and develop approximation of the solution to the Riccati equation in certain trace-class spaces. We also consider the corresponding optimization problem. Finally, we employ a Galerkin approximation scheme and implement a descent algorithm to compute optimal trajectories of the sensor network. Numerical examples are given for both stationary and moving sensor networks.