Search

Your search keyword '"Liu, Jason"' showing total 2 results
Start Over Author "Liu, Jason" Topic graph theory Topic multiagent systems
2 results on '"Liu, Jason"'

1. Robust and nonfragile consensus of positive multiagent systems via observer‐based output‐feedback protocols.

Author

Liu, Jason J. R., Lam, James, Wang, Yamin, Cui, Yukang, and Shu, Zhan

Subjects
*MULTIAGENT systems, *POSITIVE systems, *GRAPH theory, *SEMIDEFINITE programming, *LINEAR programming
Abstract

Summary: This article investigates the consensus problem for positive multiagent systems via an observer‐based dynamic output‐feedback protocol. The dynamics of the agents are modeled by linear positive systems and the communication topology of the agents is expressed by an undirected connected graph. For the consensus problem, the nominal case is studied under the semidefinite programming framework while the robust and nonfragile cases are investigated under the linear programming framework. It is required that the distributed state‐feedback controller and observer gains should be structured to preserve the positivity of multiagent systems. Necessary and/or sufficient conditions for the analysis of consensus are obtained by using positive systems theory and graph theory. For the nominal case, necessary and sufficient conditions for the codesign of state‐feedback controller and observer of consensus are derived in terms of matrix inequalities. Sufficient conditions for the robust and nonfragile consensus designs are derived and the codesign of state‐feedback controller and observer can be obtained in terms of solving a set of linear programs. Numerical simulations are provided to show the effectiveness and applicability of the theoretical results and algorithms. [ABSTRACT FROM AUTHOR]

Published
2020
Full Text
View/download PDF

2. Distributed finite-time bipartite consensus of multi-agent systems on directed graphs: Theory and experiment in nano-quadcopters formation.

Author

Gong, Xin, Liu, Jason J.R., Wang, Yamin, and Cui, Yukang

Subjects
*GRAPH theory, *DIRECTED graphs, *MULTIAGENT systems, *LAPLACIAN matrices, *FRACTIONAL powers, *SPANNING trees, *PSYCHOLOGICAL feedback, *BIPARTITE graphs
Abstract

This work deals with the analysis and protocol design problems of finite-time consensus for multi-agent systems on signed and directed networks. A new distributed protocol with two reciprocal fractional power feedbacks of local consensus error has been proposed to remove the influence of initial states on the consensus time. By introducing a well-structured Lyapunov function, the technical difficulty arising from the asymmetrical Laplacian matrices of directed graphs is circumvented. Furthermore, it is shown that the feasibility of this proposed protocol can be extended to directed graphs with a spanning tree by mathematical induction method. The upper bounds of the finite-time periods are given under the circumstances of directed networks with a spanning tree apart from the strongly-connected ones. This new protocol is then extended to the application of finite-time bipartite formation control of multi-agent systems. Simulations and experiments of bipartite formation of multiple nano-quadcopters are implemented to prove the validity and practicability of this new protocol. In the experiment, a novel fuzzy logic is also introduced to realize the group collision avoidance of all nano-quadcopters. [ABSTRACT FROM AUTHOR]

Published
2020
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results