Journal
INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL
Volume 28, Issue 18, Pages 6146-6162Publisher
WILEY
DOI: 10.1002/rnc.4364
Keywords
multiagent system; sign-consensus; signed graph; switching topology
Funding
- National Natural Science Foundation of China [61773322, 61433011]
- Research Grants Council, University Grants Committee [CityU 111613, CityU 11200415]
Ask authors/readers for more resources
This paper studies sign consensus, a collective behavior of multiagent systems, when both cooperative and antagonistic interactions coexist among agents. By sign consensus, it means that the states of all agents will eventually achieve the same sign but may with different magnitudes. Compared with some recent works on sign-consensus problems, where only fixed graphs are considered and the graph adjacency matrix needs to be eventually positive, this paper allows the graph to be switching over time. Control laws are proposed and analyzed with respect to three classes of switching graphs. Examples illustrate the efficacy of the control algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available