A Bernstein Polynomial Approach to Estimating Reachable Set of Periodic Piecewise Polynomial Systems
Xiaochen Xie, Chenchen Fan, Ka‐Wai Kwok, James Lam
Abstract
In this article, a Bernstein polynomial approach is first applied to the estimation of reachable set for a class of periodic piecewise polynomial systems, whose subsystems are time-varying and can be expanded to Bernstein polynomial forms. A lemma on the negativity/positivity for a class of Bernstein polynomial matrix functions is presented, which can provide a feasible set larger than that by the existing method. Based on the integration of the presented lemma and the theory of matrix polynomials, two tractable sufficient conditions are developed. For comparison of conservatism, the reachable set estimation is achieved through optimizing the ellipsoidal bounding region. Four sets of constraints with different conservatism are derived and compared. The effectiveness and superiority of the Bernstein polynomial approach in reachable set estimation are demonstrated via an illustrative example. The results show that the proposed approach enables lower conservatism in reachable set estimation, providing an intuitive route to tackle time-varying parameter products with high powers.