Abstract
Abstract This paper investigates distributed circle formation problems of multi-agent systems (MAS) subject to limited information communication under a class of weight-unbalanced directed graphs, in which the communication topology contains a directed spanning tree and each agent can only perceive the distances from itself to the nearest neighbor in counterclockwise direction as well as the counterpart in the clockwise direction. Towards this end, a novel algorithm combined with an encoder-decoder framework has been proposed. We show that, under the proposed policy, the resulting network executions can drive the states of all mobile agents to converge to some expected equilibrium point. Numerical simulation results have been given to demonstrate the effectiveness of the proposed algorithm.
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.
