This paper focuses on the reachable set estimation for Markovian jump neural networks with time delay.By allowing uncertainty in the transition probabilities,a framework unifies and enhances the generality and realism...This paper focuses on the reachable set estimation for Markovian jump neural networks with time delay.By allowing uncertainty in the transition probabilities,a framework unifies and enhances the generality and realism of these systems.To fully exploit the unified uncertain transition probabilities,an equivalent transformation technique is introduced as an alternative to traditional estimation methods,effectively utilizing the information of transition probabilities.Furthermore,a vector Wirtinger-based summation inequality is proposed,which captures more system information compared to existing ones.Building upon these components,a novel condition that guarantees a reachable set estimation is presented for Markovian jump neural networks with unified uncertain transition probabilities.A numerical example is illustrated to demonstrate the superiority of the approaches.展开更多
In this paper,the problems of forward reachable set estimation and safety verification of uncertain nonlinear systems with polynomial dynamics are addressed.First,an iterative sums of squares(SOS)programming approach ...In this paper,the problems of forward reachable set estimation and safety verification of uncertain nonlinear systems with polynomial dynamics are addressed.First,an iterative sums of squares(SOS)programming approach is developed for reachable set estimation.It characterizes the over-approximations of the forward reachable sets by sub-level sets of time-varying Lyapunovlike functions that satisfy an invariance condition,and formulates the problem of searching for the Lyapunov-like functions as a bilinear SOS program,which can be solved via an iterative algorithm.To make the over-approximation tight,the proposed approach seeks to minimize the volume of the overapproximation set with a desired shape.Then,the reachable set estimation approach is extended for safety verification,via explicitly encoding the safety constraint such that the Lyapunov-like functions guarantee both reaching and avoidance.The efficiency of the presented method is illustrated by some numerical examples.展开更多
基金funded by National Key Research and Development Program of China under Grant 2022YFE0107300the Chongqing Technology Innovation and Application Development Special Key Project under Grant CSTB2022TIAD-KPX0162+3 种基金the National Natural Science Foundation of China under Grant U22A20101the Chongqing Technology Innovation and Application Development Special Key Project under Grant CSTB2022TIAD-CUX0015the Chongqing postdoctoral innovativetalents support program under Grant CQBX202205the China Postdoctoral Science Foundation under Grant 2023M730411.
文摘This paper focuses on the reachable set estimation for Markovian jump neural networks with time delay.By allowing uncertainty in the transition probabilities,a framework unifies and enhances the generality and realism of these systems.To fully exploit the unified uncertain transition probabilities,an equivalent transformation technique is introduced as an alternative to traditional estimation methods,effectively utilizing the information of transition probabilities.Furthermore,a vector Wirtinger-based summation inequality is proposed,which captures more system information compared to existing ones.Building upon these components,a novel condition that guarantees a reachable set estimation is presented for Markovian jump neural networks with unified uncertain transition probabilities.A numerical example is illustrated to demonstrate the superiority of the approaches.
基金supported in part by the National Natural Science Foundation of China under Grant Nos.12171159 and 61772203in part by the Zhejiang Provincial Natural Science Foundation of China under Grant No.LY20F020020。
文摘In this paper,the problems of forward reachable set estimation and safety verification of uncertain nonlinear systems with polynomial dynamics are addressed.First,an iterative sums of squares(SOS)programming approach is developed for reachable set estimation.It characterizes the over-approximations of the forward reachable sets by sub-level sets of time-varying Lyapunovlike functions that satisfy an invariance condition,and formulates the problem of searching for the Lyapunov-like functions as a bilinear SOS program,which can be solved via an iterative algorithm.To make the over-approximation tight,the proposed approach seeks to minimize the volume of the overapproximation set with a desired shape.Then,the reachable set estimation approach is extended for safety verification,via explicitly encoding the safety constraint such that the Lyapunov-like functions guarantee both reaching and avoidance.The efficiency of the presented method is illustrated by some numerical examples.