0 Datasets
0 Files
Get instant academic access to this publication’s datasets.
Yes. After verification, you can browse and download datasets at no cost. Some premium assets may require author approval.
Files are stored on encrypted storage. Access is restricted to verified users and all downloads are logged.
Yes, message the author after sign-up to request supplementary files or replication code.
Join 50,000+ researchers worldwide. Get instant access to peer-reviewed datasets, advanced analytics, and global collaboration tools.
✓ Immediate verification • ✓ Free institutional access • ✓ Global collaborationJoin our academic network to download verified datasets and collaborate with researchers worldwide.
Get Free AccessThis paper investigates the problem of network-based leader-following consensus of nonlinear multi-agent systems via distributed impulsive control. First, by taking network-induced delays into account, a nonlinear system with delayed impulses is formulated. Then, a general consensus criterion is derived and several special cases of network-induced delays and network topologies are discussed. Moreover, sufficient conditions on the design of the sampling period, pinned nodes and the coupling strength are provided. The effects of the coupling strength and pinning strategy are further explored for multi-agent systems with an undirected communication graph. Finally, two examples are given to verify the theoretical results.
Wangli He, Guanrong Chen, Qing‐Long Han, Feng Qian (2015). Network-based leader-following consensus of nonlinear multi-agent systems via distributed impulsive control. Information Sciences, 380, pp. 145-158, DOI: 10.1016/j.ins.2015.06.005.
Datasets shared by verified academics with rich metadata and previews.
Authors choose access levels; downloads are logged for transparency.
Students and faculty get instant access after verification.
Type
Article
Year
2015
Authors
4
Datasets
0
Total Files
0
Language
English
Journal
Information Sciences
DOI
10.1016/j.ins.2015.06.005
Access datasets from 50,000+ researchers worldwide with institutional verification.
Get Free Access
