Search

This paper studies the consensus problem for directed positive multiagent systems with nonlinear control input. The directed topology is supposed to be strongly connected. For the case of sector input nonlinearities, the non-negative global consensus conditions are presented by using a novel analysis method which directly considers the nonlinear input, and the feedback matrices are obtained with convex optimization method by solving the quadratic matrix inequalities subject to non-negative constraints. For the case of saturation-type sector input nonlinearities, the global consensus and local consensus results are analyzed, respectively. With the properties of Metzler matrix, the non-negative consensus results are further extended to the strongly connected and balanced positive multiagent systems subject to (saturation-type) sector input nonlinearities and parameter uncertainties. The results are simplified, and the feedback matrices can be given by solving iterative linear matrix inequality with non-negative constraints. Two simulation examples and a practical electrical circuit model are finally carried out to verify the proposed control schemes. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the leader-following consensus of second-order multi-agent systems with nonlinear dynamics and time delay by employing periodically intermittent pinning control. All member agents and the virtual leader share the same nonlinear dynamics relating to the velocity and delayed velocity information. Based on Lyapunov stability theory, we obtain a novel criterion that is independent of the time delay and control width to guarantee the second-order consensus of multi-agent systems with time delay and periodically intermittent controllers. Numerical simulations are presented to illustrate the theoretical results. [ABSTRACT FROM AUTHOR]

The consensus problem in networks with both switching topology and time-delays over finite fields is investigated in this paper. The finite field, which is a kind of finite alphabet, is considered due to the fact that networks often possess limited computation, memory, and capabilities of communication. First, by graph-theoretic method, one necessary and sufficient condition is derived for finite-field consensus of switching networks without time-delays. Subsequently, another necessary and sufficient condition on finite-field consensus without time-delays is provided based on FFC property of matrices associated with switching networks. Moreover, by means of the results on delay-free networks, some necessary and sufficient conditions for finite-field consensus of networks with both switching topology and time-delays are obtained. Additionally, it can be shown that switching networks with time-delays present in each self-transmission cannot achieve consensus. [ABSTRACT FROM AUTHOR]