In this paper, cooperative control and optimal control methods are used for the formation control of mixed-order heterogeneous multi-agent systems. The system consists of unmanned aerial vehicles (UAVs), unmanned surface vehicles (USVs), and unmanned underwater vehicles (UUVs). The system is represented in a state space using a block Kronecker product. The static and dynamic formation control protocols are proposed respectively, and the graph theory is used to prove that formation control protocols can realize system formation. Furthermore, the optimal control and cooperative control are introduced into the static and the dynamic formation control protocols, and the static cooperative optimal formation control protocol and the dynamic cooperative optimal formation control protocol are designed. Through MATLAB simulation, the static cooperative optimal control protocol and static formation control protocol are compared, and the dynamic cooperative optimal control protocol and dynamic formation control protocol are compared. By comparison, the state variables of the system can reach convergence quickly, and the system can complete formation in a short time, which verifies the effectiveness of the optimal theory and cooperative control.
This paper studies the problem of time-varying formation-tracking control for a class of nonlinear multi-agent systems. A distributed adaptive controller that avoids the global non-zero minimum eigenvalue is designed for heterogeneous systems in which leaders and followers contain different nonlinear terms, and which relies only on the relative errors between adjacent agents. By adopting the Riccati inequality method, the adaptive adjustment factor in the controller is designed to solve the problem of automatically adjusting relative errors based solely on local information. Unlike existing research on time-varying formations with fixed and switching topologies, the method of jointly connected topological graphs is adopted to enable nonlinear followers to track the trajectories of leaders with different nonlinear terms and simultaneously achieve the control objective of the desired time-varying formation. The stability of the system under the jointly connected graph is proved by the Lyapunov stability proof method. Finally, numerical simulation experiments confirm the effectiveness of the proposed control method.
This paper proposes a fixed-time formation-tracking control problem for a heterogeneous multi-agent system (MAS) consisting of six unmanned aerial vehicles (UAVs) and three unmanned ground vehicles (UGVs) under actuator attacks, external disturbances, and input saturation. First, a distributed sliding mode estimator and controller tailored for UAV-UGV heterogeneous systems are proposed based on sliding mode techniques. Second, by integrating repulsive potential functions with sliding manifolds, a distributed fixed-time adaptive sliding mode control protocol was designed. This protocol ensures collision avoidance while enabling the MASs to track desired trajectories and achieve a predefined formation configuration within a fixed time. The fixed-time stability of the closed-loop system was rigorously proven via Lyapunov theory.
This study explores fault-tolerant consensus in leader–following heterogeneous multi-agent systems, focusing on actuator failures in uncrewed aerial vehicles (UAVs) and uncrewed ground vehicles (UGVs). An optimization-based fault-tolerant consensus algorithm is proposed. The algorithm utilizes the Euler–Lagrange formula to ensure system consistency under actuator failures, with the Lyapunov stability theory proving the asymptotic stability of the consistency error. The algorithm is applied to heterogeneous multi-agent systems of UAVs and UGVs to derive optimal fault-tolerant consensus control laws for each vehicle type. Simulation experiments give evidence for the feasibility of the proposed control strategy.
This paper investigates the practical prescribed-time trajectory tracking consensus control problem for nonlinear heterogeneous multi-agent systems subject to mismatched uncertainties and non-vanishing disturbances, which cannot be directly compensated through control inputs. A time-varying scaling function defined by piecewise power functions is adopted, and a distributed controller is designed using the adaptive backstepping method. The study proposes a practical prescribed-time trajectory tracking consensus algorithm for heterogeneous multi-agent systems that avoids the use of infinite control gains. Unlike prescribed-time consensus tracking methods for heterogeneous multi-agent systems based on control switching, which involve discontinuities at switching points due to infinite control gains, the proposed control scheme incorporates softening units to ensure continuous control actions at segment points. Furthermore, the proposed control approach is effective over the entire time interval without requiring prior knowledge of the upper or lower bounds of gi,m, thereby broadening its applicability. Finally, theoretical analysis and simulation experiments validate the rationality and effectiveness of the proposed method.
This document tackles the issue of distributed adaptive tracking control for generic linear multi-agent systems. Specifically, the focus is on linear systems with non-zero control inputs from the leader, which are not directly accessible to the follower. Unlike existing literature limited to fixed topologies, this study tackles the challenge of switching topologies. A distributed discontinuous adaptive tracking controller uses Riccati inequalities and based on the state errors between neighboring agents. This controller adaptively adjusts the coupling weights between adjacent agents and ensures that switching communication topologies does not affect follower agent communication and remains undirected, allowing the leader to reach all followers via a directed path in the joint graph. This paper also examines stable multi-agent systems using fixed and dynamic network configurations. A communication graph in which the leader is bound by their control inputs is shown to be able to demonstrate such behavior, provided that the graph is jointly connected. A description of the followers’ states will effectively approach and converge on the leader’s state. An additional simulation experiment confirms its effectiveness and robustness of suggested method.