Literature DB >> 34484831

Optimal charging of fractional-order circuits with Cuckoo search.

A M AbdelAty1, Mohammed E Fouda2,3, Menna T M M Elbarawy1, A G Radwan2,4.   

Abstract

INTRODUCTION: Optimal charging of RC circuits is a well-studied problem in the integer-order domain due to its importance from economic and system temperature hazards perspectives. However, the fractional-order counterpart of this problem requires investigation.
OBJECTIVES: This study aims to find approximate solutions of the most energy-efficient input charging function in fractional-order RC circuits.
METHODS: This paper uses a meta-heuristic optimization technique called Cuckoo search optimizer to attain the maximum charging efficiency of three common fractional-order RC circuits. An analytical expression of the fractional capacitor voltage is suggested such that it satisfies the boundary conditions of the optimal charging problem. The problem is formulated as a fractional-order calculus of variations problem with compositional functional. The numerical solutions are obtained with the meta-heuristic optimization algorithm's help to avoid the complexities of the analytical approach.
RESULTS: he efficiency surfaces and input voltage charging curves are discussed for fractional-order in the range 0.5 < α ≤ 1 .
CONCLUSION: The optimized charging function can approximate the optimal charging curve using at most 4 terms. The charging time and the resistive parameters have the most dominant effect on charging efficiency at constant fractional-order α .
© 2021 The Authors. Published by Elsevier B.V. on behalf of Cairo University.

Entities:  

Keywords:  Cuckoo search optimizer; Fractional capacitor charging; Fractional-order circuits; Optimal charging

Year:  2020        PMID: 34484831      PMCID: PMC8408332          DOI: 10.1016/j.jare.2020.11.014

Source DB:  PubMed          Journal:  J Adv Res        ISSN: 2090-1224            Impact factor:   10.479


Introduction

