Papers › Online Distributed Algorithm for Optimal Power Flow problem with Regret Analysis
Online Distributed Algorithm for Optimal Power Flow problem with Regret Analysis
Sushobhan Chatterjee, Rachel Kalpana Kalaimani
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We investigate the distributed DC-Optimal Power Flow (DC-OPF) problem for a dynamic and uncertain environment. The unpredictable supply of renewable resources and varying prices of the electricity market are a few factors responsible for the uncertainty. We propose to address this problem using the framework of online convex optimization, where the cost functions are not known apriori because of the uncertainty and are revealed only incrementally over time. We also consider a distributed setting, where each agent (generators and loads) in the power network is only privy to their own local objectives and constraints but can communicate with their neighbours. A distributed online algorithm is proposed based on the modified primal-dual approach. The performance of the online algorithm is evaluated using the regret (static) function, which is the difference between the actual cost incurred by employing the proposed algorithm and the optimal fixed decision in hindsight. Since we deal with a constrained optimization problem, analogous to the notion of regret the accumulation of the constraint violation is also calculated at each step. We establish a sub-linear bound on the static regret and constraint violation under suitable assumptions on step-size and cost function. Finally, we use the standard IEEE-14 bus system to demonstrate the performance of our algorithm.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections