Abstract
This paper studies the bipartite consensus problem for a network of wave PDEs. The interactions among participating individuals may be antagonistic characterized by a signed digraph. Two distributed algorithms consisting of boundary sensing of the agents’ states are proposed for the disturbance-free and disturbed cases, respectively. Then Lyapunov function is constructed to assure bipartite consensus of the agents. Moreover, the relationship between control gain and communication topology is also explicitly revealed. Using the tool from semigroup theory, the property of well-posedness of the underlying systems is guaranteed. Finally, numerical examples are given to support the proposed setup.
Sign-in/Register to access full text options 
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