Fractional-order modeling offers better and accurate identification of the systems and has been recently used extensively to characterize many physical phenomena. Fractional-order modeling relies on the generalization of the Calculus, which is referred as fractional Calculus. The idea behind fractional calculus dates back to calculus’s origins in an intriguing letter between L’Hopital and Leibniz discussing the consequences of dealing with a half order derivative. A series of contributions to the area by great mathematicians followed this letter. Examples of early contributors are Reimann, Liouville, Grunwald, Letnikov, Riesz, Caputo, and many others [1], [2], [3]. However, the fractional-calculus’ theoretical development was rather slow and application-driven contributions took a lot of time to surface. It was only recently when researchers realized the advantages this modeling tool can offer. These advantages include the extra tuning knobs introduced by the new fractional-order parameter the ability to model systems with strong memory dependency due to the convolution integral involved in most of the fractional-calculus operators [4], [5], [6]. In addition, fractional-order models are compact and provide a better representation of complex systems using fewer parameters compared to their equivalent integer-order models. The application areas are ubiquitous in many science and engineering fields such as: bio-impedance modeling, chaos [7], [8], [9], [10], [11], control [12], [13], [14], wireless power transfer [15], [16], image recognition [17], circuit theory [18], [19], [20], [21], [22], [23], [24], [25], [26], oscillators [27], [28], modeling of energy storage devices [29], [30], [31], bio-impedance modeling [32], [33], and others [34], [35], [11], [36]. Meta-heuristic optimization algorithms have been proven to be applicable in many areas of science and engineering. They are often inspired by natural phenomena or animal behavior like hunting or flower pollination. Their working mechanism allows them to overcome notorious problems that gradient-based deterministic optimization algorithms are known to fall into, like converging to local extrema and sensitivity to the initial point of the search space. On the other hand, the search agents’ stochastic movement and the random distribution of the initial population all over the search space allow meta-heuristic optimization techniques to have a higher probability of finding better solutions than traditional methods [37]. However, this comes at the cost of being more computationally demanding than traditional methods. Also, the no free lunch theorem states that there is no super meta-heuristic algorithm that can be used to solve all optimization problems [38]. Analytical solutions of fractional order problems are not always obtainable due to the complex mathematical expressions involved. So, increased interest in using meta-heuristic optimization has been recently observed in fractional-calculus literature [39], [40]. Chronologically speaking, one of the earliest contributions in this field is using the differential evolution algorithm for designing a fractional order filter with a specific magnitude response [41]. Many papers followed this work in both analog and digital domains. Flower pollination algorithm (FPA) and moth flame optimizer (MFO) was used to find an infinite impulse response (IIR) approximation of digital fractional-order differential operators of orders , and [42], [43]. In the analog realm, many fractional-order filters approximating polynomial based magnitude responses like Butterworth, Chebyshev, and Bessel were optimized and approximated using meta-heuristic optimization algorithms [44], [45], [46], [47], [48], [49], [50]. In this work, we use the Cuckoo Search (CS) Optimizer as it has been proven to perform better than many other meta-heuristic optimization algorithms in terms of consistency and accuracy of the obtained results specially in problems involving fractional-order models [51], [52], [53]. RC networks are basic building blocks in equivalent circuit models of energy storage devices like batteries and supercapacitors [54], [55]. The maximization of energy efficiency of RC networks is important due to two main reasons: consuming less energy from the source to achieve the same charging target makes the system more greener, and reducing energy loss reduces thermal impacts and results in prolonging energy storage device life cycle which is important due to high price of some of the energy storage components and also the inaccessibility for maintenance of the others [56]. In integer-order circuits, the optimal charging of RC networks has been thoroughly discussed [57], [58], [59], [60], [61]. The approaches of tackling this problem ranged from optimal control [57], to the calculus of variations [58]. The conclusion is the same for the simple series RC circuit, that is, the source function that minimizes the loss in the resistor is the constant current input. However, this problem is still new to the area of fractional-order RC networks. This paper aims to find approximate solutions for the optimal charging source functions that maximize the energy efficiency for fractional-order versions of the circuits investigated in [58]. This is a continuation of the work we presented in [62] using a different objective function and more fractional-order RC networks. The main objective of this paper is to find the optimal voltage charging function that maximizes the efficiency of the charging process in fractional-order RC circuits. The summary of contributions of this paper are as follows: Discuss, via a numerical study, the differences between two main charging methodologies, constant current and constant voltage, in fractional-order circuits. Study the delivered electric charge, energy loss, and charging efficiency for fractional-order circuits. Present the problem formulation of the optimal charging of three fractional-order RC networks using compositional functional. Find approximate solutions of the problem using prototype Constant Phase Element, CPE, voltage function and Cuckoo search optimizer. The rest of this paper is organized as follows. First, an overview is provided of the concepts of fractional-calculus and fractional-variational problems with compositional functionals. Next, a review is made about the working mechanism of the Cuckoo search optimizer. After that, a simulation study is presented to discuss the differences between constant current and constant voltage charging methods in the case of fractional-order circuits. Following these, the optimization problem formulation used to get the approximate solutions of the optimal charging problem is presented. A summary of the optimization results is discussed and the concluding remarks are summarized.

Preliminaries

Definitions of fractional calculus are numerous and ever-increasing. So, recently, a classification was introduced in [63] and it categorized the fractional calculus operators into four main classes: Classical operators (), Modified operators (), Local operators () and operators with non-singular kernel (). Riemann–Liouville and Caputo operators are example of the class. They are defined as:where and . The symbols and refer to the fractional order Riemann–Liouville (RL) and Caputo derivative, respectively. The different succession of the fractional-order integral and integer order derivative observed in the definitions of RL and Caputo operators has affected their Laplace transform as follows: Both definitions are equivalent under zero initial conditions. For linear fractional order circuits, the use of Laplace transform simplifies the analysis and saves the designer from the tedious time-domain expressions. The calculus of variations approach for minimizing the energy loss inside the resistor in an integer order series RC circuit is formulated as [58]:where is the pre-specified charging time. The boundary conditions arewhere is a design parameter, constrained by the device physics. There are two main approaches for solving calculus of variations problems. The indirect approach is the group of methods aiming at finding the extremal function through solving the associated Euler–Lagrange equation [58], [64]. The direct approach is when the problem is tackled directly by optimizing the functional J and the resulting solutions do not have to satisfy the associated Euler–Lagrange equation as they are, in general, an approximate estimate of the extremal function [64]. The approach followed in [58] is of the indirect type and the paper studied three RC networks, the integer equivalent of the ones shown in Fig. 1, and their RL network duals.
Fig. 1

