Current Time 0:00
/
Duration Time 0:00
Progress: NaN%
Playback Rate
1.00x

Polyhedral feasible set computation of MPC-based optimal control problems

Research Square

Research Square

  • First Author :
    Lantao Xie
  • Co-authors :
    Lei Xie ; Hongye Su ; Jingdai Wang
  • Journal Name :
    IEEE Explore
  • Read Full text :
  • DOI :
    10.1109/JAS.2018.7511126

Share This Video

Abstract

Feasible sets play an important role in model predictive control (MPC) optimal control problems (OCPs). This paper proposes a multi-parametric programming-based algorithm to compute the feasible set for OCP derived from MPC-based algorithms involving both spectrahedron (represented by linear matrix inequalities) and polyhedral (represented by a set of inequalities) constraints. According to the geometrical meaning of the inner product of vectors, the maximum length of the projection vector from the feasible set to a unit spherical coordinates vector is computed and the optimal solution has been proved to be one of the vertices of the feasible set. After computing the vertices, the convex hull of these vertices is determined which equals the feasible set. The simulation results show that the proposed method is especially efficient for low dimensional feasible set computation and avoids the non-unicity problem of optimizers as well as the memory consumption problem that encountered by projection algorithms.

Ask Questions 0

Please Login or Register to add your question

Recommended Videos

No recommendation found