Distributed consensus tracking is addressed in this paper for multi-agent systems with Lipschitz-type node dynamics. The main contribution of this work is solving the consensus tracking problem ...without the assumption that the topology among followers is strongly connected and fixed. By using tools from M-matrix theory, a class of consensus tracking protocols based only on the relative states among neighboring agents is designed. By appropriately constructing Lyapunov function, it is proved that consensus tracking in the closed-loop multi-agent systems with a fixed topology having a directed spanning tree can be achieved if the feedback gain matrix and the coupling strength are suitably selected. Furthermore, with the assumption that each possible topology contains a directed spanning tree, it is theoretically shown that consensus tracking under switching directed topologies can be achieved if the control parameters are suitably selected and the dwell time is larger than a positive threshold. The results are then extended to the case where the communication topology contains a directed spanning tree only frequently as the system evolves with time. Finally, some numerical simulations are given to verify the theoretical analysis.
This paper reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed ...coordination of multiple vehicles, including unmanned aerial vehicles, unmanned ground vehicles, and unmanned underwater vehicles, has been a very active research subject studied extensively by the systems and control community. The recent results in this area are categorized into several directions, such as consensus, formation control, optimization, and estimation. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important for further investigations.
This paper studies some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems. First, basic theoretical analysis is carried out for the case where for each ...agent the second-order dynamics are governed by the position and velocity terms and the asymptotic velocity is constant. A necessary and sufficient condition is given to ensure second-order consensus and it is found that both the real and imaginary parts of the eigenvalues of the Laplacian matrix of the corresponding network play key roles in reaching consensus. Based on this result, a second-order consensus algorithm is derived for the multi-agent system facing communication delays. A necessary and sufficient condition is provided, which shows that consensus can be achieved in a multi-agent system whose network topology contains a directed spanning tree if and only if the time delay is less than a critical value. Finally, simulation examples are given to verify the theoretical analysis.
In this paper, we study the problem of finite-time consensus of multiagent systems on a fixed directed interaction graph with a new protocol. Existing finite-time consensus protocols can be divided ...into two types: 1) continuous and 2) discontinuous, which were studied separately in the past. In this paper, we deal with both continuous and discontinuous protocols simultaneously, and design a centralized switching consensus protocol such that the finite-time consensus can be realized in a fast speed. The switching protocol depends on the range of the initial disagreement of the agents, for which we derive an exact bound to indicate at what time a continuous or a discontinuous protocol should be selected to use. Finally, we provide two numerical examples to illustrate the superiority of the proposed protocol and design method.
This paper studies the global pinning synchronization problem for a class of complex networks with switching directed topologies. The common assumption in the existing related literature that each ...possible network topology contains a directed spanning tree is removed in this paper. Using tools from M-matrix theory and stability analysis of the switched nonlinear systems, a new kind of network topology-dependent multiple Lyapunov functions is proposed for analyzing the synchronization behavior of the whole network. It is theoretically shown that the global pinning synchronization in switched complex networks can be ensured if some nodes are appropriately pinned and the coupling is carefully selected. Interesting issues of how many and which nodes should be pinned for possibly realizing global synchronization are further addressed. Finally, some numerical simulations on coupled neural networks are provided to verify the theoretical results.
This paper introduces a distributed algorithm for sparse load shifting in demand-side management with a focus on the scheduling problem of residential smart appliances. By the sparse load shifting ...strategy, customers' discomfort is reduced. Although there are many game theoretic models for the demand-side management problem, the computational efficiency of finding Nash equilibrium that globally minimizes the total energy consumption cost and the peak-to-average ratio is still an outstanding issue. We develop a bidirectional framework for solving the demand-side management problem in a distributed way to substantially improve the search efficiency. A Newton method is employed to accelerate the centralized coordination of demand side management strategies that superlinearly converge to a better Nash equilibrium minimizing the peak-to-average ratio. Furthermore, dual fast gradient and convex relaxation are applied to tackle the sub-problem for customers' best response, which is able to relieve customers' discomfort from load shifting or interrupting. Detailed results from illustrative case studies are presented and discussed, which shows the costs of energy consumption and daily peak demand by our algorithm are reduced. Finally, some conclusions are drawn.
Synchronization on Complex Networks of Networks Lu, Renquan; Yu, Wenwu; Lu, Jinhu ...
IEEE transaction on neural networks and learning systems,
11/2014, Letnik:
25, Številka:
11
Journal Article
In this paper, pinning synchronization on complex networks of networks is investigated, where there are many subnetworks with the interactions among them. The subnetworks and their connections can be ...regarded as the nodes and interactions of the networks, respectively, which form the networks of networks. In this new setting, the aim is to design pinning controllers on the chosen nodes of each subnetwork so as to reach synchronization behavior. Some synchronization criteria are established for reaching pinning control on networks of networks. Furthermore, the pinning scheme is designed, which shows that the nodes with very low degrees and large degrees are good candidates for applying pinning controllers. Then, the attack and robustness of the pinning scheme are discussed. Finally, a simulation example is presented to verify the theoretical analysis in this paper.
This paper is concerned with the finite-time synchronization (FTS) issue of switched coupled neural networks with discontinuous or continuous activations. Based on the framework of nonsmooth ...analysis, some discontinuous or continuous controllers are designed to force the coupled networks to synchronize to an isolated neural network. Some sufficient conditions are derived to ensure the FTS by utilizing the well-known finite-time stability theorem for nonlinear systems. Compared with the previous literatures, such synchronization objective will be realized when the activations and the controllers are both discontinuous. The obtained results in this paper include and extend the earlier works on the synchronization issue of coupled networks with Lipschitz continuous conditions. Moreover, an upper bound of the settling time for synchronization is estimated. Finally, numerical simulations are given to demonstrate the effectiveness of the theoretical results.
To reduce information exchange requirements in smart grids, an event-triggered communication-based distributed optimization is proposed for economic dispatch. In this work, the θ-logarithmic ...barrier-based method is employed to reformulate the economic dispatch problem, and the consensus-based approach is considered for developing fully distributed technology-enabled algorithms. Specifically, a novel distributed algorithm utilizes the minimum connected dominating set (CDS), which efficiently allocates the task of balancing supply and demand for the entire power network at the beginning of economic dispatch. Further, an event-triggered communication-based method for the incremental cost of each generator is able to reach a consensus, coinciding with the global optimality of the objective function. In addition, a fast gradient-based distributed optimization method is also designed to accelerate the convergence rate of the event-triggered distributed optimization. Simulations based on the IEEE 57-bus test system demonstrate the effectiveness and good performance of proposed algorithms.
This technical note studies the consensus problem for cooperative agents with nonlinear dynamics in a directed network. Both local and global consensus are defined and investigated. Techniques for ...studying the synchronization in such complex networks are exploited to establish various sufficient conditions for reaching consensus. The local consensus problem is first studied via a combination of the tools of complex analysis, local consensus manifold approach, and Lyapunov methods. A generalized algebraic connectivity is then proposed to study the global consensus problem in strongly connected networks and also in a broad class of networks containing spanning trees, for which ideas from algebraic graph theory, matrix theory, and Lyapunov methods are utilized.