Finite-Time Consensus Algorithm for Multiple Nonholonomic Disturbed Systems with Its Application

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Shi, S., Yu, X., & Liu, G. (2015). Finite-Time Consensus Algorithm for Multiple Nonholonomic Disturbed Systems with Its Application. Mathematical Problems in Engineering, 2015. https://doi.org/10.1155/2015/358161

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free