{'fraction_non_alphanumeric': 0.019538188277087035, 'fraction_numerical': 0.0, 'mean_word_length': 5.668639053254438, '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}}
On prediction strategies in stochastic MPC

The optimization of predicted control policies in Model Predictive Control (MPC) enables the use of information on future disturbance inputs which, although unknown at current time, will be known at a future point on the prediction horizon. However, optimization over feedback laws can be prohibitively computationally expensive. The so-called affine-in-the-disturbance strategies provide a compromise, and this paper considers the use of disturbance compensation in the context of stochastic MPC. Unlike earlier approaches, compensation is applied over the entire horizon, thereby leading to a significant constraint relaxation which makes more control authority available for the optimization of performance. In addition, our compensation has a striped lower triangular dependence on the uncertainty, on account of which the relevant gains can be obtained sequentially, thereby reducing computational complexity. Further reduction in computation is afforded by computing these feedback gains offline. Simulations show this can be achieved at a modest cost in terms of performance.