{"title":"切换间隔的长度如何影响动力系统的稳定性?","authors":"Vladimir Yu. Protasov , Rinat Kamalov","doi":"10.1016/j.automatica.2024.111929","DOIUrl":null,"url":null,"abstract":"<div><div>If a linear switching system with frequent switches is stable, will it be stable under arbitrary switches? In general, the answer is negative. Nevertheless, this question can be answered in an explicit form for any concrete system. This is done by finding the mode-dependent critical lengths of switching intervals after which any enlargement does not influence the stability. The solution is given in terms of the exponential polynomials of least deviation from zero on a segment (“Chebyshev-like” polynomials). By proving several theoretical results on exponential polynomial approximation we derive an algorithm for finding such polynomials and for computing the critical switching time. The convergence of the algorithm is estimated and numerical results are provided.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111929"},"PeriodicalIF":4.8000,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"How do the lengths of switching intervals influence the stability of a dynamical system?\",\"authors\":\"Vladimir Yu. Protasov , Rinat Kamalov\",\"doi\":\"10.1016/j.automatica.2024.111929\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>If a linear switching system with frequent switches is stable, will it be stable under arbitrary switches? In general, the answer is negative. Nevertheless, this question can be answered in an explicit form for any concrete system. This is done by finding the mode-dependent critical lengths of switching intervals after which any enlargement does not influence the stability. The solution is given in terms of the exponential polynomials of least deviation from zero on a segment (“Chebyshev-like” polynomials). By proving several theoretical results on exponential polynomial approximation we derive an algorithm for finding such polynomials and for computing the critical switching time. The convergence of the algorithm is estimated and numerical results are provided.</div></div>\",\"PeriodicalId\":55413,\"journal\":{\"name\":\"Automatica\",\"volume\":\"171 \",\"pages\":\"Article 111929\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2024-10-04\",\"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/S0005109824004230\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automatica","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0005109824004230","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
How do the lengths of switching intervals influence the stability of a dynamical system?
If a linear switching system with frequent switches is stable, will it be stable under arbitrary switches? In general, the answer is negative. Nevertheless, this question can be answered in an explicit form for any concrete system. This is done by finding the mode-dependent critical lengths of switching intervals after which any enlargement does not influence the stability. The solution is given in terms of the exponential polynomials of least deviation from zero on a segment (“Chebyshev-like” polynomials). By proving several theoretical results on exponential polynomial approximation we derive an algorithm for finding such polynomials and for computing the critical switching time. The convergence of the algorithm is estimated and numerical results are provided.
期刊介绍:
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.