Query-Cost-Aware Cooperative Restoration Scheduling for Interconnected Low-Voltage Distribution Areas

Interconnected low-voltage distribution areas share flexible resources for post-fault service restoration. Acquiring current support information and confirming candidate schedules compete for communication resources. This paper proposes query-cost-aware cooperative restoration scheduling to coordinate neighbor queries and the timely activation of feasible restoration instructions. Shared soft-open-point transfers couple local three-phase dispatch, photovoltaic utilization, battery operation, and load service. Cached responses guide pre-query selection using predicted dual improvement per estimated communication cost. Permanent power-balance equalities provide numerically certified curvature bounds, while current endpoint responses determine the updates. Cooperative instructions are activated after fixed-transfer optimization, nonlinear three-phase four-wire power-flow validation, battery-energy validation, and joint confirmation. Across the main paired simulations, the capped mean time to reach 90% of the reference restoration increment decreases from 20.93 to 17.05 s relative to the Full neighborhood value baseline. In branch-isolation scenarios, 240 of 240 traces attain the target within 60 s, compared with 204 for the baseline. Full query with matched curvature also attains all targets, with a mean time of 17.08 s. These results support the timing improvement of the complete design.

Authors

Institutions

Publication Details

Journal
Energies
Published
2026-11-19
DOI
https://doi.org/10.3390/en19225608
Primary Topic
Optimal Power Flow Distribution
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Query-Cost-Aware Cooperative Restoration Scheduling for Interconnected Low-Voltage Distribution Areas

Xiaoxing Lu, Wenqiang Xie, Fangfang Zhu, Ziran Guo et al.
Energies
Optimal Power Flow Distribution
article

Query-Cost-Aware Cooperative Restoration Scheduling for Interconnected Low-Voltage Distribution Areas

Xiaoxing Lu, Wenqiang Xie, Fangfang Zhu, Ziran Guo, Xiaolong Xiao
article en

Abstract

Interconnected low-voltage distribution areas share flexible resources for post-fault service restoration. Acquiring current support information and confirming candidate schedules compete for communication resources. This paper proposes query-cost-aware cooperative restoration scheduling to coordinate neighbor queries and the timely activation of feasible restoration instructions. Shared soft-open-point transfers couple local three-phase dispatch, photovoltaic utilization, battery operation, and load service. Cached responses guide pre-query selection using predicted dual improvement per estimated communication cost. Permanent power-balance equalities provide numerically certified curvature bounds, while current endpoint responses determine the updates. Cooperative instructions are activated after fixed-transfer optimization, nonlinear three-phase four-wire power-flow validation, battery-energy validation, and joint confirmation. Across the main paired simulations, the capped mean time to reach 90% of the reference restoration increment decreases from 20.93 to 17.05 s relative to the Full neighborhood value baseline. In branch-isolation scenarios, 240 of 240 traces attain the target within 60 s, compared with 204 for the baseline. Full query with matched curvature also attains all targets, with a mean time of 17.08 s. These results support the timing improvement of the complete design.

EnergiesVol. 19(22)
State Grid Jiangsu Electric Power (China) (CN)
Optimal Power Flow Distribution
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon