2019 IEEE International Conference on Intelligent Techniques in Control, Optimization and Signal Processing (INCOS) 2019
DOI: 10.1109/incos45849.2019.8951363
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Neuralback Stepping Controller for MPPT in Photo Voltaic Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…In the neural network, the weights are updated online based on the uncertainty caused by the disturbances which do not require initial training that result in the minimum computational burden. The radial basis function (RBF) [28,29] polynomial is not preferred because every node in the hidden layer has to compute the RBF function based on the different centre values which result in the computation more intense and also it does not have orthogonal property. The two known orthogonal polynomials are Chebyshev polynomials [30][31][32] and Legendre polynomials [33].…”
Section: Introductionmentioning
confidence: 99%
“…In the neural network, the weights are updated online based on the uncertainty caused by the disturbances which do not require initial training that result in the minimum computational burden. The radial basis function (RBF) [28,29] polynomial is not preferred because every node in the hidden layer has to compute the RBF function based on the different centre values which result in the computation more intense and also it does not have orthogonal property. The two known orthogonal polynomials are Chebyshev polynomials [30][31][32] and Legendre polynomials [33].…”
Section: Introductionmentioning
confidence: 99%
“…In the neural network, the weights are updated online based on the uncertainty caused by the disturbances which do not require initial training that result in the minimum computational problem. The Radial Basis Function (RBF) [40,41] polynomial is not preferred because every node in the hidden layer has to compute the RBF function based on the different center values which result in the computation being more intense. Also, it does not have orthogonal property.…”
Section: Introductionmentioning
confidence: 99%
“…uS By solving for the cubic equation in(40) using Cardano formula and as 0 < u < 1, the duty cycle is given by…”
mentioning
confidence: 99%