Semi-Proximal ADMM for Model Predictive Control Problem with Application to a UAV System

Zilong Cheng, Jun Ma, Xiaoxue Zhang, Tong-heng Lee
{"title":"Semi-Proximal ADMM for Model Predictive Control Problem with Application to a UAV System","authors":"Zilong Cheng, Jun Ma, Xiaoxue Zhang, Tong-heng Lee","doi":"10.23919/ICCAS50221.2020.9268217","DOIUrl":null,"url":null,"abstract":"A lasso model predictive control (MPC) problem solved by the alternative direction method of multipliers (ADMM) is investigated in this work. More specifically, a semi-proximal ADMM algorithm with Gauss-Seidel iterations is proposed to solve the lasso MPC problem with singular weighting matrices. It is well-known that the interior-point algorithm is an effective and efficient algorithm, which is commonly used to obtain the real-time solution to the MPC optimization problem. However, when the weighting matrices of the lasso MPC problem are singular, it is extremely challenging to solve the optimization problem by using the classical interior-point algorithm. In fact, in some special cases, the interior-point algorithm is entirely infeasible for solving the aforementioned problems. In the work here, our developments reveal that the proposed optimization methodology (a semi-proximal ADMM algorithm with Gauss-Seidel iterations) is much more advantageous compared to the interior-point algorithm in some specific cases, especially in the case where singular weighting matrices exist in the cost function. An MPC based tracking problem of an unmanned aerial vehicle (UAV) system is implemented to compare the performance of the proposed algorithm to the performance of the existing solver. The simulation result shows that with the proposed algorithm, higher accuracy and computational efficiency can be realized.","PeriodicalId":6732,"journal":{"name":"2020 20th International Conference on Control, Automation and Systems (ICCAS)","volume":"108 1","pages":"82-87"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 20th International Conference on Control, Automation and Systems (ICCAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ICCAS50221.2020.9268217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

A lasso model predictive control (MPC) problem solved by the alternative direction method of multipliers (ADMM) is investigated in this work. More specifically, a semi-proximal ADMM algorithm with Gauss-Seidel iterations is proposed to solve the lasso MPC problem with singular weighting matrices. It is well-known that the interior-point algorithm is an effective and efficient algorithm, which is commonly used to obtain the real-time solution to the MPC optimization problem. However, when the weighting matrices of the lasso MPC problem are singular, it is extremely challenging to solve the optimization problem by using the classical interior-point algorithm. In fact, in some special cases, the interior-point algorithm is entirely infeasible for solving the aforementioned problems. In the work here, our developments reveal that the proposed optimization methodology (a semi-proximal ADMM algorithm with Gauss-Seidel iterations) is much more advantageous compared to the interior-point algorithm in some specific cases, especially in the case where singular weighting matrices exist in the cost function. An MPC based tracking problem of an unmanned aerial vehicle (UAV) system is implemented to compare the performance of the proposed algorithm to the performance of the existing solver. The simulation result shows that with the proposed algorithm, higher accuracy and computational efficiency can be realized.
模型预测控制问题的半近端ADMM及其在无人机系统中的应用
研究了用乘法器的可选方向方法求解套索模型预测控制问题。针对具有奇异权矩阵的lasso MPC问题,提出了一种具有高斯-塞德尔迭代的半近端ADMM算法。众所周知,内点算法是一种有效且高效的算法,通常用于MPC优化问题的实时求解。然而,当lasso MPC问题的权重矩阵为奇异矩阵时,使用经典的内点算法求解优化问题是极具挑战性的。事实上,在某些特殊情况下,内点算法对于解决上述问题是完全不可行的。在这里的工作中,我们的发展表明,在某些特定情况下,特别是在成本函数中存在奇异加权矩阵的情况下,所提出的优化方法(具有高斯-塞德尔迭代的半近端ADMM算法)比内点算法更有优势。以一个基于MPC的无人机系统跟踪问题为例,将所提算法与现有求解器的性能进行了比较。仿真结果表明,该算法可以实现更高的精度和计算效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信