Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2412.18492 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929646477508608 |
|---|---|
| author | Anantharaman, Ramachandran Mauroy, Alexandre |
| author_facet | Anantharaman, Ramachandran Mauroy, Alexandre |
| contents | In this work, we develop a method to identify continuous-time nonlinear networked dynamics via the Koopman operator framework. The proposed technique consists of two steps: the first step identifies the neighbors of each node, and the second step identifies the local dynamics at each node from a predefined set of dictionary functions. The technique can be used to either identify the Boolean network of interactions (first step) or to solve the complete network identification problem that amounts to estimating the local node dynamics and the nature of the node interactions (first and second steps). Under a sparsity assumption, the data required to identify the complete network dynamics is significantly less than the total number of dictionary functions describing the dynamics. This makes the proposed approach attractive for identifying large dimensional networks with sparse interconnections. The accuracy and performance of the proposed identification technique are demonstrated with several examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_18492 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Koopman operator based identification of nonlinear networks Anantharaman, Ramachandran Mauroy, Alexandre Systems and Control In this work, we develop a method to identify continuous-time nonlinear networked dynamics via the Koopman operator framework. The proposed technique consists of two steps: the first step identifies the neighbors of each node, and the second step identifies the local dynamics at each node from a predefined set of dictionary functions. The technique can be used to either identify the Boolean network of interactions (first step) or to solve the complete network identification problem that amounts to estimating the local node dynamics and the nature of the node interactions (first and second steps). Under a sparsity assumption, the data required to identify the complete network dynamics is significantly less than the total number of dictionary functions describing the dynamics. This makes the proposed approach attractive for identifying large dimensional networks with sparse interconnections. The accuracy and performance of the proposed identification technique are demonstrated with several examples. |
| title | Koopman operator based identification of nonlinear networks |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2412.18492 |