arXiv:2504.15704
On relaxing the N-Reachability Implicit Requirement in NMPC Design
원문 초록
This paper proposes a proof of stability for Model Predictive Control formulations involving a prediction horizon that might be too short to meet the reachability condition generally invoked as a sufficient condition for closed-loop stability. This condition is replaced by a contraction condition on the stage cost. But unlike the contraction based existing formulations where the prediction horizon becomes a decision variable, the formulation proposed in this paper remains standard in that it uses constant and short prediction horizon. An illustrative example is provided to assess the relevance of the proposed formulation.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Conformation-Aware Structure Prediction of Antigen-Recognizing Immune Proteins
Cautious Next Token Prediction
Where, What, Why: Towards Explainable Driver Attention Prediction
Out-of-Distribution Semantic Occupancy Prediction
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
Reconsidering Explicit Longitudinal Mammography Alignment for Enhanced Breast Cancer Risk Prediction
토론
이 논문과 연결된 포럼 글이 아직 없습니다.