Inferring Switched Nonlinear DynamicalSystems
Authors:
Open Access
- 1 June 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 33 (3) , 385-406
Abstract
Identification of dynamical and hybrid systems using trajectory data is an important way to construct models for complex systems where derivation from first principles is too difficult. In this paper, we study the identification problem for switched dynamical systems with polynomial ODEs. This is a difficult problem as it combines estimating coefficients for nonlinear dynamics and determining boundaries between modes. We propose two different algorithms for this problem, depending on whether to perform prior segmentation of trajectories. For methods with prior segmentation, we present a heuristic segmentation algorithm and a way to classify themodes using clustering. Formethods without prior segmentation, we extend identification techniques for piecewise affine models to our problem. To estimate derivatives along the given trajectories, we use Linear MultistepMethods. Finally, we propose a way to evaluate an identified model by computing a relative difference between the predicted and actual derivatives. Based on this evaluation method, we perform experiments on five switched dynamical systems with different parameters, for a total of twenty cases. We also compare with three baseline methods: clustering with DBSCAN, standard optimization methods in SciPy and identification of ARX models in Matlab, as well as with state-of-the-art identification method for piecewise affine models. The experiments show that our two methods perform better across a wide range of situations.Keywords
Funding Information
- National Natural Science Foundation of China
This publication has 39 references indexed in Scilit:
- Efficiently identifying deterministic real-time automata from labeled dataMachine Learning, 2011
- The efficiency of identifying timed automata and the power of clocksInformation and Computation, 2011
- Segmentation of ARX-models using sum-of-norms regularizationAutomatica, 2010
- Inferring Mealy Machines2009
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages2008
- A clustering technique for the identification of piecewise affine systemsAutomatica, 2003
- IDENTIFYING REGULAR LANGUAGES IN POLYNOMIAL TIME1993
- Algorithms for the optimal identification of segment neighborhoodsBulletin of Mathematical Biology, 1989
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- A generalized inverse for matricesMathematical Proceedings of the Cambridge Philosophical Society, 1955