{'fraction_non_alphanumeric': 0.012232415902140673, 'fraction_numerical': 0.0, 'mean_word_length': 4.695652173913044, '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}}
Optimal control of a class of linear hybrid systems with saturation

We consider a class of queueing systems that can operate in several modes; in each mode the queue lengths exhibit a linear growth until a specified upper or lower level is reached, after which the queue length stays at that level until the end of the mode. We present some methods to determine the optimal switching time instants that minimize a criterion such as average queue length, worst case queue length, average waiting time, and so on. We show that if there is no upper saturation then for some objective functions the optimal switching scheme can be computed very efficiently.