Dynamic programming and Munkres algorithm for optimal photovoltaic arrays reconfiguration
[Display omitted] •Optimal design for PV plant.•Switching matrix design.•Switching operations balancing.•Comparison between reconfiguration algorithms. In this paper, an original formulation of the control problem for optimal PV array reconfiguration, following a Total Cross Tied layout, is proposed...
Uloženo v:
| Vydáno v: | Solar energy Ročník 122; s. 347 - 358 |
|---|---|
| Hlavní autoři: | , , , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
Elsevier Ltd
01.12.2015
Pergamon Press Inc |
| Témata: | |
| ISSN: | 0038-092X, 1471-1257 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | [Display omitted]
•Optimal design for PV plant.•Switching matrix design.•Switching operations balancing.•Comparison between reconfiguration algorithms.
In this paper, an original formulation of the control problem for optimal PV array reconfiguration, following a Total Cross Tied layout, is proposed. The formulation follows the well-known subset sum problem, which is a special case of the knapsack problem. The reconfiguration is a measure devoted to mitigate the mismatch effect and maximize the output power of small photovoltaic plants under non-homogeneous working conditions. Therefore, reconfiguration means changing the connections of the solar panels adaptively by a dynamic switching matrix. The control system implements an easy dynamic programming algorithm to change the switches layout.
The use of the Munkres assignment method in a post-processing module makes the algorithm able to obtain the optimum configuration for which it is possible to balance and minimize the aging of the switches within the switching matrix. |
|---|---|
| Bibliografie: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ISSN: | 0038-092X 1471-1257 |
| DOI: | 10.1016/j.solener.2015.09.016 |