Abstract

In this article, we study the consensus problem in the framework of networked multiagent systems with constraint where there exists antagonistic information. A major difficulty is how to characterize the communication among the interacting agents in the presence of antagonistic information without resorting to the signed graph theory, which plays a central role in the Altafini model. It is shown that the proposed control protocol enables us to solve the consensus problem in a node-based viewpoint where both cooperative and antagonistic interactions coexist. Moreover, the proposed setup is further extended to the case of input saturation, leading to the semiglobal consensus. In addition, the consensus region associated with antagonistic information among participating individuals is also elaborated. Finally, the deduced theoretical results are applied to the task distribution problem via unmanned ground vehicles.

Full Text
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

Schedule a call