Fast and Accurate GMPPT Based on Modified P&O Algorithm

15Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The most significant challenge the maximum power point tracking (MPPT) algorithms face is reaching the global MPPT under partial shading conditions (PSC). In this case, the power-voltage (P-V) and current-voltage (I-V) characteristic curves of the photovoltaic (PV) system produce many maximum power points, which is the reason that the algorithms often trapped in local maximum power point (LMPP). The Perturbation and Observation (P&O) algorithm is simple and effective for finding MPP on a mono-extreme graph. Under PSC with many extremes, it is necessary to limit the range of potential GMPP so that this algorithm can avoid the LMPP trap. This paper introduces a global MPPT (GMPPT) method based on the combination of modified P&O and simulates the behavior of the I-V curve under PSC. In particular, the starting parameters of the algorithm are adjusted in the potential GMPP region to exploit simplicity and efficiency to increase performance and convergence speed. The proposed method determines the area where the GMPP is potentially found more accurately, and this contribution is crucial for increasing the efficiency of the strings of PV arrays under partial shading conditions. By comparing results with other algorithms, such as Modified P&O, Adaptive Jaya (Ajaya), and Jaya, the proposed algorithm has verified its outstanding advantages in MPPT performance and search time under the same test conditions.

Cite

CITATION STYLE

APA

Viet Anh, T., Ngoc Trieu, T., Vo Hong Nghi, P., & Hien, B. V. (2024). Fast and Accurate GMPPT Based on Modified P&O Algorithm. IEEE Access, 12, 129588–129600. https://doi.org/10.1109/ACCESS.2024.3457825

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free