Search

This study addresses the group controllability of continuous‐time multi‐agent systems. The problem is investigated in the leaderless framework where the whole group is consisted of a number of dynamic agents with autonomous capability, which can complete the large‐scale complex task through local interaction and can be divided into some subgroups. This study concentrates on the group controllability problems of continuous‐time multi‐agent systems, gives the general definition of the group controllability, and establishes group controllability criteria. Sufficient and necessary conditions are derived for the group controllability of continuous‐time multi‐agent systems. Finally, the numerical example and simulations are given to illustrate the theoretical results. [ABSTRACT FROM AUTHOR]

Abstract: The consensus state is an important and fundamental quantity for consensus problems of multi-agent systems, which indicates where all the dynamical agents reach. In this paper, weighted average consensus with respect to a monotonic function, which means that the trajectories of the monotonic function along the state of each agent reach the weighted average of their initial values, is studied for a group of kinematic agents with time-varying topology. By constructing a continuous nonlinear distributed protocol, such a consensus problem can be solved in finite time even though the time-varying topology involves unconnected graphs. Then the distributed protocol is employed to compute the maximum-likelihood estimation of unknown parameters over sensor networks. Compared with the existing results, the estimate scheme proposed here may reduce the costs of data communication, storage memory, book-keeping and computational overheads. [Copyright &y& Elsevier]