控制重构
重新安置
光伏系统
计算机科学
粒子群优化
背景(考古学)
功率(物理)
电压
算法
数学优化
发电
电气工程
数学
嵌入式系统
工程类
物理
古生物学
生物
量子力学
程序设计语言
作者
J. Prasanth Ram,Dhanup S. Pillai,Vijesh Jayan,Veronika Shabunko,Young‐Jin Kim,Frede Blaabjerg
标识
DOI:10.1109/jphotov.2022.3150681
摘要
Array reconfiguration has emerged as a possible solution to enhance power generation from photovoltaic (PV) power plants under dissimilar irradiation conditions. However, the practicality of such solutions is often questioned as it requires many relocations for its real-time implementation. In this context, the proposed work demonstrates that utilizing optimization algorithms to attain the optimal relocation solution does not always guarantee minimal relocations, and thereby, mandates a high number of switching during electrical array reconfiguration process. To address this issue, an attempt has been made via a flower pollination algorithm (FPA) in this article for implicit shade dispersion along with an additional minimal relocation framework to enhance power generation and reduce the switching complexity. The proposed value-added mathematical progression assists FPA to reproduce competent and concise shade dispersion profiles with minimal relocations. For validation, simulation analysis is performed for a 9 × 9 PV array and the results attained pertinent to row currents, bypass voltages, and power generation are quantitatively assessed and compared with the conventional total cross tied method and particle swarm optimization technique. Also, another notable contribution of this article is that the proposed relocation framework can be applied to both physical and electrical reconfiguration techniques.
科研通智能强力驱动
Strongly Powered by AbleSci AI