{'fraction_non_alphanumeric': 0.01792573623559539, 'fraction_numerical': 0.0, 'mean_word_length': 5.627118644067797, '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}}
Invariant set analysis for SISO discrete‐time polynomial systems with dynamic quantizers

This paper deals with the stability analysis problem of discrete‐time polynomial systems subject to input quantization. The quantizer under consideration is supposed to be dynamic. Indeed, considering the quantization error as bounded disturbances, the regional input‐to‐state stability is studied. The approach developed consists in characterizing two nested invariant sets where the outer one is a region of attraction and the inner one is the robust invariant set with respect to the quantization error. By defining a performance index between the quantized system and the quantizer‐free system, a quasi‐convex problem is formulated to minimize an upper bound on such a performance index.