A generalized projection estimation algorithm

IF 4.8 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Automatica Pub Date : 2024-10-02 DOI:10.1016/j.automatica.2024.111942
Patrizio Tomei, Riccardo Marino
{"title":"A generalized projection estimation algorithm","authors":"Patrizio Tomei,&nbsp;Riccardo Marino","doi":"10.1016/j.automatica.2024.111942","DOIUrl":null,"url":null,"abstract":"<div><div>Given a linear regression model in discrete-time containing a vector of <span><math><mi>p</mi></math></span> constant uncertain parameters, this paper addresses the problem of designing an exponentially convergent parameter estimation algorithm, even when the regressor vector is not persistently exciting (not even in a finite time interval). On the basis of the definition of lack of persistency of excitation of order <span><math><mi>q</mi></math></span> for the regressor vector, <span><math><mrow><mn>0</mn><mo>≤</mo><mi>q</mi><mo>≤</mo><mi>p</mi></mrow></math></span> (which coincides with the classical definition of persistency of excitation when <span><math><mrow><mi>q</mi><mo>=</mo><mn>0</mn></mrow></math></span>), a generalized projection estimation algorithm is proposed which guarantees global exponential convergence of the parameter estimation error and allows for the on-line computation of the order <span><math><mi>q</mi></math></span> of the lack of persistency of excitation. When the lack of persistency of excitation is of order zero, global exponential convergence to zero of the parameter estimation error is obtained, recovering a well-known result and the projection estimation algorithm as a special case.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8000,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automatica","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0005109824004369","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Given a linear regression model in discrete-time containing a vector of p constant uncertain parameters, this paper addresses the problem of designing an exponentially convergent parameter estimation algorithm, even when the regressor vector is not persistently exciting (not even in a finite time interval). On the basis of the definition of lack of persistency of excitation of order q for the regressor vector, 0qp (which coincides with the classical definition of persistency of excitation when q=0), a generalized projection estimation algorithm is proposed which guarantees global exponential convergence of the parameter estimation error and allows for the on-line computation of the order q of the lack of persistency of excitation. When the lack of persistency of excitation is of order zero, global exponential convergence to zero of the parameter estimation error is obtained, recovering a well-known result and the projection estimation algorithm as a special case.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通用投影估算算法
给定一个离散时间线性回归模型,其中包含 p 个常数不确定参数矢量,本文要解决的问题是设计一种指数收敛的参数估计算法,即使在回归矢量没有持续激励(甚至在有限时间间隔内也没有)的情况下也是如此。根据对回归矢量的 q 阶缺乏持续激励的定义 0≤q≤p(这与 q=0 时激励持续性的经典定义相吻合),提出了一种广义投影估计算法,它能保证参数估计误差的全局指数收敛,并允许在线计算缺乏持续激励的 q 阶。当激励持续性不足的阶数为零时,参数估计误差会全局指数收敛为零,这恢复了一个众所周知的结果,投影估计算法是一个特例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Automatica
Automatica 工程技术-工程:电子与电气
CiteScore
10.70
自引率
7.80%
发文量
617
审稿时长
5 months
期刊介绍: Automatica is a leading archival publication in the field of systems and control. The field encompasses today a broad set of areas and topics, and is thriving not only within itself but also in terms of its impact on other fields, such as communications, computers, biology, energy and economics. Since its inception in 1963, Automatica has kept abreast with the evolution of the field over the years, and has emerged as a leading publication driving the trends in the field. After being founded in 1963, Automatica became a journal of the International Federation of Automatic Control (IFAC) in 1969. It features a characteristic blend of theoretical and applied papers of archival, lasting value, reporting cutting edge research results by authors across the globe. It features articles in distinct categories, including regular, brief and survey papers, technical communiqués, correspondence items, as well as reviews on published books of interest to the readership. It occasionally publishes special issues on emerging new topics or established mature topics of interest to a broad audience. Automatica solicits original high-quality contributions in all the categories listed above, and in all areas of systems and control interpreted in a broad sense and evolving constantly. They may be submitted directly to a subject editor or to the Editor-in-Chief if not sure about the subject area. Editorial procedures in place assure careful, fair, and prompt handling of all submitted articles. Accepted papers appear in the journal in the shortest time feasible given production time constraints.
期刊最新文献
Predict globally, correct locally: Parallel-in-time optimization of neural networks Set-based value operators for non-stationary and uncertain Markov decision processes Successive over relaxation for model-free LQR control of discrete-time Markov jump systems Nonuniqueness and convergence to equivalent solutions in observer-based inverse reinforcement learning Asymmetrical vulnerability of heterogeneous multi-agent systems under false-data injection attacks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1