Journal
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
Volume 50, Issue 7, Pages 2541-2550Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSMC.2018.2821181
Keywords
Uncertainty; Robustness; Multi-agent systems; Control systems; Protocols; Topology; Bipartite consensus; bipartite tracking; matching uncertainty; robustness; signed graph
Funding
- National Natural Science Foundation of China [61473005, 61403406, U1713223, 11332001]
- Beijing Nova Program [2018047]
Ask authors/readers for more resources
This paper is concerned with general coopetition networks with signed graphs, based on which both the bipartite consensus and tracking control problems for networked systems subject to nonidentical matching uncertainties are studied. For the case of undirected and connected communication graphs, we propose a distributed discontinuous nonlinear controller which can achieve the bipartite consensus. To cancel the chattering phenomenon of the discontinuous controller, a continuous one is designed by using the boundary layer technique, under which the bipartite consensus error is shown to be uniformly ultimately bounded and can exponentially converge to a small adjustable bounded set. Further, considering the case of a leader having a bounded control action, we present a continuous controller to guarantee the ultimate boundedness of the bipartite tracking error.
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