Observer-Based Event-Triggered Consensus Control of Multi-Agent Systems With Time-Varying Communication Delays
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
This paper addresses a new observer-based asynchronous periodic event-triggered control approach for the consensus of linear multi-agent systems (MASs) to reduce the communication load in both sensor to observer (S-O) and controller to actuator (C-A) channels. In order to tackle the time-varying communication delays of the network, each agent uses a bank of observers to estimate the states of its own and its neighbour(s). First, the consensus of a MAS under periodic transmission and time-varying communication delay is analyzed, and the controller and observer gains are designed in terms of the feasibility of certain linear matrix inequalities (LMIs). Then, by using the emulation approach, the event-triggered consensus control problem is converted into the stability of a time-delay system, and by using Lyapunov-Krasovskii approach, a sufficient condition is derived such that the closed-loop system of all agents is stable and the event-triggering parameters are designed. We demonstrate that all agents’ states and observed states converge asymptotically to an agreement point. To illustrate the efficiency of the proposed strategy, a simulation study is performed, and the results show the efficiency of the observer-based ETC in terms of efficient use of communication resources and lower settling time. We have implemented the proposed method and conducted experiments on a real-world MAS consisting of a group of e-puck2 robots. The experimental results demonstrate the efficacy of the proposed method in achieving consensus while efficiently utilizing communication resources. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —This paper delves into the event-triggered consensus control problem in networked multi-agent systems (MASs), considering time-varying communication delays. The proposed approach holds significant promise for applications in MASs and distributed systems, such as satellite-based communication systems, vehicular networks, swarm robotics, and smart grid control. Since we have considered time-varying delays in both sensor-to-observer and controller-to-actuator channels, this method is applicable in scenarios where the controller and actuator of each agent are physically separated, and sensor and control signals are being transmitted over a network. Moreover, we have significantly reduced the amount of data transmitted over the network through the use of event-triggered control, which is beneficial in applications with limited bandwidth, congested networks, and limited energy supplies. To validate the theoretical results with experimental tests, the proposed method is applied to the a group of robots in the consensus control problem. The same approach can be extended to MASs under more realistic network-induced delays.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,001 | 0,002 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,001 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle