Abstract:In the present work a particle swarm optimization (PSO) based off-line system identification algorithm has been proposed for modeling of RF on-chip inductors. The proposed scheme has a distinctive feature that the determination of the system structure and the identification of parameters can be simultaneously obtained. The system identification algorithm used here is based upon a black-box modeling approach. Unlike the conventional equivalent circuit models, in the proposed modeling a priori information of the… Show more
“…For such an array, the SLL minimization problem can be solved by minimizing the following cost function (9) where AF is defined in (7). In order to introduce constraints over FNBW and null locations, we use the penalty method [19] and modify (9) as (10) where and are large numbers required to impose penalty and are arbitrarily taken as and respectively. is the calculated FNBW and is the desired FNBW.…”
Section: Synthesis Of Uniformly Excited Unequally Spaced Linear Amentioning
confidence: 99%
“…BW is the allowed tolerance of FNBW. In (10), is the null depth associated with the th null located at and is the desired null depth [19]. It is evident from (10) that CF is equal to for all those array geometries that satisfy the constraints on FNBW and null locations.…”
Section: Synthesis Of Uniformly Excited Unequally Spaced Linear Amentioning
confidence: 99%
“…We employ PSO to search for the optimal which minimizes the CF defined in (10). For comparison, we use the same simulation setup for PSO as used in [14] and [19].…”
Section: Synthesis Of Uniformly Excited Unequally Spaced Linear Amentioning
confidence: 99%
“…PSO has received a lot of attention due to its simplicity of implementation and its capability of escaping from the traps of local optima [3], [4]. Apart from many other applications like design of ultra-wideband (UWB) antennas [5], multi-band antennas [6]- [8], artificial magnetic conductors [9], modeling of passive components [10]- [12] etc., Manuscript PSO has been most extensively utilized in different types of antenna array design problems [3], [4], [13]- [23].…”
A family of position mutated hierarchical particle swarm optimization algorithms with time varying acceleration coefficients (viz.HPSO-TVAC, ) is introduced in this paper. The proposed position mutation schemes help the swarm to get out of local optima traps and the hierarchical nature of the swarm prevents premature convergence. One distinct advantage of the proposed algorithms over the existing mutated PSO algorithms is that HPSO-TVAC do not involve any controlling parameter. Performance of the proposed algorithms is evaluated on standard benchmark functions. Comparative study shows that
HPSO-TVAC performs better than the other HPSO-TVAC, HPSO-TVAC, comprehensive learning PSO (CLPSO), adaptive-CLPSO (A-CLSPO), PSO with time-varying inertia weight (PSO-TVIW), and constriction factor PSO (CFPSO)for the benchmark functions considered. We apply the proposed algorithm to the synthesis of uniformly excited, unequally dpaced linear array to minimize sidelobe level (SLL) and to control first-null-beamwidth (FNBW) and null locations. Further, we apply the proposed algorithm to the synthesis of unequally spaced sparse planar array to minimize SLL.
“…For such an array, the SLL minimization problem can be solved by minimizing the following cost function (9) where AF is defined in (7). In order to introduce constraints over FNBW and null locations, we use the penalty method [19] and modify (9) as (10) where and are large numbers required to impose penalty and are arbitrarily taken as and respectively. is the calculated FNBW and is the desired FNBW.…”
Section: Synthesis Of Uniformly Excited Unequally Spaced Linear Amentioning
confidence: 99%
“…BW is the allowed tolerance of FNBW. In (10), is the null depth associated with the th null located at and is the desired null depth [19]. It is evident from (10) that CF is equal to for all those array geometries that satisfy the constraints on FNBW and null locations.…”
Section: Synthesis Of Uniformly Excited Unequally Spaced Linear Amentioning
confidence: 99%
“…We employ PSO to search for the optimal which minimizes the CF defined in (10). For comparison, we use the same simulation setup for PSO as used in [14] and [19].…”
Section: Synthesis Of Uniformly Excited Unequally Spaced Linear Amentioning
confidence: 99%
“…PSO has received a lot of attention due to its simplicity of implementation and its capability of escaping from the traps of local optima [3], [4]. Apart from many other applications like design of ultra-wideband (UWB) antennas [5], multi-band antennas [6]- [8], artificial magnetic conductors [9], modeling of passive components [10]- [12] etc., Manuscript PSO has been most extensively utilized in different types of antenna array design problems [3], [4], [13]- [23].…”
A family of position mutated hierarchical particle swarm optimization algorithms with time varying acceleration coefficients (viz.HPSO-TVAC, ) is introduced in this paper. The proposed position mutation schemes help the swarm to get out of local optima traps and the hierarchical nature of the swarm prevents premature convergence. One distinct advantage of the proposed algorithms over the existing mutated PSO algorithms is that HPSO-TVAC do not involve any controlling parameter. Performance of the proposed algorithms is evaluated on standard benchmark functions. Comparative study shows that
HPSO-TVAC performs better than the other HPSO-TVAC, HPSO-TVAC, comprehensive learning PSO (CLPSO), adaptive-CLPSO (A-CLSPO), PSO with time-varying inertia weight (PSO-TVIW), and constriction factor PSO (CFPSO)for the benchmark functions considered. We apply the proposed algorithm to the synthesis of uniformly excited, unequally dpaced linear array to minimize sidelobe level (SLL) and to control first-null-beamwidth (FNBW) and null locations. Further, we apply the proposed algorithm to the synthesis of unequally spaced sparse planar array to minimize SLL.
“…In the particle swarm algorithm, the trajectory of each particle (i,e,, candidate solution to the optimization problem) in the search space is adjusted according to its own experience and the experience of the other particles in the swarm. It has been successfully applied in many different areas such as tieural network training [14], system modeling [15], and engineering design [16]. In this paper, it is applied to estimate LMD model parameters based on measured height and temperature profiles.…”
Section: System Identification Based On Psomentioning
A laser metal deposition height control methodology is presented in this paper. The height controller utilizes a particle swarm optimization (PSO) algorithm to estimate model parameters between layers using measured temperature and track height profiles. Using the estimated model, the powder flow rate reference profile, which will produce the desired layer height reference, is then generated using iterative learning control (ILC). The model parameter estimation performance using PSO is evaluated using a four-layer single track deposition, and the powder flow rate reference generation performance using ILC is tested using simulation. The results show that PSO and ILC perform well in estimating model parameters and generating powder flow rate references, respectively. The proposed height control methodology is then tested experimentally for tracking a constant height reference with constant traverse speed and constant laser power. The experimental results indicate that the controller performs well in tracking constant height references in comparison with the widely used fixed process parameter strategy. The application of layer-to-layer height control produces more consistent layer height increment and a more precise track height, which saves machining time and increases powder efficiency.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.