Cargando…

Robust MPC for polytopic uncertain systems via a high-rate network with the round-robin scheduling

This article is concerned with the robust model predictive control (RMPC) problem for polytopic uncertain systems under the round-robin (RR) scheduling in the high-rate communication channel. From a set of sensors to the controller, several sensors transmit the data to the remote controller via a sh...

Descripción completa

Detalles Bibliográficos
Autores principales: Wang, Jianhua, Wang, Yiling, Wu, Xialai, Ci, Wenyan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: PeerJ Inc. 2023
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10280437/
https://www.ncbi.nlm.nih.gov/pubmed/37346632
http://dx.doi.org/10.7717/peerj-cs.1269
_version_ 1785060794003619840
author Wang, Jianhua
Wang, Yiling
Wu, Xialai
Ci, Wenyan
author_facet Wang, Jianhua
Wang, Yiling
Wu, Xialai
Ci, Wenyan
author_sort Wang, Jianhua
collection PubMed
description This article is concerned with the robust model predictive control (RMPC) problem for polytopic uncertain systems under the round-robin (RR) scheduling in the high-rate communication channel. From a set of sensors to the controller, several sensors transmit the data to the remote controller via a shared high-rate communication network, data collision might happen if these sensors start transmissions at the same time. For the sake of preventing data collision in the high-rate communication channel, a communication scheduling known as RR is used to arrange the data transmission order, where only one node with token is allowed to send data at each transmission instant. In accordance with the token-dependent Lyapunov-like approach, the aim of the problem addressed is to design a set of controllers in the framework of RMPC such that the asymptotical stability of the closed-loop system is guaranteed. By taking the effect of the underlying RR scheduling in the high-rate communication channel into consideration, sufficient conditions are obtained by solving a terminal constraint set of an auxiliary optimization problem. In addition, an algorithm including both off-line and online parts is provided to find a sub-optimal solution. Finally, two simulation examples are used to demonstrate the usefulness and effectiveness of the proposed RMPC strategy.
format Online
Article
Text
id pubmed-10280437
institution National Center for Biotechnology Information
language English
publishDate 2023
publisher PeerJ Inc.
record_format MEDLINE/PubMed
spelling pubmed-102804372023-06-21 Robust MPC for polytopic uncertain systems via a high-rate network with the round-robin scheduling Wang, Jianhua Wang, Yiling Wu, Xialai Ci, Wenyan PeerJ Comput Sci Algorithms and Analysis of Algorithms This article is concerned with the robust model predictive control (RMPC) problem for polytopic uncertain systems under the round-robin (RR) scheduling in the high-rate communication channel. From a set of sensors to the controller, several sensors transmit the data to the remote controller via a shared high-rate communication network, data collision might happen if these sensors start transmissions at the same time. For the sake of preventing data collision in the high-rate communication channel, a communication scheduling known as RR is used to arrange the data transmission order, where only one node with token is allowed to send data at each transmission instant. In accordance with the token-dependent Lyapunov-like approach, the aim of the problem addressed is to design a set of controllers in the framework of RMPC such that the asymptotical stability of the closed-loop system is guaranteed. By taking the effect of the underlying RR scheduling in the high-rate communication channel into consideration, sufficient conditions are obtained by solving a terminal constraint set of an auxiliary optimization problem. In addition, an algorithm including both off-line and online parts is provided to find a sub-optimal solution. Finally, two simulation examples are used to demonstrate the usefulness and effectiveness of the proposed RMPC strategy. PeerJ Inc. 2023-03-10 /pmc/articles/PMC10280437/ /pubmed/37346632 http://dx.doi.org/10.7717/peerj-cs.1269 Text en © 2023 Wang et al. https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited.
spellingShingle Algorithms and Analysis of Algorithms
Wang, Jianhua
Wang, Yiling
Wu, Xialai
Ci, Wenyan
Robust MPC for polytopic uncertain systems via a high-rate network with the round-robin scheduling
title Robust MPC for polytopic uncertain systems via a high-rate network with the round-robin scheduling
title_full Robust MPC for polytopic uncertain systems via a high-rate network with the round-robin scheduling
title_fullStr Robust MPC for polytopic uncertain systems via a high-rate network with the round-robin scheduling
title_full_unstemmed Robust MPC for polytopic uncertain systems via a high-rate network with the round-robin scheduling
title_short Robust MPC for polytopic uncertain systems via a high-rate network with the round-robin scheduling
title_sort robust mpc for polytopic uncertain systems via a high-rate network with the round-robin scheduling
topic Algorithms and Analysis of Algorithms
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10280437/
https://www.ncbi.nlm.nih.gov/pubmed/37346632
http://dx.doi.org/10.7717/peerj-cs.1269
work_keys_str_mv AT wangjianhua robustmpcforpolytopicuncertainsystemsviaahighratenetworkwiththeroundrobinscheduling
AT wangyiling robustmpcforpolytopicuncertainsystemsviaahighratenetworkwiththeroundrobinscheduling
AT wuxialai robustmpcforpolytopicuncertainsystemsviaahighratenetworkwiththeroundrobinscheduling
AT ciwenyan robustmpcforpolytopicuncertainsystemsviaahighratenetworkwiththeroundrobinscheduling