论文部分内容阅读
In this paper, finite time consensus problem is discussed for multiple non-holonomic mobile agents with constant communication delay. The objective is to design non-smooth distributed control laws such that multiple non-holonomic mobile agents can be all in agreement within any given finite time larger than communication delay. The authors propose a novel switching control strategy with the help of Lyapunov-based method and graph theory.
The objective is to design non-smooth distributed control laws such that multiple non-holonomic mobile agents can be all in agreement within any given finite time larger than communication delay. The authors propose a novel switching control strategy with the help of Lyapunov-based method and graph theory.