Abstract
Abstract: In this paper, we study a distributed constrained consensus problem for multi-agent systems in the presence of distance-dependent noises. Given a convex set constraint which can only be accessed by part of agents, all agents are required to achieve state agreement within the set by relative state measurements of their neighbors. These measurements are corrupted by noises whose intensities are proportional to the relative distance. Based on weighted averaging and projection, a two-step update scheme is proposed to achieve the mean square consensus within the constraint set. We show that the stochastic constrained consensus in the mean square sense can be achieved in two different cases, namely a switching and balanced multi-agent network which frequently contains a joint spanning tree and connects to the constraint set (considered as a virtual node), and a fixed and strongly connected network with at least one agent that can access the convex constraint.
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.
