The finite-time output regulation (FTOR) problem for linear heterogeneous multi-agent systems (MAS) is investigated in this brief. The objective of this brief is to design controllers such that each agent can accurately track the reference signal and reject the disturbance. The disturbance and reference signal are generated by an exosystem. It is assumed that only a part of agents can obtain the state and system matrix of the exosystem. Then, distributed fixed-time observers are firstly proposed to estimate them, which can ensure the fixed-time convergence of the estimation errors. Next, we design both state feedback controller and output feedback controller to solve the FTOR problem using feedforward method. By virtue of Lyapunov theory and output regulation technique, it is shown that the proposed control strategy can solve the FTOR problem. Finally, a numerical example is included for illustration.
23 October 2019 in IEEE Transactions on Control of Network Systems
The trace of the controllability Gramian quantifies the average controllability in all directions in the system state space. In this paper, we investigate the average controllability of a semistable networked system with Laplacian dynamics and derive upper and lower bounds on the trace of its pseudo-controllability Gramian matrix. We show that these bounds are solely determined by the network topology, which can be obtained without computing any higher-dimensional matrix. We find that a sparse or a scale-free network is easy to control in terms of the average controllability. We then investigate the effect of the edges with negative weights on the average controllability for a signed network with Laplacian dynamics. We find that a small number of negatively-weighted edges can significantly affect the average controllability of the signed network. We finally demonstrate that many real-world networks are easy to control via manipulating negatively-weighted edges.
In recent years, the path planning of robot has been a hot research direction, and multirobot formation has practical application prospect in our life. This article proposes a hybrid path planning algorithm applied to robot formation. The improved Rapidly Exploring Random Trees algorithm PQ‐RRT ∗ with new distance evaluation function is used as a global planning algorithm to generate the initial global path. The determined parent nodes and child nodes are used as the starting points and target points of the local planning algorithm, respectively. The dynamic window approach is used as the local planning algorithm to avoid dynamic obstacles. At the same time, the algorithm restricts the movement of robots inside the formation to avoid internal collisions. The local optimal path is selected by the evaluation function containing the possibility of formation collision. Therefore, multiple mobile robots can quickly and safely reach the global target point in a complex environment with dynamic and static obstacles through the hybrid path planning algorithm. Numerical simulations are given to verify the effectiveness and superiority of the proposed hybrid path planning algorithm.
28 September 2022 in IEEE Transactions on Cybernetics
This article studies coordinated tracking of underactuated and uncertain autonomous surface vehicles (ASVs) via model-reference reinforcement learning control. It considered how model-reference control can be incorporated with reinforcement learning to address the challenges caused by model uncertainties and input underactuation, and how existing results may be employed to realize adaptive communication amongst ASVs. It is demonstrated that the proposed algorithm has a better performance over baseline control and effectively improves the training efficiency over reinforcement learning.