Abstract

This paper presents optimal consensus control for multi-agent systems with input constraints by using a state decomposition approach. The state decomposition approach is to divide the state space into consensus subspace and its orthonormal complement subspace. The proposed equality condition ensures that consensus subspace is consensus. Therefore, if we design the gain K that orthonormal subspace converges to zero, the consensus is achieved. Solving the proposed optimization problem that minimizes global cost function guarantees consensus control with input constraints of states. To solve the optimization problem, linear matrix inequality (LMI) formulation is used. The simulation results of numerical examples show that the proposed condition achieves multi-agent systems consensus.

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.