Abstract
The leader-following consensus problem for linear discrete-time multi-agent systems subject to static networks has been studied in the literature using H ∞ Riccati inequality design and H 2 Riccati equation design, respectively. However, these methods involve some less tractable conditions and need to solve some type of Riccati equation or inequality. In this paper, we further study the leader-following consensus problem for linear discrete-time multi-agent systems subject to static networks for the case where the leader system is marginally stable. By showing the Schur stability of some graph matrix, which can be viewed as the discrete-time counterpart of H matrix encountered in continuous-time leader-following consensus problem, we solve our problem with a straightforward method, which is the reminiscent of the same problem for continuous-time multi-agent systems.
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.