The three supercapacitor equivalent circuit models under investigation: (a) -CPE model (Model 1), (b) --CPE model (Model 2), and (c) --CPE model (Model 3).

The three supercapacitor equivalent circuit models under investigation: (a) -CPE model (Model 1), (b) --CPE model (Model 2), and (c) --CPE model (Model 3). In this work, the functional objective function takes the form:which is the ratio between the energy delivered to the fractional capacitor to the energy drawn from the source (charging efficiency). It is worth mentioning that is a function of and its fractional derivative for the three circuits under study (see Fig. 1). Such functionals are called composition functionals and the discussions on methods of their solutions in integer and fractional calculus of variation literature are very rare [65], [66]. The only paper discussing a form of this fractional calculus of variations with composition functional is [65], where the authors adopted the indirect approach by deriving the associated Euler–Lagrange equation. The composition functional involved functional (fractional integration) and fractional derivative of Jumarie type of the same fractional-order and it is known that the satisfaction of the Euler–Lagrange equation is a necessary but not sufficient condition for optimality. Also, the resultant Euler–Lagrange equations in fractional calculus of variations are known to contains both left and right fractional derivative which is still a new topic in fractional differential equations theory [67]. These reasons make the only approach in literature [65], not suitable for our problem. So, We are motivated to use the direct method of optimization with Cuckoo search optimizer. The details of the optimization algorithm and the fractional calculus of variations problem formulation is discussed in the next two sections.

Cuckoo optimization

Cuckoo search optimization is inspired by the egg-laying and parasitic behavior of the Cuckoo bird [68], [69]. The adult birds lay their eggs in other birds nests. They choose nests where the host bird just laid its eggs. The eggs grow and mature if not discovered by the host bird, and in general, they hatch earlier than the host bird eggs and the host bird indistinctly blindly propels the other unhatched eggs, which improve the food share of the parasitic cuckoo chicks [69], [52]. Some female cuckoo birds can reproduce eggs that are indistinguishable from the colors and patterns of some host species reducing their chances of being discovered and increasing their survival rates [52]. The optimization algorithm follows three main hypotheses [53]. The first is that each adult bird lays only one egg each time. The second is that the adult Cuckoo bird puts its eggs in randomly chosen nest and the best found nest is saved for the next generation. The last hypothesis is that the host bird can discover the strange egg with a probability . It is known that animals search for food follows a random or at least a quasi-random pattern in nature. The foraging path can be seen as a random walk as it is affected by the current location and the transition probabilities to neighboring locations. For Cuckoo, and many birds and insects, this random walk has characteristics of a Lévy flight where the step sizes are evaluated according to a heavy-tailed probability distribution. The mathematical formulation of the Cuckoo search algorithm is as follows. The location update of the global random walk equation is [70]:where is the step size scaling factor which is related to the scale of the problem under investigation. is usually set to , or , where L is the scale of the problem [71], [70]. s is the step size and the Levy flight is calculated byThe local random walk is defined as [70]:where is the Heaviside function, is a uniformly distributed random variable, is the switching parameter, and and are two randomly selected solutions. The symbol means element wise vector multiplication.

A comparison among basic charging methods

In this section, a numerical comparison is made between constant current, CC, and constant voltage, CV, charging methods in case of fractional-order series RC circuit. First, for CV charging, the time needed to reach from to of the final voltage is calculated by [72]:where is the two parameter Mittag–Leffler (ML) function defined as [73]: Fig. 2(a) shows the numerical solution of this equation for and . The roots where calculated using MATLAB fzero function using the ML implementation provided in [74]. When considering the change with respect to , the behaviour of the CV charging time changes from increasing by increasing at to decreasing by increasing at . However, at constant , the charging time increases by increasing , as expected. At the end of this CV charging time, the final delivered electric charge can be calculated from [75]:where is the final voltage of the CPE which is equal to the constant voltage source. The current passing through the resistor during CV charging is given by [75]:Hence, the energy dissipation in the resistor is calculated by:Based on numerical simulation, the absolute difference between the lost energy at and is smaller for larger values of . This means that the larger the capacitance is, the less effective becomes in determining the energy loss. From MATLAB numerical simulations, it can be inferred that the efficiency is not changing with which might be counter-intuitive. However, it is worth noting that, the CV charging time is not constant in these simulations and is a function of and .
Fig. 2

