Abstract
AbstractIn this brief we propose a distributed δ-consensus protocol in directed networks of dynamic agents having communication delays. We provide convergence analysis for such consensus algorithm under stochastic switching communication graphs, and then present some generic criteria for solving the average consensus problem. We also show that directed delayed networks of dynamic agents can achieve average consensus even each agent in the networks intermittently exchanges the information from its neighbors only at some discontinuous moments. Subsequently, a typical numerical example illustrates and visualizes the effectiveness and feasibility of the theoretical results.
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 callDisclaimer: 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.
