Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > eess > arXiv:2201.02697

Help | Advanced Search

Electrical Engineering and Systems Science > Systems and Control

arXiv:2201.02697 (eess)
[Submitted on 7 Jan 2022 ]

Title: Embedded Model Predictive Control Using Robust Penalty Method

Title: 基于鲁棒惩罚方法的嵌入式模型预测控制

Authors:Abhijith Sharma, Chaitanya Jugade, Shreya Yawalkar, Vaishali Patne, Deepak Ingole, Dayaram Sonawane
Abstract: Model predictive control (MPC) has become a hot cake technology for various applications due to its ability to handle multi-input multi-output systems with physical constraints. The optimization solvers require considerable time, limiting their embedded implementation for real-time control. To overcome the bottleneck of traditional quadratic programming (QP) solvers, this paper proposes a robust penalty method (RPM) to solve an optimization problem in a linear MPC. The main idea of RPM is to solve an unconstrained QP problem using Broyden Fletcher Goldfarb Shannon (BFGS) algorithm. The beauty of this method is that it can find optimal solutions even if initial conditions are in an infeasible region, which makes it robust. Moreover, the RPM is computationally inexpensive as compared to the traditional QP solvers. The proposed RPM is implemented on resource-limited embedded hardware (STM32 microcontroller), and its performance is validated with a case study of a citation aircraft control problem. We show the hardware-in-the-loop co-simulation results of the proposed RPM and compared them with the active set method (ASM) and interior point method (IPM) QP solvers. The performance of MPC with the aforementioned solvers is compared by considering the optimality, time complexity, and ease of hardware implementation. Presented results show that the proposed RPM gives the same optimality as ASM and IPM, and outperforms them in terms of speed.
Abstract: 模型预测控制(MPC)由于其能够处理具有物理约束的多输入多输出系统,已成为各种应用的热门技术。 优化求解器需要大量时间,限制了它们在实时控制中的嵌入式实现。 为了克服传统二次规划(QP)求解器的瓶颈,本文提出了一种鲁棒惩罚方法(RPM),以在线性MPC中解决优化问题。 RPM的主要思想是使用Broyden Fletcher Goldfarb Shannon(BFGS)算法求解无约束QP问题。 这种方法的美妙之处在于,即使初始条件处于不可行区域,它也能找到最优解,这使其具有鲁棒性。 此外,与传统QP求解器相比,RPM计算成本较低。 所提出的RPM在资源有限的嵌入式硬件(STM32微控制器)上实现,并通过一个引用飞机控制问题的案例研究验证了其性能。 我们展示了所提出的RPM的硬件在环联合仿真结果,并将其与活动集方法(ASM)和内点法(IPM)QP求解器进行了比较。 通过考虑最优性、时间复杂性和硬件实现的难易程度,比较了上述求解器的MPC性能。 结果显示,所提出的RPM在最优性方面与ASM和IPM相同,并在速度方面优于它们。
Comments: 7 pages, 4 figures
Subjects: Systems and Control (eess.SY)
Cite as: arXiv:2201.02697 [eess.SY]
  (or arXiv:2201.02697v1 [eess.SY] for this version)
  https://doi.org/10.48550/arXiv.2201.02697
arXiv-issued DOI via DataCite

Submission history

From: Abhijith Sharma Mr [view email]
[v1] Fri, 7 Jan 2022 22:26:56 UTC (612 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
cs.SY
< prev   |   next >
new | recent | 2022-01
Change to browse by:
cs
eess
eess.SY

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号