2021
DOI: 10.1109/tpel.2021.3073810
|View full text |Cite
|
Sign up to set email alerts
|

CPSO-Based Parameter-Identification Method for the Fractional-Order Modeling of Lithium-Ion Batteries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 32 publications
(6 citation statements)
references
References 45 publications
0
6
0
Order By: Relevance
“…The method estimates the SOH by identifying the model parameters. After modeling, Kalman filter and other methods are usually used to achieve parameter fitting [20,21]. In [22], a second-order RC equivalent circuit model is established and the adaptive unscented Kalman filter algorithm is used to estimate the ohmic internal resistance of the battery in real time.…”
Section: Open Accessmentioning
confidence: 99%
“…The method estimates the SOH by identifying the model parameters. After modeling, Kalman filter and other methods are usually used to achieve parameter fitting [20,21]. In [22], a second-order RC equivalent circuit model is established and the adaptive unscented Kalman filter algorithm is used to estimate the ohmic internal resistance of the battery in real time.…”
Section: Open Accessmentioning
confidence: 99%
“…The disadvantage of the PSO algorithm is that it tends to fall into local optimal solution. To address the issue, Yu et al [43] presented the coevolutionary particle swarm optimization (CPSO) to identify the FOM parameter. In Ref.…”
Section: Model Parameter Identificationmentioning
confidence: 99%
“…The performance of the PSO depends on the preset parameters, and it often suffers the problem of being trapped in local optima [25]. If the PSO falls into the local extremum, the velocities of all particles are easy to rapidly decrease to zero and stop flying, which causes the premature convergence [26]. Howerver, characterized as ergodicity, randomicity and regularity [27], the chaotic search can experience all positions in a specific area without repeat.…”
Section: Cpso Algorithmmentioning
confidence: 99%