Tuesday, April 17, 201810:30 AM - 12:00 PMCNLS Conference Room (TA-3, Bldg 1690)|
Sparse Tableau Formulation for Power System Networks and Its Applications
Byungkwon ParkUniversity of Wisconsin
Electric power systems optimization and control have long, well-studied history for grid modeling. Although many excellent texts and tutorial carefully describes this classical grid modeling, choices of such power system representations are inevitably made in context of specific component technologies, operational objectives and computational tools. However, as grid see rapid changes in its network elements (e.g. FACT devices), operational objectives (e.g. integration of distributed energy resources) and computational tools (e.g. advanced optimization and control applications), approaches to grid modeling benefit from re-examination.
To this end, this work has focused on developing grid models, which move from those classical concepts toward the most effective models and representations based on the multiport representations of components, and Sparse Tableau Formulation (STF) of network constraints. STF adopts a straightforward, algorithmic approach in network constraint formulation that clearly establishes the conceptual origin of each constraint (either KCL, KVL, or individual component behavior), and is well suited to facilitate researches. In this talk, I will discuss the construction of STF for power system networks including the relationship to other modeling approaches and provide its various applications with the optimal power flow (OPF) problem. I will also discuss some general insight and experience about STF for power system networks based on the results.
Host: Russell Bent