arXiv Analytics

Sign in

arXiv:2305.08712 [math.OC]AbstractReferencesReviewsResources

Model Predictive Control with Reach-avoid Analysis

Dejin Ren, Wanli Lu, Jidong Lv, Lijun Zhang, Bai Xue

Published 2023-05-15Version 1

In this paper we investigate the optimal controller synthesis problem, so that the system under the controller can reach a specified target set while satisfying given constraints. Existing model predictive control (MPC) methods learn from a set of discrete states visited by previous (sub-)optimized trajectories and thus result in computationally expensive mixed-integer nonlinear optimization. In this paper a novel MPC method is proposed based on reach-avoid analysis to solve the controller synthesis problem iteratively. The reach-avoid analysis is concerned with computing a reach-avoid set which is a set of initial states such that the system can reach the target set successfully. It not only provides terminal constraints, which ensure feasibility of MPC, but also expands discrete states in existing methods into a continuous set (i.e., reach-avoid sets) and thus leads to nonlinear optimization which is more computationally tractable online due to the absence of integer variables. Finally, we evaluate the proposed method and make comparisons with state-of-the-art ones based on several examples.

Related articles: Most relevant | Search more
arXiv:2103.12681 [math.OC] (Published 2021-03-23)
A Distributed Active Set Method for Model Predictive Control
arXiv:2210.15798 [math.OC] (Published 2022-10-27)
Model Predictive Control of Spreading Processes via Sparse Resource Allocation
arXiv:2109.07075 [math.OC] (Published 2021-09-15)
Guarding a Target Set from a Single Attacker in the Euclidean Space