Search arXivSearch

arXiv · 2508.17374

Analysis of Circuit-based Per-Panel Diode Model of Photovoltaic Array

Abstract

Solar photovoltaic systems are increasing in size and number on the grid. In regions with high penetration, such as California, PV systems serve multiple functions, including peak shaving and demand response. Therefore, the criticality of PV systems to grid operations calls for accurate models. The current practice is to represent the PV array, composed of multiple PV panels, with an aggregated single-diode model (SDM). The highly abstract model has a limited ability to capture real-world behaviors, such as partial shading and hotspots. Thus, we develop a circuit-based per-panel PV array model that uses a single diode model for each panel and interconnects them to form an array. This approach bridges the tradeoff between cell-level physics and control-dependent system-level behavior. We establish conditions for mathematical equivalence between the proposed per-panel array circuit model and the aggregated single-diode array model. We generate empirical evidence by running simulations using parameters derived from real-world PV panels. Results indicate that the proposed per-panel array model can represent the electrical behavior of the array under non-ideal conditions, such as partial shading, more accurately. With maximum power point tracking control, the proposed model is 21.2% more accurate when estimating the real power output of an array under a partial shading scenario and 8.1% more accurate under a hot spot scenario.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peng Sang, Santhosh Balasubramanian, Amritanshu Pandey. 2026-07-26. Analysis of Circuit-based Per-Panel Diode Model of Photovoltaic Array. https://arxiv.org/abs/2508.17374

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

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY