Siirry päänavigointiin Siirry hakuun Siirry pääsisältöön

Suboptimal search strategies with bounded computational complexity to solve long-horizon direct model predictive control problems

    Tutkimustuotos: KonferenssiartikkeliTieteellinenvertaisarvioitu

    43 Sitaatiot (Scopus)
    16 Lataukset (Pure)

    Abstrakti

    Search algorithms that reduce the time to solve the direct model predictive control (MPC) problem are proposed in this paper. By allowing for suboptimal solutions, the computational complexity of the underlying optimization problem can be significantly reduced, albeit by sacrificing (to a certain degree) optimality. Two approaches are presented and discussed. The first approach requires quadratic time, making it a very efficient candidate for solving the examined problem. Thanks to the second approach, a preset upper limit on the operations performed in real time is not exceeded, thus guaranteeing realtime termination in all runs. To highlight the effectiveness of the introduced strategies, a variable speed drive system with a three-level voltage source inverter is used as an illustrative example.

    AlkuperäiskieliEnglanti
    Otsikko2015 IEEE Energy Conversion Congress and Exposition, ECCE 2015
    KustantajaIEEE
    Sivut334-341
    Sivumäärä8
    ISBN (elektroninen)9781467371506
    DOI - pysyväislinkit
    TilaJulkaistu - 21 syysk. 2015
    OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisussa
    Tapahtuma7th Annual IEEE Energy Conversion Congress and Exposition, ECCE 2015 - Montreal, Kanada
    Kesto: 20 syysk. 201524 syysk. 2015

    Conference

    Conference7th Annual IEEE Energy Conversion Congress and Exposition, ECCE 2015
    Maa/AlueKanada
    KaupunkiMontreal
    Ajanjakso20/09/1524/09/15

    !!ASJC Scopus subject areas

    • Energy Engineering and Power Technology
    • Electrical and Electronic Engineering

    Sormenjälki

    Sukella tutkimusaiheisiin 'Suboptimal search strategies with bounded computational complexity to solve long-horizon direct model predictive control problems'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

    Siteeraa tätä