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.展开更多
基金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.
