Distributed Fixed-Time Consensus Algorithm for Multiple Nonholonomic Chained-Form Systems
In this paper, the fixed-time control algorithm is used to address the consensus problem for multiple nonholonomic chained-form systems. For the sake of analysis, a switching control strategy is introduced to solve the fixed-time consensus problem. Compared with the finite-time control algorithm, the convergence time of the fixed-time consensus protocol, can be guaranteed regardless of the initial conditions. Rigorous proof using Lyapunov theory shows that the sates of multiple nonholonomic chained-form systems can reach a consensus in a fixed time. To further illustrate the effectiveness of the control algorithm, a numerical simulation is given.
KeywordsDistributed control Nonholonomic chained-form systems Lyapunov theory Finite-time consensus Fixed-time consensus
This work is supported by the National Natural Science Foundation of China (Grant Nos. 61573200, 61573199).
- 1.D. HaiBo, G.H. Wen, Y.Y. Cheng, Y.G. He, R. Jia, Distributed finite-time cooperative control of multiple high-order nonholonomic mobile robots. IEEE Trans. Neural Netw. Learn. Syst. 28(12), 2998–3006 (2017)Google Scholar
- 4.A.S. Jun Lin, B.D.O. Morse Anderson, The multi-agent rendezvous problem. I: the synchronous case. SIAM J. Control Opt. 46(6), 1508–1513 (2008)Google Scholar
- 9.P. Sanjay, Bhat, Dennis S. Bernstein, Finite-time stability of continuous autonomous systems. SIAM J. Control Opt. 38(3), 751–766 (2000)Google Scholar
- 15.O. MeiYing, D. HaiBo, S.H. Li, Finite-time formation control of multiple nonholonomic mobile robots. Int. J. Robust Nonlinear Control 24(1), 140–165 (2014)Google Scholar
- 19.S. Parsegov, A. Polyakov, P. Shcherbakov, Nonlinear fixed-time control protocol for uniform allocation of agents on a segment, in 51st Conference on Decision and Control, pp. 7732–7737 (2012)Google Scholar