The identification of switched systems amounts to a mixed integer nonlinear optimization problem, where the continuous variables are associated to the model parameterizations of the different modes, and the discrete ones are related to the switching signal (each data sample is assigned to a mode, and switching occurs when the mode assignment changes over time). In the batch form of the identification problem, the combinatorial complexity increases exponentially with the size of the training set, which makes the precise identification of the switching signal the most challenging task in the identification problem. To tackle this complexity we propose a distributed optimization approach, based on the solution of multiple instances of a much simpler problem, where switching can occur only at specific time instants (different for each subproblem), and an information sharing mechanism that preserves likely switching times to improve the local solutions. We employ an adapted version of a previously developed randomized algorithm to solve the individual subproblems. Another important feature of the proposed method is an a posteriori heuristic correction method, that is applied to further refine the switching locations based on the estimated local models before the information sharing phase. The performance of the proposed algorithm is analyzed and compared with other methods on synthetic datasets.

A distributed randomized method for the identification of switched ARX systems

Yu, Miao;Piroddi, Luigi
2024-01-01

Abstract

The identification of switched systems amounts to a mixed integer nonlinear optimization problem, where the continuous variables are associated to the model parameterizations of the different modes, and the discrete ones are related to the switching signal (each data sample is assigned to a mode, and switching occurs when the mode assignment changes over time). In the batch form of the identification problem, the combinatorial complexity increases exponentially with the size of the training set, which makes the precise identification of the switching signal the most challenging task in the identification problem. To tackle this complexity we propose a distributed optimization approach, based on the solution of multiple instances of a much simpler problem, where switching can occur only at specific time instants (different for each subproblem), and an information sharing mechanism that preserves likely switching times to improve the local solutions. We employ an adapted version of a previously developed randomized algorithm to solve the individual subproblems. Another important feature of the proposed method is an a posteriori heuristic correction method, that is applied to further refine the switching locations based on the estimated local models before the information sharing phase. The performance of the proposed algorithm is analyzed and compared with other methods on synthetic datasets.
2024
distributed optimization, identification, randomized algorithms, switched systems identification
File in questo prodotto:
File Dimensione Formato  
dRanSId_Submission_ACSP_YuBianchiPiroddi.pdf

Accesso riservato

Descrizione: Articolo principale
: Pre-Print (o Pre-Refereeing)
Dimensione 681.57 kB
Formato Adobe PDF
681.57 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/1261356
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact