2015 17th UKSim-AMSS International Conference on Modelling and Simulation (UKSim) 2015
DOI: 10.1109/uksim.2015.105
|View full text |Cite
|
Sign up to set email alerts
|

Fast Estimation Method for Selection of Optimal Distributed Generation Size Using Kalman Filter and Graph Theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…To calculate the variance of the remaining error, the following error is first given to the π‘Ž = [𝛼 1 , 𝛼 2 , … , 𝛼 𝑛 ] 𝑇 . The amount of variance remaining is calculated as in (13).…”
Section: Mc-ds-cdma Schemementioning
confidence: 99%
See 1 more Smart Citation
“…To calculate the variance of the remaining error, the following error is first given to the π‘Ž = [𝛼 1 , 𝛼 2 , … , 𝛼 𝑛 ] 𝑇 . The amount of variance remaining is calculated as in (13).…”
Section: Mc-ds-cdma Schemementioning
confidence: 99%
“…Two cross coupled and Madgwicks filter for estimation of multi-channel … (Nader Abdullah Kadhim) 263 fading processes they use a least recursive squared solution or the least square algorithm (LMS) and least squares recursive algorithm (RLS) [11], [12]. Kalman filter is an optimised recursive filter used in many areas for estimate optimal state of core variable [13], [14]. Commonly, to explain the development of a signal, Kalman filtering using an autoregressive (AR) modelling is used of faded process time shows that BER is superior to the LMS independent of the model and RLS based on.…”
Section: Introductionmentioning
confidence: 99%
“…The active power (P) injections in buses can be derived and calculated by multiplying the nodal admittance matrix (B) by the angles (Ξ΄) of the buses as follows [23]:…”
Section: Power Flowmentioning
confidence: 99%
“…( 9). 𝑃 π‘‘π‘œπ‘€π‘›π‘ π‘‘π‘Ÿπ‘’π‘Žπ‘š (𝑖, 𝑑) = 𝑃 πΏπ‘œπ‘Žπ‘‘ (𝑖, 𝑑) + βˆ‘ 𝑃 πΏπ‘œπ‘Žπ‘‘ (𝑗, 𝑑) π‘˜ 𝑗=1 (9) where 𝑃 π‘‘π‘œπ‘€π‘›π‘ π‘‘π‘Ÿπ‘’π‘Žπ‘š (𝑖, 𝑑) is the downstream power connected to bus i at time t and 𝑃 πΏπ‘œπ‘Žπ‘‘ (𝑗, 𝑑) is the load power at bus j that is connected to buses at the downstream of bus i.…”
Section: A Sequential Pvdg Placement Algorithmmentioning
confidence: 99%
“…Viral and Khatod used an analytical method to find the optimal size and location of DG, assuming load was constant for the system [8]. Other analytical approaches such as sensitivity analysis and linear or quadratic approximations have been used as well [9], [10]. Populationbased algorithms such as Differential Evolution [11], [12], Particle Swarm Optimization [13], and Shuffled Frog Leaping Algorithm (SFLA) [14] are also popular algorithms for this optimization problem.…”
Section: Introductionmentioning
confidence: 99%