TY - GEN
T1 - Reachability Based Uniform Controllability to Target Set with Evolution Function
AU - Geng, Jia
AU - Hu, Ruiqi
AU - Liu, Kairong
AU - Li, Zhihui
AU - She, Zhikun
N1 - Publisher Copyright:
© 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
PY - 2024
Y1 - 2024
N2 - In this paper, we investigate the uniform controllability to target set for dynamical systems by designing controllers such that the trajectories evolving from the initial set can enter into the target set. For this purpose, we first introduce the evolution function (EF) for exactly describing the reachable set and give an over-approximation of the reachable set with high precision using the series representation of the evolution function. Subsequently, we propose an approximation approach for Hausdorff semi-distance with a bounded rectangular grid, which can be used to guide the selection of controllers. Based on the above two approximations, we design a heuristic framework to compute a piecewise constant controller, realizing the controllability. Moreover, in order to reduce the computational load, we improve our heuristic framework by the K-arm Bandit Model in reinforcement learning. It is worth noting that both of the heuristic algorithms may suffer from the risk of local optima. To avoid the potential dilemma, we additionally propose a reference trajectory based algorithm for further improvement. Finally, we use some benchmarks with comparisons to show the efficiency of our approach.
AB - In this paper, we investigate the uniform controllability to target set for dynamical systems by designing controllers such that the trajectories evolving from the initial set can enter into the target set. For this purpose, we first introduce the evolution function (EF) for exactly describing the reachable set and give an over-approximation of the reachable set with high precision using the series representation of the evolution function. Subsequently, we propose an approximation approach for Hausdorff semi-distance with a bounded rectangular grid, which can be used to guide the selection of controllers. Based on the above two approximations, we design a heuristic framework to compute a piecewise constant controller, realizing the controllability. Moreover, in order to reduce the computational load, we improve our heuristic framework by the K-arm Bandit Model in reinforcement learning. It is worth noting that both of the heuristic algorithms may suffer from the risk of local optima. To avoid the potential dilemma, we additionally propose a reference trajectory based algorithm for further improvement. Finally, we use some benchmarks with comparisons to show the efficiency of our approach.
KW - Controllability
KW - Evolution function
KW - Reachability
KW - Reference trajectory
KW - Reinforcement learning
UR - https://www.scopus.com/pages/publications/85180621300
U2 - 10.1007/978-981-99-8664-4_2
DO - 10.1007/978-981-99-8664-4_2
M3 - 会议稿件
AN - SCOPUS:85180621300
SN - 9789819986637
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 21
EP - 37
BT - Dependable Software Engineering. Theories, Tools, and Applications - 9th International Symposium, SETTA 2023, Proceedings
A2 - Hermanns, Holger
A2 - Sun, Jun
A2 - Bu, Lei
PB - Springer Science and Business Media Deutschland GmbH
T2 - 9th International Symposium on Dependable Software Engineering: Theories, Tools and Applications, SETTA 2023
Y2 - 27 November 2023 through 29 November 2023
ER -