{'fraction_non_alphanumeric': 0.01177536231884058, 'fraction_numerical': 0.0018115942028985507, 'mean_word_length': 5.656626506024097, '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}}
Improvements in computational aspects of interval Kalman filtering enhanced by constraint propagation

This paper deals with computational aspects of interval kalman filtering of discrete time linear models with bounded uncertainties on parameters and gaussian measurement noise. In this work, we consider an extension of conventional Kalman filtering to interval linear models [1]. As the expressions for deriving the Kalman filter involve matrix inversion which is known to be a difficult problem. One must hence find a way to implement or avoid this tricky algebraic operation within an interval framework. To solve the interval matrix inversion problem and other problems due to interval calculus, we propose an original approach combining the set inversion algorithm SIVIA and constraint satisfaction propagation. Several contractors are proposed to limit overestimation effects propagating within the interval Kalman filter recursive structure. Thus the description of our approach is followed by an application and we compare the proposed approach with interval kalman filtering developped in [1].