书目名称 | Discrete-Time Sliding Mode Protocols for Discrete Multi-Agent System |
编辑 | Keyurkumar Patel,Axaykumar Mehta |
视频video | |
概述 | Presents novel Discrete-time Sliding Mode (DSM) protocols.Includes practical implementation of each proposed DSM protocols.Serves as a reference for researchers, industry professionals and policymaker |
丛书名称 | Studies in Systems, Decision and Control |
图书封面 |  |
描述 | This book presents few novel Discrete-time Sliding Mode (DSM) protocols for leader-following consensus of Discrete Multi-Agent Systems (DMASs). The protocols intend to achieve the consensus in finite time steps and also tackle the corresponding uncertainties. Based on the communication graph topology of multi-agent systems, the protocols are divided into two groups, namely (i) Fixed graph topology and (ii) Switching graph topology. The coverage begins with the design of Discrete-time Sliding Mode (DSM) protocols using Gao’s reaching law and power rate reaching law for the synchronization of linear DMASs by using the exchange of information between the agents and the leader to achieve a common goal. Then, in a subsequent chapter, analysis for no. of fixed-time steps required for the leader-following consensus is presented. The book also includes chapters on the design of Discrete-time Higher-order Sliding Mode (DHSM) protocols, Event-triggered DSM protocols for the leader-following consensus of DMASs. A chapter is also included on the design of DHSM protocols for leader-following consensus of heterogeneous DMASs..Special emphasis is given to the practical implementation of each prop |
出版日期 | Book 2021 |
关键词 | Discrete-Time Sliding Mode Protocol; Discrete Multi-Agent System; Higher-Order Sliding Mode; Consensus; |
版次 | 1 |
doi | https://doi.org/10.1007/978-981-15-6311-9 |
isbn_softcover | 978-981-15-6313-3 |
isbn_ebook | 978-981-15-6311-9Series ISSN 2198-4182 Series E-ISSN 2198-4190 |
issn_series | 2198-4182 |
copyright | The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapor |