Improved switching condition for reachable set estimation of discrete-time switched delayed neural networks

Abstract

This research delves into the reachable set estimation (RSE) problem for general switched delayed neural networks (SDNNs) in the discrete-time context. Note that existing relevant research on SDNNs predominantly relies on either time-dependent or state-dependent switching approaches. The time-dependent versions necessitate the stability of each subnetwork beforehand, whereas the state-dependent switching strategies solely depend on the current state, thus disregarding the historical information of the neuron states. For fully harnessing the historical information pertaining to neuron states, a delicate combined switching strategy (CSS) is formulated with the explicit goal of furnishing a relaxed and less conservative design framework tailored for discrete-time SDNNs, where all subnetworks can also be unstable. By resorting to the established time-dependent multiple Lyapunov–Krasovskii functional (TDMLF) technique, the improved criteria are subsequently presented, ensuring that the reachable set encompassing all potential states of SDNNs is confined to an anticipated bounded set. Ultimately, the practicality and superiority of the presented RSE approach are thoroughly validated by two illustrative simulation examples.