Locally convexified rigid tube MPC

This paper proposes a locally convexified rigid tube model predictive control for obstacle avoidance for linear, discrete‐time, systems subject to additive, bounded disturbances and state and control constraints. The inherently nonconvex obstacle avoidance constraints are locally convexified and con...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IET control theory & applications Ročník 17; číslo 4; s. 446 - 462
Hlavní autoři: Sun, Haidi, Zhang, Sixing, Dai, Li, Raković, Saša V.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Stevenage John Wiley & Sons, Inc 01.03.2023
Wiley
Témata:
Algorithms
Chebyshev approximation
Constraints
Convexity
Decomposition
Design
Discrete time systems
Disturbances
Euclidean geometry
Hyperplanes
Integer programming
Linear programming
Methods
Obstacle avoidance
Optimization
Predictive control
Quadratic programming
Robust control
Separation
Systems theory
Theorems
Tubes
ISSN:1751-8644, 1751-8652
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper proposes a locally convexified rigid tube model predictive control for obstacle avoidance for linear, discrete‐time, systems subject to additive, bounded disturbances and state and control constraints. The inherently nonconvex obstacle avoidance constraints are locally convexified and converted into closed polyhedral constraints by deploying recent notions of safe sets and tubes. The proposed method leverages these recent notions of safe sets and tubes to reformulate the original nonconvex optimization problem for obstacle avoidance within the context of disturbances into a computationally highly efficient, strictly convex quadratic programming problem. In order to analyze the separation between a predicted state set and each obstacle avoidance constraint set, we employ the Euclidean distance between these two sets and the radius of the Chebyshev ball of their intersection. In the strict separation case, the separating hyperplanes are constructed by utilizing the separation theorem for convex sets, while in the weak separation case, the construction of separating hyperplanes is achieved through the use of the separation theorem and the properties of convex cones. The proposed method provides guarantees of strong system theoretic properties such as robust recursive feasibility, robust positive invariance and robust stability of the controlled uncertain system. A simulation example is also provided to numerically verify the effectiveness of the proposed method.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1751-8644
1751-8652
DOI:10.1049/cth2.12382