The constant voltage and constant current charging techniques comparison at .

The constant voltage and constant current charging techniques comparison at . Suppose that CC charging is performed within the same CV charging time () and reaching the same final voltage on the CPE (), the corresponding delivered electric charge to the CPE is calculated as [76]:The ratio between the electric charge delivered to the CPE of CC charging divided by CV charging, , is shown in Fig. 2(b). It is noticed that is always smaller than for where is the point where both electric charges are equal and for an opposite behaviour is observed. The energy loss due to the resistive element in CC charging is: Fig. 2(c) shows the quotient of energy loss in case on CC and CV. It is noticed that the energy loss in CC is always smaller than CV. Consequently, Fig. 2(d) shows that the charging efficiency in case of CC is always greater than its equivalent CV.

Optimization problem formulation

Assume the capacitor voltage is given as . The boundary conditions of the charging problem are:The charging time is chosen to be a multiple of the constant voltage charging time which is calculated as the root of Eq. (9). The charging time used in this work is defined as: where is a tunable parameter used for numerical investigations. The target is to maximize the charging efficiency defined by:where is the energy delivered to the capacitor, and is the energy delivered by the source. The energy delivered to the CPE is calculated by:and the input energy is given by: Assume that the voltage across the fractional capacitor has the form:where N is the number of terms used for the approximation. The condition on the last coefficient is made to make sure that the prototype CPE voltage function, Eq. (20), satisfies the boundary condition for any choice of the search parameters. The -order fractional Caputo derivative of the CPE voltage is given as: Hence, the search vector X is of length is defined as: . Throughout this work, the lower and upper bounds of the search space are given as: , and . The second section of the lower bound is set to to avoid infinite current at . The number of search agents is and the number of iterations is 1000. For each set of parameters, ten independent runs are executed and only the best run is chosen. The input voltage in case of the -CPE model:while the input current is: The input voltage in case of --CPE model:while the input current in this case is The input current in case of the --CPE model:while the input voltage:

Results and discussion

steps for simulation study In this section, the optimization results are discussed for the three circuit under investigation: ---CPE, and --CPE and a brief of the simulation procedure is summarized in Algorithm 1. The default parameters are: , and . These parameters are guided from the study made in [58]. Each objective function evaluation is made with a time vector of length for good accuracy and . The choice of is only constrained by the device physics and does not affect the results due to the linearity of the problem. Five different sweep planes are studied for each circuit except the -CPE case has only four as it doesn’t include the parameter. The two dimensional sweep planes are: ----N, and -. The ranges of the parameters are: with a step of logarithmically spaced vector of length logarithmically spaced vector of length logarithmically spaced vector of length with a step of 1, and with a step of . The range of has been chosen in accordance with the estimated parameters obtained in recent literature via time or frequency domain data [30], [75], [77], [78], [79] Each optimization made in the study space is performed ten times and the best solution in terms of objective function is chosen to be included in all the different plots/tables presented. For each circuit, efficiency surfaces over the study planes and sample charging curves are provided for discussion. The charging curves were chosen for the following parameter values: , and and simulated against a normalized time axis due to the discrepancy of charging times at different values of and the sweep parameter. The maximum efficiency results for the -CPE circuit are shown in Fig. 3. The charging efficiency decreases with increasing , which is in accordance with the analysis in [62]. However, as mentioned in [62], the round trip efficiency decreases by increasing due to the leaky behaviour of the CPE. For the sweep parameters and , the maximum efficiency seems to be independent of them. This is expected as the charging time is evaluated according to Eq. (9) and it is dependent on both and . So, there is a compensation between their values and the charging time to achieve nearly constant efficiency at the same . For the N parameter, it is observed that the maximum efficiency is independent of this parameter too. This is observed from the numerical results of the optimal coefficients of Eq. (20) for this case. The coefficients, , are zeros except for the first one and the corresponding power, , is approximately equal to which means that the constant current input is the most efficient method to charge the -CPE circuit confirming the analytical study in [62]. For the last parameter, , the charging efficiency increases by increasing as we know from the integer case. However, the gap between the charging efficiencies at and is very small at and gradually increases until it reaches the maximum value at . A sample of optimal charging curves for the -CPE case is shown in Table 1. As mentioned earlier, the optimal charging curves is found to be the constant current. Hence, the charging curves are all raised fractional power ramps of the form: . Comparing the cases at and , the DC offset increases by increasing for the first case and it does the opposite in the second case. Also, The final input voltage is larger by increasing in the first case but is it gets smaller by increasing in the second case. Overall, the final input voltage is much higher than the target CPE voltage for near and bigger . For the N parameter, the optimal input voltage curves are identical in the cases and for the same reason mentioned above. Lastly, for the parameter, a higher value of DC offset and final input voltage is observed in case of . This is expected as faster charging requires higher input voltage which leads to higher current and consequently higher resistive losses.
Fig. 3

