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:2212.00361

Help | Advanced Search

Electrical Engineering and Systems Science > Systems and Control

arXiv:2212.00361 (eess)
[Submitted on 1 Dec 2022 ]

Title: Predictive Control with Learning-Based Terminal Costs Using Approximate Value Iteration

Title: 基于学习的终端成本预测控制使用近似值迭代

Authors:Francisco Moreno-Mora, Lukas Beckenbach, Stefan Streif
Abstract: Stability under model predictive control (MPC) schemes is frequently ensured by terminal ingredients. Employing a (control) Lyapunov function as the terminal cost constitutes a common choice. Learning-based methods may be used to construct the terminal cost by relating it to, for instance, an infinite-horizon optimal control problem in which the optimal cost is a Lyapunov function. Value iteration, an approximate dynamic programming (ADP) approach, refers to one particular cost approximation technique. In this work, we merge the results of terminally unconstrained predictive control and approximate value iteration to draw benefits from both fields. A prediction horizon is derived in dependence on different factors such as approximation-related errors to render the closed-loop asymptotically stable further allowing a suboptimality estimate in comparison to an infinite horizon optimal cost. The result extends recent studies on predictive control with ADP-based terminal costs, not requiring a local initial stabilizing controller. We compare this controller in simulation with other terminal cost options to show that the proposed approach leads to a shorter minimal horizon in comparison to previous results.
Abstract: 模型预测控制(MPC)方案下的稳定性通常通过终端成分来保证。采用(控制)李雅普诺夫函数作为终端成本是一种常见选择。基于学习的方法可以用来通过将其与无限时域最优控制问题联系起来构建终端成本,在这种情况下,最优成本是一个李雅普诺夫函数。值迭代是一种近似动态规划(ADP)方法,指的是特定的成本近似技术。在这项工作中,我们将终端无约束预测控制的结果和近似值迭代结合起来,以从这两个领域中获得好处。根据不同的因素(如与逼近相关的误差)推导出预测时域,以使闭环渐近稳定,并允许与无限时域最优成本相比的次优性估计。该结果扩展了最近关于具有基于ADP终端成本的预测控制的研究,且不需要局部初始稳定控制器。我们在仿真中将此控制器与其他终端成本选项进行比较,以表明所提出的方法比先前的结果能实现更短的最小时域。
Subjects: Systems and Control (eess.SY) ; Optimization and Control (math.OC)
MSC classes: 93B45
Cite as: arXiv:2212.00361 [eess.SY]
  (or arXiv:2212.00361v1 [eess.SY] for this version)
  https://doi.org/10.48550/arXiv.2212.00361
arXiv-issued DOI via DataCite

Submission history

From: Francisco Moreno-Mora [view email]
[v1] Thu, 1 Dec 2022 08:42:19 UTC (343 KB)
Full-text links:

Access Paper:

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

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号