Abstract
The design of new efficient maximum power point tracking (MPPT) techniques has become extremely important due to the rapid expansion of photovoltaic (PV) systems. Because under shading conditions the characteristics of PV devices become multimodal having several power peaks, traditional MPPT techniques provide crappy performance. In turn, metaheuristic algorithms have become massively employed as a typical substitute in maximum power point tracking. In this work, a new optimizer, which was named the hyperbolic slime mould algorithm (HSMA), is designed to be employed as an efficient MPPT algorithm. The hyperbolic tangent function is incorporated into the optimizer framework equations to scale down large perturbations in the tracking stage and boost its convergence trend. Moreover, to provide a strong exploration capability, a new mechanism has been developed in such a way the search process is carried out inside the best two power peak regions along the initial iterations. This region inspection mechanism is the prime hallmark of the designed optimizer in avoiding local power peaks and excessive global search operations. The developed algorithm was examined through diverse complicated partial shading conditions to challenge its global and local search abilities. A comparative analysis was carried out against the well-regarded PSO, GWO, and the standard slime mould algorithm. In overall, the designed optimizer defeated its contenders in all aspects offering higher efficiency, superior robustness, faster convergence, and fewer fluctuations to the operating point. An experimental setup that consists of the DSpace microcontroller and a PV emulator was employed to validate the algorithm overall performance. The recorded outcomes outline that the developed optimizer can achieve a tracking time of 0.6 seconds and 0.86 seconds on average, with 99.85% average efficiency under complex partial shading conditions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.