Hybrid system identification via sparse polynomial optimization

Chao Feng, Constantino Manuel Lagoa, Mario Sznaier

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    25 Citations (Scopus)

    Abstract

    In this paper, the problem of identifying discrete time affine hybrid systems with measurement noise is considered. Given a finite collection of measurements and a bound on the noise, the objective is to identify a hybrid system with the smallest number of sub-systems that is compatible with the a priori information. While this problem has been addressed in the literature if the input/output data is noise-free or corrupted by process noise, it remains open for the case of measurement noise. To handle this case, we propose a new approach based on recasting the problem into a polynomial optimization form and exploiting its inherent sparse structure to obtain computationally tractable problems. Combining these ideas with a randomized Hit and Run type approach leads to further computational complexity reduction, allowing for solving realistically sized problems. Numerical examples are provided, illustrating the effectiveness of the algorithm and its potential to handle large size problems.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 2010 American Control Conference, ACC 2010
    Pages160-165
    Number of pages6
    StatePublished - Oct 15 2010
    Event2010 American Control Conference, ACC 2010 - Baltimore, MD, United States
    Duration: Jun 30 2010Jul 2 2010

    Publication series

    NameProceedings of the 2010 American Control Conference, ACC 2010

    Other

    Other2010 American Control Conference, ACC 2010
    CountryUnited States
    CityBaltimore, MD
    Period6/30/107/2/10

    Fingerprint

    Hybrid systems
    Identification (control systems)
    Polynomials
    Computational complexity

    All Science Journal Classification (ASJC) codes

    • Control and Systems Engineering

    Cite this

    Feng, C., Lagoa, C. M., & Sznaier, M. (2010). Hybrid system identification via sparse polynomial optimization. In Proceedings of the 2010 American Control Conference, ACC 2010 (pp. 160-165). [5531243] (Proceedings of the 2010 American Control Conference, ACC 2010).
    Feng, Chao ; Lagoa, Constantino Manuel ; Sznaier, Mario. / Hybrid system identification via sparse polynomial optimization. Proceedings of the 2010 American Control Conference, ACC 2010. 2010. pp. 160-165 (Proceedings of the 2010 American Control Conference, ACC 2010).
    @inproceedings{8ddc25e256254a7d9b7d9cb4771083cb,
    title = "Hybrid system identification via sparse polynomial optimization",
    abstract = "In this paper, the problem of identifying discrete time affine hybrid systems with measurement noise is considered. Given a finite collection of measurements and a bound on the noise, the objective is to identify a hybrid system with the smallest number of sub-systems that is compatible with the a priori information. While this problem has been addressed in the literature if the input/output data is noise-free or corrupted by process noise, it remains open for the case of measurement noise. To handle this case, we propose a new approach based on recasting the problem into a polynomial optimization form and exploiting its inherent sparse structure to obtain computationally tractable problems. Combining these ideas with a randomized Hit and Run type approach leads to further computational complexity reduction, allowing for solving realistically sized problems. Numerical examples are provided, illustrating the effectiveness of the algorithm and its potential to handle large size problems.",
    author = "Chao Feng and Lagoa, {Constantino Manuel} and Mario Sznaier",
    year = "2010",
    month = "10",
    day = "15",
    language = "English (US)",
    isbn = "9781424474264",
    series = "Proceedings of the 2010 American Control Conference, ACC 2010",
    pages = "160--165",
    booktitle = "Proceedings of the 2010 American Control Conference, ACC 2010",

    }

    Feng, C, Lagoa, CM & Sznaier, M 2010, Hybrid system identification via sparse polynomial optimization. in Proceedings of the 2010 American Control Conference, ACC 2010., 5531243, Proceedings of the 2010 American Control Conference, ACC 2010, pp. 160-165, 2010 American Control Conference, ACC 2010, Baltimore, MD, United States, 6/30/10.

    Hybrid system identification via sparse polynomial optimization. / Feng, Chao; Lagoa, Constantino Manuel; Sznaier, Mario.

    Proceedings of the 2010 American Control Conference, ACC 2010. 2010. p. 160-165 5531243 (Proceedings of the 2010 American Control Conference, ACC 2010).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Hybrid system identification via sparse polynomial optimization

    AU - Feng, Chao

    AU - Lagoa, Constantino Manuel

    AU - Sznaier, Mario

    PY - 2010/10/15

    Y1 - 2010/10/15

    N2 - In this paper, the problem of identifying discrete time affine hybrid systems with measurement noise is considered. Given a finite collection of measurements and a bound on the noise, the objective is to identify a hybrid system with the smallest number of sub-systems that is compatible with the a priori information. While this problem has been addressed in the literature if the input/output data is noise-free or corrupted by process noise, it remains open for the case of measurement noise. To handle this case, we propose a new approach based on recasting the problem into a polynomial optimization form and exploiting its inherent sparse structure to obtain computationally tractable problems. Combining these ideas with a randomized Hit and Run type approach leads to further computational complexity reduction, allowing for solving realistically sized problems. Numerical examples are provided, illustrating the effectiveness of the algorithm and its potential to handle large size problems.

    AB - In this paper, the problem of identifying discrete time affine hybrid systems with measurement noise is considered. Given a finite collection of measurements and a bound on the noise, the objective is to identify a hybrid system with the smallest number of sub-systems that is compatible with the a priori information. While this problem has been addressed in the literature if the input/output data is noise-free or corrupted by process noise, it remains open for the case of measurement noise. To handle this case, we propose a new approach based on recasting the problem into a polynomial optimization form and exploiting its inherent sparse structure to obtain computationally tractable problems. Combining these ideas with a randomized Hit and Run type approach leads to further computational complexity reduction, allowing for solving realistically sized problems. Numerical examples are provided, illustrating the effectiveness of the algorithm and its potential to handle large size problems.

    UR - http://www.scopus.com/inward/record.url?scp=77957779900&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77957779900&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:77957779900

    SN - 9781424474264

    T3 - Proceedings of the 2010 American Control Conference, ACC 2010

    SP - 160

    EP - 165

    BT - Proceedings of the 2010 American Control Conference, ACC 2010

    ER -

    Feng C, Lagoa CM, Sznaier M. Hybrid system identification via sparse polynomial optimization. In Proceedings of the 2010 American Control Conference, ACC 2010. 2010. p. 160-165. 5531243. (Proceedings of the 2010 American Control Conference, ACC 2010).