{'fraction_non_alphanumeric': 0.010638297872340425, 'fraction_numerical': 0.0, 'mean_word_length': 5.633802816901408, '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}}
Controllability of LTI switching systems using nonnegative inputs

This paper investigates controllability of linear time invariant (LTI) switching systems using nonnegative inputs pointing to the relevant structures of the problem. The paper gives some algebraic conditions that guarantees global controllability for this class of systems. It is shown that if the system is globally controllable then the number of necessary switchings to control the system is bounded.