Virtual Capacitor Concept for Partitioning of Large Converter Systems for RT-HIL Simulations

Related publications (28)

About
Privacy
Disclaimer

Graph Chatbot

Impact of Interface Traps in Floating-Gate Memory Based on Monolayer MoS2

Two-dimensional materials (2DMs) have found potential applications in many areas of electronics, such as sensing, memory systems, optoelectronics, and power. Despite an intense experimental work, the literature is lacking of accurate modeling of nonvolatil ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Virtual Capacitor Concept for Effective Real-Time MMC Simulations

Drazen Dujic, Stefan Milovanovic, Min Luo

In this paper, the real-time simulation model of the modular multilevel converter was split into several independent parts through the use of the virtual capacitor concept. As a result, the number of state-space matrices the real-time solver needs to take ...

2021

Virtual Capacitor Concept for Computationally Efficient and Flexible Real-Time MMC Model

Drazen Dujic, Stefan Milovanovic, Min Luo

This paper demonstrates the splitting of the modular multilevel converter real-time simulation model into several independent parts through the use of the virtual capacitor concept. As a result, the number of state-space matrices the real-time solver needs ...

2021

Self-learning surrogate models in superstructure optimization

François Maréchal, Ivan Daniel Kantor, Julia Granacher, Michel Lopez

In this contribution, we propose an algorithm for replacing non-linear process simulation integrated in multi-level optimization of an energy system superstructure with surrogate models. With our approach, we demonstrate that surrogate models are a valid t ...

Elsevier2021

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Adam Teodor Polak

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Seeking Quality Diversity in Evolutionary Co-design of Morphology and Control of Soft Tensegrity Modular Robots

Dario Floreano, Davide Zappetti, Davide Zambrano, Giovanni Iacca

Designing optimal soft modular robots is difficult, due to non-trivial interactions between morphology and controller. Evolutionary algorithms (EAs), combined with physical simulators, represent a valid tool to overcome this issue. In this work, we investi ...

Association for Computing Machinery2021

Development of free-boundary equilibrium and transport solvers for simulation and real-time interpretation of tokamak experiments

Francesco Carpanese

To exploit fusion as a source of energy, a hot and dense confined plasma is needed. This is achieved in tokamaks by actively controlling the plasma state meaning shape, position and internal kinetic profiles. This thesis addresses two topics: the developme ...

EPFL2021

River morphology and sediment transport processes numerical modeling applied to the fluvial environment of the Rhône River in Valais

Giovanni De Cesare, Azin Amini, Jean-Noël Saugy, Francesc Molné Correig

Within the frame of the Third Rhône Correction, the river bend in Martigny is considered a top priority measure for flood protection. During the preliminary project, physical and numerical modeling tests were considered necessary. For the latter, the softw ...

International Research Society INTERPRAEVENT2021

Motivating Innovation: The Effect of Loss Aversion on the Willingness to Persist

Kenneth Younge

We investigate the willingness of individuals to persist at exploration in the face of failure. Prior research suggests that the organization's "tolerance for failure" may motivate greater exploration by the individual. Little is known, however, about how ...

MIT Press2020

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Mikhail Kapralov, Slobodan Mitrovic, Jakab Tardos, Ashkan Norouzi Fard

Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...

ASSOC COMPUTING MACHINERY2020

Page 2 of 3