Search arXiv⌕ Search

arXiv · 2610.04167

The Price of a Cycle: A Phasor -vs- Sampled-Value Comparison for Streaming Fault Classification on the IEEE 9-Bus System

Abstract

Transmission-line fault classification is a time-critical protection function, and recent machine-learning methods classify fault type directly from voltage and current measurements. The input to such a classifier can be supplied as sampled-value windows of raw measurements, which preserve sub-cycle structure, or as phasor-domain sequence components, which are physically interpretable but require a causal one-cycle observation window before a phasor estimate is available. This paper measures the cost of that observation window, the price of a cycle, through a controlled comparison of the two representations for streaming fault-family classification on the standard synchronous WSCC/IEEE 9-bus system. The comparison holds the simulated system, the measured channels, the eleven-class event-family taxonomy, the training procedure, and the streaming decision layer constant, and uses six configurations: 40- and 80-sample sampled-value inputs and one-cycle phasor inputs, each evaluated with a multilayer perceptron (MLP) and a one-dimensional convolutional neural network (CNN). All six configurations classify every event successfully, yet the sampled-value representation reaches the correct class earlier in every model pair. The 40-sample sampled-value MLP attains the strongest result, with 99.34% fault-window accuracy, 99.79% normal accuracy, a 0.21% false-fault rate, a 0.65% false-normal rate, and a 2.81 ms mean first-correct delay, and it Pareto-dominates the other five configurations. A matched-window comparison at eighty samples confirms that the timing advantage follows from the representation rather than from the window length. On this clean synchronous benchmark, the one-cycle phasor representation does not return an accuracy or stability benefit sufficient to offset its delay.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emad Abukhousa, Khaled Muhmmed Nor Muhmmed, Abdulaziz Qwbaiban, Saman Zonouz, A. P. Sakis Meliopoulos. 2026-10-03. The Price of a Cycle: A Phasor -vs- Sampled-Value Comparison for Streaming Fault Classification on the IEEE 9-Bus System. https://arxiv.org/abs/2610.04167

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model

Despite advances in policy pretraining, embodied AI systems can plateau during task-specific fine-tuning as uniform scenario collection encounters fewer of the remaining failures. We address this problem with a policy-level recursive self-improvement loop: execution outcomes train a criticality world model, whose risk scores guide scenario collection for specialist training. To account for the resulting shift in scenario frequencies, weighted resampling approximately corrects the collection bias. Because specialized updates can weaken nominal behavior, a risk-based gate selects between the specialist and a frozen nominal policy at inference. We extend this procedure to reinforcement learning and behavior cloning. A sampling analysis characterizes the correction, while a controlled study examines the trade-off between critical and nominal coverage. Across five embodied domains, the composed systems reduce failure rates by 59--67% for locomotion and manipulation and 8--25% for VLA benchmarks relative to their respective baselines.

eess.SY↗

Closed-Loop Refinement and Execution for Learned Driving Planners

Learning-based driving planners are usually trained and evaluated in open loop against logged trajectories. In closed loop, a trajectory with small displacement error can still stall the vehicle, steer it into a conflict with surrounding agents, or be executed with abrupt braking. We introduce Closed-Loop Refinement and Execution (CLRE), a hierarchical receding-horizon control framework designed to mitigate these failure modes while leaving the upstream planner frozen and adding no new learned model. The upper layer treats the nominal trajectory as a reference and solves a finite-horizon optimal control problem that trades route progress against interaction with predicted agents. Solving it from several initializations gives a candidate set, and a prediction-conditioned oriented-bounding-box (OBB) feasibility test retains only candidates whose minimum predicted OBB clearance over the horizon meets a threshold. The lower layer executes the lowest-cost survivor, or a route-centerline backup when none remains, through the tracking controller supplied with the planner, augmented by a range-based speed bound and a saturated proportional braking law. In closed-loop simulation on the 220-route Bench2Drive validation set with VAD as the upstream planner, CLRE raises the driving score from 42.26 to 55.89 and route completion from 55.69 to 71.51, and reduces collision events from 117 to 97.

eess.SY↗

A Dynamic Generalized Kalman Consensus Filter for Switching Sensor Networks

Distributed state estimation is critical for applications such as surveillance, autonomous navigation, and wide-area monitoring, where sensor agents must cooperatively track targets using only local measurements and neighbor-to-neighbor communication. Existing distributed filters have been shown to achieve accurate estimation even under sparse inter-agent communication and limited sensing ranges. However, many of these methods rely on consensus parameters that depend on global properties of the communication graph, such as the maximum degree of the graph, and are therefore sensitive to changes in network topology. This limitation is particularly significant in sensor networks with mobile agents, where communication links change over time. This paper presents a Dynamic Generalized Kalman Consensus Filter for target tracking in sensor networks with switching communication topologies. The proposed algorithm computes information-based consensus weights using only locally available quantities, eliminating the need for global network parameters. Numerical simulations demonstrate that the proposed algorithm maintains estimation accuracy under switching network topologies and outperforms existing distributed filters in the given tracking problem.

eess.SY↗