-CPE model maximum efficiency results.

Table 1

-CPE model optimum charging voltage curves.

Rs=1ΩRs=10kΩ
N=2N=8
γ=1γ=4
-CPE model maximum efficiency results. -CPE model optimum charging voltage curves. The behaviors of the --CPE and --CPE circuits are similar when comparing them qualitatively. The efficiency surfaces are illustrated in Fig. 4 and Fig. 5. For the parameter, a higher means longer charging time . However, in the presence of at constant , this leads to higher losses and efficiency degradation. For , the efficiency is higher for lower and the opposite happens at . For the parameter at constant , the efficiency increases by increasing due to lower leakages. At , the efficiency increases by increasing and the opposite happens at . The N parameter effect is present for low only. It is evident that for , three to four terms of Eq. (20) are needed to obtain the maximum efficiency. On the other hand, at , two terms are enough to obtain a reasonable approximation of the optimal charging input function. The parameter is obvious in the integer case as the efficiency is increased by increasing . However, this effect is negligible at where a slight decrease in efficiency is observed as increases.
Fig. 4

--CPE model maximum efficiency results.

Fig. 5

--CPE model maximum efficiency results.

--CPE model maximum efficiency results. --CPE model maximum efficiency results. The optimal input voltage charging curves are shown for selective cases in Table 2, Table 3. For and , The final input voltage value is increased by increasing and decreasing . The optimal input voltage curve is similar to the -CPE case when is negligible in comparison with which is the case for the figure at and the figure at . The N parameter effect is shown in the optimal charging curves near and has no effect at . For the last parameter, , increasing puts lower stress on the supply by requiring smaller voltage. However, lower values of always requires higher final input voltage values at the same value. Another observation is the higher amount of change in the value of the input voltage is seen during the second half of the charging period, specially for low values.
Table 2

--CPE model optimum charging voltage curves.

Rs=1ΩRs=10kΩ
Rp=10kΩRp=10MΩ
N=2N=8
γ=1γ=4
Table 3

--CPE model optimum charging voltage curves.

Rs=1ΩRs=10kΩ
Rp=10kΩRs=10MΩ
N=2N=8
γ=1γ=4
--CPE model optimum charging voltage curves. --CPE model optimum charging voltage curves. For validation with the integer case, the optimal input voltages as in [58] during the charging period:for the --CPE, and --CPE cases, respectively. Where:The percentage error between the optimal input voltage expressions in Eq. (28a), (28b) derived in [58] and the optimal input voltages obtained using the Cuckoo search optimizer are shown in Fig. 6. It can be seen that the percentage error does not exceed in case of --CPE circuit and in case of --CPE model for the default parameters discussed in previous sections. This means that the result of our approach is identical to the one derived analytically in [58] at .
Fig. 6

Percentage error of the optimal of this work and the analytical expression of [58].

