Abstract
In this paper, we consider group consensus problem by giving a kind of new protocol in which communication graph weights are all nonnegative. This is also consistent with classic protocols. The sufficient conditions which group consensus under this kind of protocols can reach for both single and second order multi-agent system are obtained. Finally, numerical examples are given to illustrate our theoretical results.
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have