A Polynomial-Based Approach of Reachable Set Estimation for Periodic Time-Varying Systems

This article is focused on estimating reachable sets for periodic time-varying systems, whose dynamics are represented by trigonometric series through Fourier theory. Given the difficulty of dealing with coupled time-varying coefficients in reachable set estimation, a constructive polynomial-based approach is utilized to transform time-varying nonconvex constraints into constant vertex constraints through the property of multiaffine matrix polynomials. Based on that, when the decay rate parameters for Lyapunov functions are known, the reachable set bounding region can be determined by solving vertex constraints in linear matrix inequality forms. In cases where the decay rates are unknown, a simulated annealing algorithm and a Boundary Intersection algorithm are proposed to provide a tractable solution for parameter searching, and to achieve lower conservatism in the reachable set bounding regions. The effectiveness of our polynomial-based approach is illustrated through simulations using a single-mesh gear system. Moreover, the efficiency of the two algorithms can be assessed by contrasting the conservatism reduced in measurements of bounding regions.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automatic Control
Published
2025-03-24
DOI
https://doi.org/10.1109/tac.2025.3554703
Citations
1
Primary Topic
Control Systems and Identification
Type
article
Field-Weighted Citation Impact
1.21
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Polynomial-Based Approach of Reachable Set Estimation for Periodic Time-Varying Systems

Zebin Ling, James Lam, Ka‐Wai Kwok, Xiaochen Xie
1 citations
IEEE Transactions on Automatic Control
Control Systems and Identification
1.21
article

A Polynomial-Based Approach of Reachable Set Estimation for Periodic Time-Varying Systems

Zebin Ling, James Lam, Ka‐Wai Kwok, Xiaochen Xie
article en
1 citations

Abstract

This article is focused on estimating reachable sets for periodic time-varying systems, whose dynamics are represented by trigonometric series through Fourier theory. Given the difficulty of dealing with coupled time-varying coefficients in reachable set estimation, a constructive polynomial-based approach is utilized to transform time-varying nonconvex constraints into constant vertex constraints through the property of multiaffine matrix polynomials. Based on that, when the decay rate parameters for Lyapunov functions are known, the reachable set bounding region can be determined by solving vertex constraints in linear matrix inequality forms. In cases where the decay rates are unknown, a simulated annealing algorithm and a Boundary Intersection algorithm are proposed to provide a tractable solution for parameter searching, and to achieve lower conservatism in the reachable set bounding regions. The effectiveness of our polynomial-based approach is illustrated through simulations using a single-mesh gear system. Moreover, the efficiency of the two algorithms can be assessed by contrasting the conservatism reduced in measurements of bounding regions.

IEEE Transactions on Automatic ControlVol. 70(9)
Shenzhen Institute of Information Technology (CN), Chinese University of Hong Kong (HK), Harbin Institute of Technology (CN), University of Hong Kong (HK)
Openalex Percentile: Top 24%
Control Systems and Identification
1.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.