Percentage error of the optimal of this work and the analytical expression of [58]. In order to test the consistency and convergence speed of the utilized meta-heuristic optimizer, the convergence curves of 10 independent runs and their mean are shown for selected cases of the parameter space in Table 4. In all cases, the optimal efficiency is reached before 100 iterations of the optimizer and in some cases it is reached as fast as 10 iterations only. Also, the coefficient of variation, , of the optimal efficiency reached is calculated for each case. It is below in the selected cases which verifies the consistency of Cuckoo search optimizer in solving the investigated problem.
Table 4

Cuckoo search algorithm’s convergence curves (dashed) and their mean curve (solid) for selected cases of the three fractional-order RC circuits under investigation.

Rs-CPERs=4.28Ω,α=0.9,CoV=1.83×10-12N=5,α=0.85,CoV=2.43×10-10
Rp-Rs-CPERs=78.47Ω,α=0.95,CoV=4.36×10-10Rp=2.34MΩ,α=0.9,CoV=8.26×10-11
Rs-Rp-CPERp=0.264MΩ,α=0.95,CoV=1.5×10-9γ=0.5,α=0.95,CoV=1.02×10-9
Cuckoo search algorithm’s convergence curves (dashed) and their mean curve (solid) for selected cases of the three fractional-order RC circuits under investigation.

Conclusion

The optimal charging for three fractional-order RC circuits was investigated. The problem was formulated to find the optimal voltage charging curve that maximizes the charging efficiency, which is the energy delivered to the capacitor divided by the supply’s energy. The cuckoo search optimizer was used to find optimal coefficients and powers of the capacitor voltage prototype function. The results were discussed for the fractional-order and a wide range of circuit parameters, charging condition and approximation order like: , and N. It was noticed that the resistive parameters and charging time have the most dominant effect on the efficiency and the approximation order of 4, of the prototype capacitor voltage function, is enough in most cases. The same procedure can be applied to fractional-order RL circuits. In fact, fractional-order RL circuits can be considered as the dual problem of what we discussed, fractional-order RC circuits, where the optimal expressions for current and voltage are to be interchanged in order to get the optimal expressions for the other problem similar to what was done in [58]. Possible future work includes investigating the effect of different fractional-calculus definitions on this problem, optimal charging, similar to the analysis performed in [79], [22], [23].

Compliance with Ethics Requirements

This article does not contain any studies with human or animal subjects.

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
1: Input: circuit number; 1 for Rs-CPE, 2 for Rp-Rs-CPE, or 3 for Rs-Rp-CPE
2: Set parameter sweep ranges
3: Rs=100:104, 20 log-spaced points.
4: Cα=10-12:10-6, 20 log-spaced points.
5: Rp=104:107, 20 log-spaced points.
6: N=2:8 with 1 step.
7: γ=0.5:4 with 0.5 step.
8: α=0.51:1.0 with 0.05 step.
9: for all Sweep Parameters do
10:  for allαdo
11:  Set parameters to default values
12:  Rs=1k,Cα=100p,Rp=100k,γ=1.5,Vmax=5,N=4.
13:  Change the default value for the parameter being swept.
14:  Calculate tCV from Eq. (9) then multiply it by γ to get tc.
15:  Run Cuckoo search 10 times using the objective function of Eq. (17) and the lower and upper boundaries discussed before. Save the optimal positions of Eq. (20).
16:  end for
17: end for
  14 in total

1.  Improved Cole parameter extraction based on the least absolute deviation method.

Authors:  Yuxiang Yang; Wenwen Ni; Qiang Sun; He Wen; Zhaosheng Teng
Journal:  Physiol Meas       Date:  2013-09-11       Impact factor: 2.833

2.  Advanced materials modelling via fractional calculus: challenges and perspectives.

Authors:  Giuseppe Failla; Massimiliano Zingales
Journal:  Philos Trans A Math Phys Eng Sci       Date:  2020-05-11       Impact factor: 4.226

3.  Reevaluation of Performance of Electric Double-layer Capacitors from Constant-current Charge/Discharge and Cyclic Voltammetry.

Authors:  Anis Allagui; Todd J Freeborn; Ahmed S Elwakil; Brent J Maundy
Journal:  Sci Rep       Date:  2016-12-09       Impact factor: 4.379

View more

北京卡尤迪生物科技股份有限公司 © 2022-2023.