6,060 research outputs found
Designing Fully Distributed Consensus Protocols for Linear Multi-agent Systems with Directed Graphs
This paper addresses the distributed consensus protocol design problem for
multi-agent systems with general linear dynamics and directed communication
graphs. Existing works usually design consensus protocols using the smallest
real part of the nonzero eigenvalues of the Laplacian matrix associated with
the communication graph, which however is global information. In this paper,
based on only the agent dynamics and the relative states of neighboring agents,
a distributed adaptive consensus protocol is designed to achieve
leader-follower consensus for any communication graph containing a directed
spanning tree with the leader as the root node. The proposed adaptive protocol
is independent of any global information of the communication graph and thereby
is fully distributed. Extensions to the case with multiple leaders are further
studied.Comment: 16 page, 3 figures. To appear in IEEE Transactions on Automatic
Contro
Containment Control of Multi-Agent Systems with Dynamic Leaders Based on a -Type Approach
This paper studies the containment control problem of multi-agent systems
with multiple dynamic leaders in both the discrete-time domain and the
continuous-time domain. The leaders' motions are described by -order
polynomial trajectories. This setting makes practical sense because given some
critical points, the leaders' trajectories are usually planned by the
polynomial interpolations. In order to drive all followers into the convex hull
spanned by the leaders, a -type ( and are short for {\it
Proportion} and {\it Integration}, respectively; implies that the
algorithm includes high-order integral terms) containment algorithm is
proposed. It is theoretically proved that the -type containment algorithm
is able to solve the containment problem of multi-agent systems where the
followers are described by any order integral dynamics. Compared with the
previous results on the multi-agent systems with dynamic leaders, the
distinguished features of this paper are that: (1) the containment problem is
studied not only in the continuous-time domain but also in the discrete-time
domain while most existing results only work in the continuous-time domain; (2)
to deal with the leaders with the -order polynomial trajectories,
existing results require the follower's dynamics to be -order integral while
the followers considered in this paper can be described by any-order integral;
and (3) the "sign" function is not employed in the proposed algorithm, which
avoids the chattering phenomenon. Furthermore, in order to illustrate the
practical value of the proposed approach, an application, the containment
control of multiple mobile robots is studied. Finally, two simulation examples
are given to demonstrate the effectiveness of the proposed algorithm
- …