Abstract
SummaryThis paper investigates circle formation problem of multiagent systems over a kind of strongly connected and weight‐unbalanced directed graphs. To solve the concerned problem, decentralized periodic event‐triggered algorithms subject to or not to time delays are proposed, which have the advantages of decreasing the overall burden of the network in terms of finite communication and control input updates. In such algorithms, each agent independently evaluates whether the locally sampled information of itself should be broadcasted to or not to its neighbors. Furthermore, another advantage of our proposed algorithms is to automatically exclude Zeno behavior, which should be seriously considered in a variety of event‐based network systems. Sufficient conditions on circle formation control are derived under which the states of all agents can be ensured to converge to some desired equilibrium point. Simulation results are given to validate the effectiveness of the proposed methods.
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 callMore From: International Journal of Robust and Nonlinear Control
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
