Abstract
AbstractThe discrete-time bipartite consensus problem under signed network with saturation constraints is investigated. With the information of neighbors, a distributed control protocol is given. By the properties of the signed digraph, a model transformation is given. With the help of model transformation, the discrete bipartite consensus issue is converted into a discrete stability issue. By the Lyapunov stability theory, the discrete stability issues of the corresponding system are demonstrated. Through numerical simulation examples, we prove the validity of our results.KeywordsDiscrete-timeUndirected graphBipartite consensusSaturation constraintsSigned networkStructural balance
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
