Search

In this paper, the consensus for second-order heterogeneous multi-agent system is investigated. The heterogeneous system consists of linear and nonlinear second-order agents, where the nonlinear agents are still with different structures. First, the consensus of the system with and without a static leader is discussed, respectively. Then, we consider a general case where the inputs of linear second-order agents are bounded by virtue of the limitation of the actuators. Effective control protocols to achieve consensus are presented for these cases. Based on graph theory and Lyapunov stability theory, sufficient conditions are established for the consensus of heterogeneous system, where the communication topology is undirected and connected. Finally, several numerical examples are presented to verify the validity of the developed method. [ABSTRACT FROM AUTHOR]

In this paper, the leaderless consensus problem of multi-agent systems with jointly connected topologies and nonlinear dynamics is considered, in which the nonlinear dynamics are assumed to be non-identical and unknown. The unknown nonlinear dynamics existing in the systems are assumed to be linearly parameterized, and an adaptive design method for leaderless multi-agent systems is presented. By just using the relative position information between each agent and its neighbors, a distributed adaptive consensus control algorithm for the considered systems is proposed, in which the network graphs are jointly connected. Both the global uniform asymptotical stability and the global uniform asymptotical parameter convergence analysis of the adaptive control algorithm are carried out by using adaptive control theory, Lyapunov theory and algebraic graph theory. Finally, an example is given to illustrate the validity of our theoretical results. [ABSTRACT FROM AUTHOR]

Time-varying group formation control problems for second-order multi-agent systems with directed topologies are investigated. Firstly, a time-varying group formation control protocol is constructed using local relative positions and velocities of each agent and its neighbors. Then based on graph theory, nonsingular transformations are applied to the closed-loop multi-agent systems. Sufficient conditions for second-order multi-agent systems to achieve time-varying group formation are further presented together with the time-varying group formation feasibility constraints. Explicit expressions of the subgroup formation reference functions are derived to describe the macroscopic movement of the time-varying subgroup formations. Moreover, by solving an algebraic Riccati equation, an approach to design the time-varying group formation protocol is proposed. Finally, a numerical example with three subgroups is provided to demonstrate the effectiveness of the obtained results. In contrast to the traditional complete formation, where only one formation is realized by the multi-agent system, in the group formation discussed in the current paper, agents are classified into subgroups and each subgroup is required to form a specified time-varying sub-formation via inter-subgroup and intra-subgroup interactions. [ABSTRACT FROM AUTHOR]

In this paper, the recent developments of distributed coordination control problems are summarized in a graph-theory-based framework. Distributed coordination has attracted tremendous attention in control and robot communities because of its potential applications in the past decade. The graph is used to describe the interconnections among agents, and different distributed coordination control problems, such as consensus, formation control, rendezvous, alignment, swarming, flocking, containment control and circumnavigation control, are adopted to this description by considering different cooperative objects. Therefore it is natural to study the distributed coordination control problems via graph theory, and the graph-theory-based results on consensus, formation control, and some closely related issues, i.e., rendezvous/alignment, swarming/flocking, containment control and circumnavigation control, are reviewed, and provide a cohesive overview in the coordination control problems, in system modeling, control law designs and analysis, and structure transformation. Finally, towards the practical applications, some potential directions possibly deserving investigation in distributed coordination control are discussed. [ABSTRACT FROM AUTHOR]

In this paper, consensus problem of general nonlinear multi-agent systems with communication failures is studied based on a distributed consensus algorithm. Under the assumption that the communication graphs are strongly connected, we derive some sufficient consensus criterion for both cases fixed and switched topologies using the relative measured output states of each agent. Moreover, the case that there is a leader in the communication graph is also explicitly investigated. Finally, simulation examples are presented to show the effectiveness of the obtained results. [ABSTRACT FROM AUTHOR]