Finite-time consensus algorithm for multiple nonholonomic disturbed systems with its application (Q1665450)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finite-time consensus algorithm for multiple nonholonomic disturbed systems with its application |
scientific article; zbMATH DE number 6926138
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite-time consensus algorithm for multiple nonholonomic disturbed systems with its application |
scientific article; zbMATH DE number 6926138 |
Statements
Finite-time consensus algorithm for multiple nonholonomic disturbed systems with its application (English)
0 references
27 August 2018
0 references
Summary: This paper deals with the problem of finite-time consensus of multiple nonholonomic disturbed systems. To accomplish this problem, the multiple nonholonomic systems are transformed into two multiple subsystems, and these two multiple subsystems are studied, respectively. For these two multiple subsystems, the terminal sliding mode (TSM) algorithms are designed, respectively, which achieve the finite-time reaching of sliding surface. Next, a switching control strategy is proposed to guarantee the finite-time consensus of all the states for multiple nonholonomic systems with disturbances. Finally, we demonstrate the effectiveness of the proposed consensus algorithms with application to multiple nonholonomic mobile robots.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references