Abstract
This paper considers consensus strategy design for double-integrator multi-agent systems with matched disturbances under a directed graph. Specifically, we consider the case where both the control inputs and velocities of the agents are subject to different and asymmetric constraints. A novel distributed algorithm exploiting saturation functions is proposed to achieve asymptotic consensus without violating the predefined velocity and actuator saturation constraints. Subsequently, we extend the obtained results to event-triggered communication, where agent position broadcasting occurs only when specific triggering conditions are met. We rigorously prove that there exists a positive minimum inter-event time to rule out Zeno behavior. Finally, the simulation results confirm the theoretical findings and illustrate the achievable performance.
| Original language | English |
|---|---|
| Article number | 111860 |
| Journal | Automatica |
| Volume | 170 |
| DOIs | |
| State | Published - Dec 2024 |
Keywords
- Consensus
- Directed graph
- Multi-agent system
- Velocity constraint
Fingerprint
Dive into the research topics of 'Consensus algorithms for double-integrator dynamics with different velocity and actuator saturation constraints'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver