9,164 research outputs found
Distributed Robust Consensus Control of Multi-agent Systems with Heterogeneous Matching Uncertainties
This paper considers the distributed consensus problem of linear multi-agent
systems subject to different matching uncertainties for both the cases without
and with a leader of bounded unknown control input. Due to the existence of
nonidentical uncertainties, the multi-agent systems discussed in this paper are
essentially heterogeneous. For the case where the communication graph is
undirected and connected, a distributed continuous static consensus protocol
based on the relative state information is first designed, under which the
consensus error is uniformly ultimately bounded and exponentially converges to
a small adjustable residual set. A fully distributed adaptive consensus
protocol is then designed, which, contrary to the static protocol, relies on
neither the eigenvalues of the Laplacian matrix nor the upper bounds of the
uncertainties. For the case where there exists a leader whose control input is
unknown and bounded, distributed static and adaptive consensus protocols are
proposed to ensure the boundedness of the consensus error. It is also shown
that the proposed protocols can be redesigned so as to ensure the boundedness
of the consensus error in the presence of bounded external disturbances which
do not satisfy the matching condition. A sufficient condition for the existence
of the proposed protocols is that each agent is stabilizable.Comment: 16 page, 10 figures. This manuscript is an extended version of our
paper accepted for publication by Automatic
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
- …