Back to Search
Start Over
Finite-Time Connectivity-Preserving Consensus of Networked Nonlinear Agents With Unknown Lipschitz Terms.
- Source :
-
IEEE Transactions on Automatic Control . Jun2016, Vol. 61 Issue 6, p1700-1705. 6p. - Publication Year :
- 2016
-
Abstract
- This technical note studies finite-time consensus problem for a team of networked nonlinear agents with unknown Lipschitz terms under communication constraints, where each agent has a limited sensing range. Because the induced interaction graph is typically state-dependent and dynamic, we propose a distributed nonlinear consensus algorithm that is capable of preserving the initial interaction patterns. By using tools from nonsmooth analysis, sufficient conditions are obtained such that finite-time consensus can be reached. An upper bound of the convergence time is derived via a two-step analysis. The validity of the theoretical result is shown by one simulation example. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189286
- Volume :
- 61
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Automatic Control
- Publication Type :
- Periodical
- Accession number :
- 115795772
- Full Text :
- https://doi.org/10.1109/TAC.2015.2479926