Reachable set control of singular semi-Markov jump multi-agent systems with input delay via state decomposition method

This paper addresses the challenge of reachable set estimation in singular multi-agent systems with time-delay and semi-Markov switching topologies. The primary goal is to construct an ellipsoid that encompasses all states originating from the origin. Furthermore, criteria for reachable sets with reduced conservatism are developed. The singular multi-agent systems are reduced by the Laplace matrix, then the Lyapunov–Krasovskii functional is constructed by using decomposed state vector. In addition, the sufficient conditions for the reachable set of singular multi-agent systems bounded by ellipsoids are given by matrix theory and linear matrix inequality. Numerical examples show that our results is effective.