Florian Dörfler

Florian Dörfler

Top Cited Scholar 2026
Auto-generated profile, based on publicly available information

Florian Dörfler

ETH Zurich, Zurich, Switzerland

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 June 2013 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
FPFabio Pasqualetti
Fabio Pasqualetti
FDFlorian Dorfler
Florian Dorfler
FBFrancesco Bullo
Francesco Bullo
Cyber-physical systems are ubiquitous in power systems, transportation networks, industrial control processes, and critical infrastructures. These systems need to operate reliably in the face of unforeseen failures and external malicious attacks. In this paper: (i) we propose a mathematical framework for cyber-physical systems, attacks, and monitors; (ii) we characterize fundamental monitoring limitations from system-theoretic and graph-theoretic perspectives; and (ii) we design centralized and distributed attack detection and identification monitors. Finally, we validate our findings through compelling examples.

25 July 2017 in IEEE Transactions on Smart Grid
Verified
Journal Article
Open access
DMDaniel Molzahn
Daniel Molzahn
FDFlorian Dorfler
Florian Dorfler
HSHenrik Sandberg
Henrik Sandberg
SLSteven H. Low
Steven H. Low
SCSambuddha Chakrabarti
Sambuddha Chakrabarti
JLJavad Lavaei
Javad Lavaei
Historically, centrally computed algorithms have been the primary means of power system optimization and control. With increasing penetrations of distributed energy resources requiring optimization and control of power systems with many controllable devices, distributed algorithms have been the subject of significant research interest. This paper surveys the literature of distributed algorithms with applications to optimization and control of power systems. In particular, this paper reviews distributed algorithms for offline solution of optimal power flow (OPF) problems as well as online algorithms for real-time solution of OPF, optimal frequency control, optimal voltage control, and optimal wide-area control problems.

1 June 2014 in Automatica
Verified
Journal Article
Closed access
FDFlorian Dörfler
Florian Dörfler
FBFrancesco Bullo
Francesco Bullo

14 January 2013 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
PDF file
FDFlorian Dörfler
Florian Dörfler
MCMichael (Misha) Chertkov
Michael (Misha) Chertkov
FBFrancesco Bullo
Francesco Bullo
The emergence of synchronization in a network of coupled oscillators is a fascinating topic in various scientific disciplines. A widely adopted model of a coupled oscillator network is characterized by a population of heterogeneous phase oscillators, a graph describing the interaction among them, and diffusive and sinusoidal coupling. It is known that a strongly coupled and sufficiently homogeneous network synchronizes, but the exact threshold from incoherence to synchrony is unknown. Here, we present a unique, concise, and closed-form condition for synchronization of the fully nonlinear, nonequilibrium, and dynamic network. Our synchronization condition can be stated elegantly in terms of the network topology and parameters or equivalently in terms of an intuitive, linear, and static auxiliary system. Our results significantly improve upon the existing conditions advocated thus far, they are provably exact for various interesting network topologies and parameters; they are statistically correct for almost all networks; and they can be applied equally to synchronization phenomena arising in physics and biology as well as in engineered oscillator networks, such as electrical power networks. We illustrate the validity, the accuracy, and the practical applicability of our results in complex network scenarios and in smart grid applications.

22 May 2015 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Open access
JSJohn W. Simpson-Porco
John W. Simpson-Porco
QSQobad Shafiee
Qobad Shafiee
FDFlorian Dorfler
Florian Dorfler
Juan C. VasquezJuan C. Vasquez
Juan C. Vasquez
Josep M. GuerreroJosep M. Guerrero
Josep M. Guerrero
FBFrancesco Bullo
Francesco Bullo
In this paper, we present new distributed controllers for secondary frequency and voltage control in islanded microgrids. Inspired by techniques from cooperative control, the proposed controllers use localized information and nearest-neighbor communication to collectively perform secondary control actions. The frequency controller rapidly regulates the microgrid frequency to its nominal value while maintaining active power sharing among the distributed generators. Tuning of the voltage controller provides a simple and intuitive tradeoff between the conflicting goals of voltage regulation and reactive power sharing. Our designs require no knowledge of the microgrid topology, impedances, or loads. The distributed architecture allows for flexibility and redundancy, eliminating the need for a central microgrid controller. We provide a voltage stability analysis and present extensive experimental results validating our designs, verifying robust performance under communication failure and during plug-and-play operation.

28 September 2012 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
FDFlorian Dorfler
Florian Dorfler
FBFrancesco Bullo
Francesco Bullo
Consider a weighted undirected graph and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to self-loops. The Kron reduction of this graph is again a graph whose Laplacian matrix is obtained by the Schur complement of the original Laplacian matrix with respect to a specified subset of nodes. The Kron reduction process is ubiquitous in classic circuit theory and in related disciplines such as electrical impedance tomography, smart grid monitoring, transient stability assessment, and analysis of power electronics. Kron reduction is also relevant in other physical domains, in computational applications, and in the reduction of Markov chains. Related concepts have also been studied as purely theoretic problems in the literature on linear algebra. In this paper we analyze the Kron reduction process from the viewpoint of algebraic graph theory. Specifically, we provide a comprehensive and detailed graph-theoretic analysis of Kron reduction encompassing topological, algebraic, spectral, resistive, and sensitivity analyses. Throughout our theoretic elaborations we especially emphasize the practical applicability of our results to various problem setups arising in engineering, computation, and linear algebra. Our analysis of Kron reduction leads to novel insights both on the mathematical and the physical side.