Achieving distributed consensus for networked uncertain Euler–Lagrange systems with average dwell time approach

5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes a novel distributed consensus achieving algorithm for switched networked Lagrange systems with uncertain parameters, in order to solve the abruptly occurrence problem of parameters changing and communication topologies switching. We first model the multirobot systems as switched networked Lagrange systems. Then, by introducing the network topology into the sliding mode vector, a unified distributed consensus tracking strategy is then proposed by systematically combining the average dwell time (ADT) approach and adaptive control method. Besides, a sufficient condition regarding the ADT among subsystems is derived to ensure the asymptotical consensus performance of the multirobot systems. A unified analysis methodology is developed to perform the convergence analysis for the closed-loop system by Lyapunov stable theory. Finally, illustrative examples and simulations are provided to demonstrate and validate the theoretical results.

Cite

CITATION STYLE

APA

Liu, L., Liu, W., Li, Y., Liu, S., Guo, R., & Li, B. (2024). Achieving distributed consensus for networked uncertain Euler–Lagrange systems with average dwell time approach. Asian Journal of Control, 26(2), 657–667. https://doi.org/10.1002/asjc.3068

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free