Yuezu Lv

Adaptive output feedback consensus tracking for heterogeneous multi-agent systems with unknown dynamics under directed graphs

Abstract This paper considers the distributed consensus tracking problem for the linear multi-agent systems with unknown dynamics under general directed graphs. Based on the output information among the agents, distributed adaptive consensus tracking protocols together with two observers, consisting of a local observer and an adaptive estimator, are designed to guarantee that all the signals in the closed-loop dynamics are uniformly ultimately bounded and the tracking errors converge to a small neighborhood around the origin. Moreover, the consensus protocols are in fully distributed fashion in the sense that the coupling gains in the controllers are independent without requiring the global knowledge that the eigenvalues of the Laplacian matrix associated with the whole communication graph. Finally, a simulation example is provided to verify the theoretical results.

Novel distributed robust adaptive consensus protocols for linear multi-agent systems with directed graphs and external disturbances

ABSTRACTThis paper addresses the distributed consensus protocol design problem for linear multi-agent systems with directed graphs and external unmatched disturbances. Novel distributed adaptive consensus protocols are proposed to achieve leader–follower consensus for any directed graph containing a directed spanning tree with the leader as the root node and leaderless consensus for strongly connected directed graphs. It is pointed out that the adaptive protocols involve undesirable parameter drift phenomenon when bounded external disturbances exist. By using the σ modification technique, distributed robust adaptive consensus protocols are designed to guarantee the ultimate boundedness of both the consensus error and the adaptive coupling weights in the presence of external disturbances. All the adaptive protocols in this paper are fully distributed, relying on only the agent dynamics and the relative states of neighbouring agents.

Distributed adaptive output feedback consensus protocols for linear systems on directed graphs with a leader of bounded input

This paper studies output feedback consensus protocol design problems for linear multi-agent systems with directed graphs containing a leader whose control input is nonzero and bounded. We present novel distributed adaptive output feedback protocols to achieve leader-follower consensus for any directed graph containing a directed spanning tree with the leader as the root. The proposed protocols are independent of any global information of the graph and can be constructed as long as the agents are stabilizable and detectable.

Distributed Adaptive Consensus Disturbance Rejection for Multi-Agent Systems on Directed Graphs

In this paper, the adaptive consensus disturbance rejection problem is considered for the liner multi-agent systems under directed graphs. Based on the relative state information of the neighboring agents, the consensus protocols, including a state observer and a disturbance observer, are designed to guarantee that the consensus error goes to zero with the complete disturbance rejection. Furthermore, the state observer is designed in a fully distributed fashion with adaptive coupling gain, which has the advantage that the consensus protocol design is independent of the Laplacian matrix associated with the communication network. Finally, an example is given to verify the effectiveness of the theoretical results.

Adaptive output-feedback consensus protocol design for linear multi-agent systems with directed graphs

This paper addresses the output feedback consensus protocol design problem for general linear multi-agent systems with directed communication graphs. By proposing a new method called adding an extra observer, two novel adaptive output feedback consensus protocols are proposed to achieve consensus for any strongly connected directed graph. The proposed adaptive output feedback protocols are fully distributed, relying on only the agent dynamics and the local output information of neighboring agents. A sufficient condition for the existence of the proposed adaptive protocols is that each agent is stabilizable and detectable.

Adaptive consensus disturbance rejection for multi-agent systems on directed graphs

This paper considers the distributed consensus disturbance rejection problem for general linear multiagent systems with deterministic disturbances under directed communication graphs. Based on the relative state information of the neighboring agents, the consensus protocols, which consist of two observers, including a state observer and a separate disturbance observer, are designed to guarantee that the consensus error goes to zero with complete disturbance rejection. Furthermore, the state observer is designed in a fully distributed fashion with adaptive coupling gain, which has the advantage that the consensus controller design is independent of the Laplacian matrix associated with the communication network. The distributed observer-based consensus disturbance rejection protocols are further extended to containment control. Finally, an example is provided to demonstrate the effectiveness of the proposed strategies.