2005
DOI: 10.1016/j.automatica.2004.12.005
|View full text |Cite
|
Sign up to set email alerts
|

Identification of piecewise affine systems based on statistical clustering technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
73
0
1

Year Published

2015
2015
2020
2020

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 167 publications
(74 citation statements)
references
References 23 publications
0
73
0
1
Order By: Relevance
“…These main types of approaches were classified as optimisationbased, algebraic and recursive methods for Switched ARX (SARX) models, optimisationbased and clustering-based methods for PieceWise ARX (PWARX) models, and batch and recursive methods for state-space systems. According to Garulli et al (2012), a common feature of the approaches, which is present in works such as Vidal et al (2003), Roll et al (2004), Ferrari-Trecate et al (2003), Nakada et al (2005), Juloski et al (2005) and Bemporad et al (2005), is that they lead to suboptimal solutions to the problem of inferring a PWARX model from data, while keeping an affordable computational burden.…”
Section: A Brief Review Of the Multi-model Systemsmentioning
confidence: 99%
“…These main types of approaches were classified as optimisationbased, algebraic and recursive methods for Switched ARX (SARX) models, optimisationbased and clustering-based methods for PieceWise ARX (PWARX) models, and batch and recursive methods for state-space systems. According to Garulli et al (2012), a common feature of the approaches, which is present in works such as Vidal et al (2003), Roll et al (2004), Ferrari-Trecate et al (2003), Nakada et al (2005), Juloski et al (2005) and Bemporad et al (2005), is that they lead to suboptimal solutions to the problem of inferring a PWARX model from data, while keeping an affordable computational burden.…”
Section: A Brief Review Of the Multi-model Systemsmentioning
confidence: 99%
“…It uses K‐means algorithm for clustering, and requires the piecewise linear function to be convex. Researchers use K‐means clustering technique or variations derived from that. The downside of this approach is that there is no guarantee that the union of regions obtained by clustering is able to cover the whole area of the original domain without gaps where the model is actually defined.…”
Section: Integration Of Scheduling and Control Based On Pwa Modelmentioning
confidence: 99%
“…The statistical clustering technique in (Nakada H, 2005) first computes the parameters of the affine local models, then partition of the regressor space. The greedy algorithm of (Sim one Paoletti, 2008) to partition in feasible sets of linear inequalities can be computationally heavy in case of large training sets.…”
Section: Introductionmentioning
confidence: 99%