28 December 2021 in IEEE Transactions on Circuits and Systems I: Regular Papers
This paper investigates the formation control problem for linear multi-agent systems under switching directed topologies. Based on absolute or relative outputs, we propose two distributed observer-based event-triggered control schemes. Both schemes can guarantee the boundedness of formation errors under sufficient conditions. The schemes can also avoid Zeno behaviors by giving an estimation for the lower bound of sampling intervals. Finally, simulations and experiments validate the proposed approaches.
11 April 2019 in IEEE Transactions on Cybernetics
Over the past decades, the synchronization of complex networks with directed topologies has received considerable attention owing to its extensive applications in the realistic world. Design of proportional-integral-derivative (PID) control protocols for achieving synchronization with directed networks is known to be a challenging task. The purpose of this paper is to establish a connection between the PID control protocols and synchronization of complex dynamical networks with directed topologies. Based on the classical complex network model, we investigate global synchronization with PD controller of a balanced strongly connected directed network and global synchronization with PI controller of a strongly connected directed network, and a directed network containing a spanning tree, respectively. Several sets of sufficient conditions are established under which the network reaches global synchronization. The simulation examples are presented to verify the efficiency of the theoretical results.
11 September 2020 in IEEE Transactions on Circuits and Systems I: Regular Papers
In the paper, synchronization of nonlinear dynamical complex networks with stochastic coupling under adaptive PI control is considered. In light of the relative states information of the network nodes, node- and edge-based adaptive PI synchronization protocols are proposed and several sufficient conditions are derived. By employing stochastic analysis techniques combined with a version of the LaSalle's invariant principles applied to stochastic process and Lyapunov function approaches, synchronization of complex networks with nonlinear dynamics and stochastic coupling reaches in mean square via these two types of adaptive PI control protocols are proved. The proposed adaptive PI control protocols for synchronization of complex dynamical networks are useful for future realistic engineering systems design. Numerical examples are finally simulated to validate the theoretical analysis.
8 January 2020 in IEEE Transactions on Neural Networks and Learning Systems
This article addresses the leader-following consensus of a class of multi-agent systems (MASs) subjected to saturation. Unlike previous literature, the followers are with heterogeneous dynamics. To solve this problem, we employ the low-gain feedback technique and the parameterized algebraic Riccati equations to design the controllers. For the fixed and switching network topologies, sufficient conditions are put in place to guarantee the semiglobal stability of the consensus error system. Numerical results are also provided to validate the effectiveness of the control design.
16 September 2022 in IEEE Transactions on Circuits and Systems I: Regular Papers
This paper investigates the coordination control problem for a special nonlinear heterogeneous multi-agent system consisting of tail-sitter unmanned aerial vehicles and unmanned ground vehicles with uncertainties and disturbances. A robust hierarchical pinning control scheme is proposed for the heterogeneous multi-agent system to restrain the uncertainties and disturbances and achieve coordination scenarios. The heterogeneous multi-agent system can realize coordination tasks by selecting proper pinning nodes and estimating coupling strength. The robustness of the whole system is proven utilizing the Lyapunov stability theorem. The effectiveness of the robust hierarchical pining control method is validated by simulation scenarios.
14 December 2023 in IEEE Transactions on Circuits and Systems I: Regular Papers
This paper considers Stackelberg equilibrium (SE) and Nash equilibrium (NE) computation in a class of non-convex network aggregative games with one leader and multiple followers. The cost function of each follower is influenced by its strategy, the leader’s strategy, and its neighbors’ aggregative strategies. Also, the structured non-convex cost function of the leader is the composition of a canonical function and a vector-valued geometrical operator that relies on its strategy and followers’ strategies. In the leader-follower scheme, when the leader has knowledge of the best responses of the followers in a closed form, the SE strategy will be the optimal choice due to its relatively low cost. When the leader does not know the exact expression of followers’ best responses or the leader’s dominance is threatened, NE will be what all players are committed to achieving. The widespread existence of nonconvexity creates a significant challenge for computing the above equilibria in different circumstances. The results in existing convex games are not directly applicable to such a non-convex case, as they get trapped in local equilibria or stationary points rather than global equilibria. Here, we adopt the canonical transformation to reformulate the non-convex games and present the existence condition based on the canonical duality theory. Then two projection gradient algorithms are designed to pursue the SE and the NE, followed by proving the convergence of the algorithms.