OCLGSYFeb 18, 2017

Bi-Level Online Control without Regret

arXiv:1702.05548v1
Originality Incremental advance
AI Analysis

This work addresses real-time control problems in nonstationary environments, such as electrical grid management, but appears incremental as it builds on existing online optimization and control frameworks.

The paper tackles the problem of bi-level discrete-time control with real-time constraints by proposing an online control algorithm that achieves small dynamic regret, bridging online convex optimization and real-time control literature, and demonstrates its application to controlling power setpoints in an electrical grid.

This paper considers a bi-level discrete-time control framework with real-time constraints, consisting of several local controllers and a central controller. The objective is to bridge the gap between the online convex optimization and real-time control literature by proposing an online control algorithm with small dynamic regret, which is a natural performance criterion in nonstationary environments related to real-time control problems. We illustrate how the proposed algorithm can be applied to real-time control of power setpoints in an electrical grid.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes