Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/7918
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ramana, V.V. | |
dc.contributor.author | Mudlapur, A. | |
dc.contributor.author | Damodaran, R.V. | |
dc.contributor.author | Venkatesaperumal, B. | |
dc.contributor.author | Mishra, S. | |
dc.date.accessioned | 2020-03-30T10:03:05Z | - |
dc.date.available | 2020-03-30T10:03:05Z | - |
dc.date.issued | 2018 | |
dc.identifier.citation | 2018 IEEMA Engineer Infinite Conference, eTechNxT 2018, 2018, Vol., , pp.1-6 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7918 | - |
dc.description.abstract | Rapidly increasing energy demand is leading to increase in installation of photovoltaic (PV) plants across the globe. The PV modules are subjected to various conditions like shading, soiling and degradation because of which the performance of PV panels deteriorates. This will affect the characteristics of PV module which may lead to several stairs in I-V curves and several peaks in P-V curve. In this paper the various causes of occurrences of mismatching conditions are analyzed. An efficient two stage algorithm that tracks global maximum power point (GMPP) accurately under such mismatching conditions is proposed in the paper. In the first stage, a simple searching technique and bisection method are used to bring the operating point to the proximity of global maximum. In the second stage, hill climbing method maintains the operating point at global peak. MATLAB Simulations and experimental verifications are performed for validating the proposed approach. � 2018 IEEE. | en_US |
dc.title | Efficient global peak tracking of PV system under mismatching conditions using searching technique and bisection method | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.