{'fraction_non_alphanumeric': 0.023706896551724137, 'fraction_numerical': 0.004310344827586207, 'mean_word_length': 5.319727891156463, '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}}
Robust non‐minimal order filter and smoother design for discrete‐time uncertain systems

This paper is concerned with the design of robust non‐minimal order H∞ filters for uncertain discrete‐time linear systems. The uncertainty is assumed to be time‐invariant and to belong to a polytope. The novelty is that a convex filtering design procedure with Linear Matrix Inequality constraints is proposed to synthesize guaranteed‐cost filters with order greater than the order of the system. An H∞‐norm bound for the transfer‐function from the system input to the filtering error is adopted as performance criterion. The non‐minimal order filters proposed generalize other existing filters with augmented structures from the literature and can provide better performance. An extension to the problem of robust smoothing is proposed as well. The procedure is illustrated by a numerical example. Copyright © 2016 John Wiley & Sons, Ltd.