Abstract
The consensus problem for multi-agent systems with quantized communication or sensing is considered. Centralized and distributed self-triggered rules are proposed to reduce the overall need of communication and system updates. It is proved that these self-triggered rules realize consensus exponentially if the network topologies have a spanning tree and the quantization function is uniform. Numerical simulations are provided to show the effectiveness of the theoretical results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.