Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFault-Tolerant Formation Tracking of Heterogeneous Multi-Agent Systems with Time-Varying Actuator Faults and Its Application to Task-Space Cooperative Tracking of Manipulators
57
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This paper addresses a formation tracking problem for nonlinear multi-agent systems with time-varying actuator faults, in which only a subset of agents has access to the leaders information over the directed leader-follower network with a spanning tree. Both the amplitudes and signs of control coefficients induced by actuator faults are unknown and time-varying. The aforementioned setting improves the practical relevance of the problem to be investigated, and meanwhile, it poses technical challenges to distributed controller design and asymptotic stability analysis. By introducing a distributed estimation and control framework, a novel distributed control law based on a Nussbaum gain technique is developed to achieve robust fault-tolerant formation tracking for heterogeneous nonlinear multi-agent systems with time-varying actuator faults. It can be proved that the asymptotic convergence is guaranteed. In addition, the proposed approach is applied to task-space cooperative tracking of networked manipulators irrespective of the uncertain kinematics, dynamics, and actuator faults. Numerical simulation results are presented to verify the effectiveness of the proposed designs.
rate research
Read More
Extended from the classic switched system, themulti-dimensional switched system (MDSS) allows for subsystems(switching modes) with different state dimensions. In this work,we study the stability problem of the MDSS, whose state transi-tion at each switching instant is characterized by the dimensionvariation and the state jump, without extra constraint imposed.Based on the proposed transition-dependent average dwell time(TDADT) and the piecewise TDADT methods, along with the pro-posed parametric multiple Lyapunov functions (MLFs), sufficientconditions for the practical and the asymptotical stabilities of theMDSS are respectively derived for the MDSS in the presenceof unstable subsystems. The stability results for the MDSS areapplied to the consensus problem of the open multi-agent system(MAS) which exhibits dynamic circulation behaviors. It is shownthat the (practical) consensus of the open MAS with disconnectedswitching topologies can be ensured by (practically) stabilizingthe corresponding MDSS with unstable switching modes via theproposed TDADT and parametric MLF methods.
In this paper, we present a space-and-time-synchronized control method with application to the simultaneous tracking/formation. In the framework of polar coordinates, through correlating and decoupling the reference/actual kinematics between the self vehicle and target, time and space are separated, controlled independently. As such, the specified state can be achieved at the predetermined terminal time, meanwhile, the relative trajectory in space is independent of time. In addition, for the stabilization before the predesigned time, a cascaded prescribed-time control theorem is provided as the preliminary of vehicle tracking control. The obtained results can be directly extended to the simultaneous tracking/formation of multiple vehicles. Finally, numerical examples are provided to verify the effectiveness and superiority of the proposed scheme.
Due to the wide application of average consensus algorithm, its security and privacy problems have attracted great attention. In this paper, we consider the system threatened by a set of unknown agents that are both malicious and curious, who add additional input signals to the system in order to perturb the final consensus value or prevent consensus, and try to infer the initial state of other agents. At the same time, we design a privacy-preserving average consensus algorithm equipped with an attack detector with a time-varying exponentially decreasing threshold for every benign agent, which can guarantee the initial state privacy of every benign agent, under mild conditions. The attack detector will trigger an alarm if it detects the presence of malicious attackers. An upper bound of false alarm rate in the absence of malicious attackers and the necessary and sufficient condition for there is no undetectable input by the attack detector in the system are given. Specifically, we show that under this condition, the system can achieve asymptotic consensus almost surely when no alarm is triggered from beginning to end, and an upper bound of convergence rate and some quantitative estimates about the error of final consensus value are given. Finally, numerical case is used to illustrate the effectiveness of some theoretical results.
This paper studies the distributed average tracking problem pertaining to a discrete-time linear time-invariant multi-agent network, which is subject to, concurrently, input delays, random packet-drops, and reference noise. The problem amounts to an integrated design of delay and packet-drop tolerant algorithm and determining the ultimate upper bound of the tracking error between agents states and the average of the reference signals. The investigation is driven by the goal of devising a practically more attainable average tracking algorithm, thereby extending the existing work in the literature which largely ignored the aforementioned uncertainties. For this purpose, a blend of techniques from Kalman filtering, multi-stage consensus filtering, and predictive control is employed, which gives rise to a simple yet comepelling distributed average tracking algorithm that is robust to initialization error and allows the trade-off between communication/computation cost and stationary-state tracking error. Due to the inherent coupling among different control components, convergence analysis is significantly challenging. Nevertheless, it is revealed that the allowable values of the algorithm parameters rely upon the maximal degree of an expected network, while the convergence speed depends upon the second smallest eigenvalue of the same networks topology. The effectiveness of the theoretical results is verified by a numerical example.
This paper studies synchronization of homogeneous and heterogeneous discrete-time multi-agent systems. A class of linear dynamic protocol design methodology is developed based on localized information exchange with neighbors which does not need any knowledge of the directed network topology and the spectrum of the associated Laplacian matrix. The main contribution of this paper is that the proposed protocols are scale-free and achieve synchronization for arbitrary number of agents.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
