Abstract
This paper proposes an asynchronous gossip framework where agents move according to independent random walks over a location graph and interactions may occur only when two agents share the same location. Our goal is to investigate how average consensus may be achieved when agents’ motion occurs over a set of discrete locations with topological constraints. This could be used to model the spreading of information across moving crowds or the coordination of agents monitoring a discrete set of points of interest.
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.
