Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Search articles, authors, keywords, DOl and etc.
Controllability is a fundamental property of control systems, serving as the prerequisite for controller design. While controllability test is well established in modelic (i.e., model-driven) control systems, extending it to datatic (i.e., data-driven) control systems is still a challenging task due to the absence of system models. In this study, we propose a general controllability test method for nonlinear systems with datatic description, where the system behaviors are merely described by data. In this situation, the state transition information of a dynamic system is available only at a limited number of data points, leaving the behaviors beyond these points unknown. Different from traditional exact controllability, we introduce a new concept called ϵ-controllability, which extends the definition from point-to-point form to point-to-region form. Accordingly, our focus shifts to checking whether the system state can be steered to a closed state ball centered on the target state, rather than exactly at that target state. Given a known state transition sample, the Lipschitz continuity assumption restricts the one-step transition of all the points in a state ball to a small neighborhood of the subsequent state. This property is referred to as one-step controllability backpropagation, i.e., if the states within this neighborhood are ϵ-controllable, those within the state ball are also ϵ-controllable. On its basis, we propose a tree search algorithm called maximum expansion of controllable subset (MECS) to identify controllable states in the dataset. Starting with a specific target state, our algorithm can iteratively propagate controllability from a known state ball to a new one. This iterative process gradually enlarges the ϵ-controllable subset by incorporating new controllable balls until all ϵ-controllable states are searched. Besides, a simplified version of MECS is proposed by solving a special shortest path problem, called Floyd expansion with radius fixed (FERF). FERF maintains a fixed radius of all controllable balls based on a mutual controllability assumption of neighboring states. The effectiveness of our method is validated in three datatic control systems whose dynamic behaviors are described by sampled data.
Bentley, J.L., 1975. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 509–517.
Gershwin, S., Jacobson, D., 1971. A controllability theory for nonlinear systems. IEEE Trans. Automat. Control 16, 37–46.
Guan, Y., Li, S.E., Duan, J., Li, J., Ren, Y., Sun, Q., Cheng, B., 2021. Direct and indirect reinforcement learning. Int. J. Intell. Syst. 36, 4439–4467.
Hermann, R., Krener, A., 1977. Nonlinear controllability and observability. IEEE Trans. Automat. Control 22, 728–740.
Hussein, A., Gaber, M.M., Elyan, E., Jayne, C., 2017. Imitation learning: a survey of learning methods. ACM Comput. Surv. 50, 1–35.
Kalman, R.E., 1963. Mathematical description of linear dynamical systems. J. Soc. Ind. Appl. Math. Control 1, 152–192.
Liu, D., Yan, P., Wei, Q., 2014. Data-based analysis of discrete-time linear systems in noisy environment: controllability and observability. Inf. Sci. 288, 314–329.
Mishra, V.K., Markovsky, I., Grossmann, B., 2021. Data-driven tests for controllability. IEEE Control Syst. Lett 5, 517–522.
Shaker, H.R., Lazarova-Molnar, S., 2017. A new data-driven controllability measure with application in intelligent buildings. Energy Build. 138, 526–529.
Van Waarde, H.J., Eising, J., Trentelman, H.L., Camlibel, M.K., 2020. Data informativity: a new perspective on data-driven analysis and control. IEEE Trans. Automat. Control 65, 4753–4768.
Wang, Z., Liu, D., 2011. Data-based controllability and observability analysis of linear discrete-time systems. IEEE Trans. Neural Network. 22, 2388–2392.
Yamamoto, Y., 1977. Controllability of nonlinear systems. J. Optim. Theor. Appl. 22, 41–49.
Yang, Y., Zheng, Z., Li, S.E., 2024. On the stability of datatic control systems. arXiv preprint arXiv:2401.16793.
Ye, Y., Tse, E., 1989. An extension of karmarkar's projective algorithm for convex quadratic programming. Math. Program. 44, 157–179.
Zhan, G., Zheng, Z., Li, S.E., 2024. Canonical form of datatic description in control systems. arXiv preprint arXiv:2403.01768.
This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).