Finite-Time Consensus Algorithm for Multiple Nonholonomic Disturbed Systems with Its Application
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-05-24
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract EN
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 terminalsliding 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 multiplenonholonomic systems with disturbances.
Finally, we demonstrate the effectiveness of the proposed consensusalgorithms with application to multiple nonholonomic mobile robots.
American Psychological Association (APA)
Shi, Shang& Yu, Xin& Liu, Guohai. 2015. Finite-Time Consensus Algorithm for Multiple Nonholonomic Disturbed Systems with Its Application. Mathematical Problems in Engineering،Vol. 2015, no. 2015, pp.1-10.
https://search.emarefa.net/detail/BIM-1073593
Modern Language Association (MLA)
Shi, Shang…[et al.]. Finite-Time Consensus Algorithm for Multiple Nonholonomic Disturbed Systems with Its Application. Mathematical Problems in Engineering No. 2015 (2015), pp.1-10.
https://search.emarefa.net/detail/BIM-1073593
American Medical Association (AMA)
Shi, Shang& Yu, Xin& Liu, Guohai. Finite-Time Consensus Algorithm for Multiple Nonholonomic Disturbed Systems with Its Application. Mathematical Problems in Engineering. 2015. Vol. 2015, no. 2015, pp.1-10.
https://search.emarefa.net/detail/BIM-1073593
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1073593