Abstract

AbstractThis work studies formation control of multiagent systems (MASs) where its formation size is scalable via a scaling factor (scalable formation). Past works on scalable formation are limited to either fixed undirected graph or fixed directed graph with p‐rooted graph condition. This work proposes a new distributed algorithm for scalable formation based on a distributed observer to estimate agents' positions. The new algorithm results in a new matrix, a Laplacian matrix with additional diagonal terms, where the desired formation pattern is embedded in this diagonal terms. With the proposed algorithm, only spanning tree condition is needed as the necessary and sufficient condition to achieve the scalable formation. Numerical examples are shown to illustrate the proposed method.

Full Text
Paper version not known

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 call

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.