scholarly journals Synthesis of a Sparse 2D-Scanning Array using Particle Swarm Optimization for Side-Lobe Reduction

2021 ◽  
Vol 20 ◽  
pp. 112-116
Author(s):  
Sivaranjan Goswami ◽  
Kandarpa Kumar Sarma ◽  
Kumaresh Sarmah
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Side Lobe ◽  
Ann Model ◽  
Phased Array Antenna ◽  
Binary Matrix ◽  
Rectangular Array ◽  
Swarm Optimization ◽  
Wide Range ◽  
Artificial Neural Network Ann

Synthesis of sparse arrays is a promising area of research for a wide range of applications including radar and millimeter-wave wireless communication. The design goal of array thinning problems is to reduce the number of elements of an array without significantly affecting its performance. This work presents a technique for synthesizing a sparse phased-array antenna from a 16×16 uniform rectangular array (URA). The proposed approach reduces the number of elements by 50% without any significant increase in the peak sidelobe level (PSLL) for all possible scan angles in the azimuthal and elevation plans within a finite range of scan angles. The synthesis includes an artificial neural network (ANN) model for estimation of the excitation weights of the URA for a given scan-angle. The weights of the sparse array are computed by the Hadamard product of the weight matrix of the URA with a binary matrix that is obtained using particle swarm optimization (PSO) to minimize the PSLL.

scholarly journals Synthesis of a Sparse Planar Phased Array Antenna with Reduced Side-Lobe Level and Beam-Width using Particle Swarm Optimization

2021 ◽  
Vol 15 ◽  
pp. 1387-1393
Author(s):  
Sivaranjan Goswami ◽  
Kumaresh Sarmah ◽  
Kandarpa Kumar Sarma ◽  
Nikos E. Mastorakis
Keyword(s):  
Particle Swarm Optimization ◽  
Wireless Communication ◽  
Particle Swarm ◽  
Beam Width ◽  
Side Lobe Level ◽  
Ann Model ◽  
Binary Matrix ◽  
Rectangular Array ◽  
Swarm Optimization ◽  
Sparse Array

Computer aided synthesis of sparse array is a popular area of research worldwide for the application in radar and wireless communication. The trend is observing new heights with the launch of 5G millimeter wave wireless communication. A sparse array has a fewer number of elements than a conventional antenna array. In this work, a sparse array is synthesized from a 16×16 uniform rectangular array (URA). The synthesis includes an artificial neural network (ANN) model for estimation of the excitation weights of the URA for a given scan-angle. The weights of the sparse array are computed by the Hadamard product of the weight matrix of the URA with a binary matrix that is obtained using particle swarm optimization (PSO). The objective function of the optimization problem is formulated to ensure that the PSLL is minimized for multiple scan-angles. It is shown from experimental analysis that apart from minimizing the PSLL, the proposed approach yields a narrower beam-width than the original URA

scholarly journals A Modified NM-PSO Method for Parameter Estimation Problems of Models

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
An Liu ◽  
Erwie Zahara ◽  
Ming-Ta Yang
Keyword(s):  
Genetic Algorithm ◽  
Parameter Estimation ◽  
Particle Swarm Optimization ◽  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Wide Range ◽  
Estimation Problems

Ordinary differential equations usefully describe the behavior of a wide range of dynamic physical systems. The particle swarm optimization (PSO) method has been considered an effective tool for solving the engineering optimization problems for ordinary differential equations. This paper proposes a modified hybrid Nelder-Mead simplex search and particle swarm optimization (M-NM-PSO) method for solving parameter estimation problems. The M-NM-PSO method improves the efficiency of the PSO method and the conventional NM-PSO method by rapid convergence and better objective function value. Studies are made for three well-known cases, and the solutions of the M-NM-PSO method are compared with those by other methods published in the literature. The results demonstrate that the proposed M-NM-PSO method yields better estimation results than those obtained by the genetic algorithm, the modified genetic algorithm (real-coded GA (RCGA)), the conventional particle swarm optimization (PSO) method, and the conventional NM-PSO method.

scholarly journals Grid and Force Based Sensor Deployment Methods in Wireless Sensor Network using Particle Swarm Optimization

2018 ◽  
Vol 10 (3) ◽  
pp. 1287
Author(s):  
Aparna Pradeep Laturkar ◽  
Sridharan Bhavani ◽  
DeepaliParag Adhyapak
Keyword(s):  
Particle Swarm Optimization ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Particle Swarm ◽  
Wireless Sensor ◽  
Sensor Deployment ◽  
Packet Size ◽  
Swarm Optimization ◽  
Wide Range ◽  
Battery Capacity

Wireless Sensor Network (WSN) is emergingtechnology and has wide range of applications, such as environment monitoring, industrial automation and numerous military applications. Hence, WSN is popular among researchers. WSN has several constraints such as restricted sensing range, communication range and limited battery capacity. These limitations bring issues such as coverage, connectivity, network lifetime and scheduling & data aggregation. There are mainly three strategies for solving coverage problems namely; force, grid and computational geometry based. PSO is a multidimensional optimization method inspired from the social behavior of birds called flocking. Basic version of PSO has the drawback of sometimes getting trapped in local optima as particles learn from each other and past solutions. This issue is solved by discrete version of PSO known as Modified Discrete Binary PSO (MDBPSO) as it uses probabilistic approach. This paper discusses performance analysis of random; grid based MDBPSO (Modified Discrete Binary Particle Swarm Optimization), Force Based VFCPSO and Combination of Grid & Force Based sensor deployment algorithms based on interval and packet size. From the results of Combination of Grid & Force Based sensor deployment algorithm, it can be concluded that its performance is best for all parameters as compared to rest of the three methods when interval and packet size is varied.

scholarly journals Random, PSO and MDBPSO based Sensor Deployment in Wireless Sensor Network

2018 ◽  
Vol 10 (3) ◽  
pp. 1278 ◽  
Author(s):  
Aparna Pradeep Laturkar ◽  
Sridharan Bhavani ◽  
DeepaliParag Adhyapak
Keyword(s):  
Particle Swarm Optimization ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Particle Swarm ◽  
Wireless Sensor ◽  
Sensor Deployment ◽  
Binary Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Wide Range ◽  
Battery Capacity

Wireless Sensor Network (WSN) is emergingtechnology and has wide range of applications, such as environment monitoring, industrial automation and numerous military applications. Hence, WSN is popular among researchers. WSN has several constraints such as restricted sensing range, communication range and limited battery capacity. These limitations bring issues such as coverage, connectivity, network lifetime and scheduling and data aggregation. There are mainly three strategies for solving coverage problems namely; force, grid and computational geometry based. This paper discusses sensor deployment using Random; Particle Swarm Optimization (PSO) and grid based MDBPSO (Modified Discrete Binary Particle Swarm Optimization) methods. This paper analyzes the performance of Random, PSO based and MDBPSO based sensor deployment methods by varying different grid sizes and the region of interest (ROI). PSO and MDBPSO based sensor deployment methods are analyzed based on number of iterations. From the simulation results; it can be concluded that MDBPSO performs better than other two methods.

scholarly journals An Enhanced Partial Search to Particle Swarm Optimization for Unconstrained Optimization

Mathematics ◽  
2019 ◽  
Vol 7 (4) ◽  
pp. 357 ◽  
Author(s):  
Shu-Kai S. Fan ◽  
Chih-Hung Jen
Keyword(s):  
Particle Swarm Optimization ◽  
Unconstrained Optimization ◽  
Optimization Technique ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Particle Swarm Optimizer ◽  
Swarm Optimization ◽  
Searching Strategy ◽  
Wide Range

Particle swarm optimization (PSO) is a population-based optimization technique that has been applied extensively to a wide range of engineering problems. This paper proposes a variation of the original PSO algorithm for unconstrained optimization, dubbed the enhanced partial search particle swarm optimizer (EPS-PSO), using the idea of cooperative multiple swarms in an attempt to improve the convergence and efficiency of the original PSO algorithm. The cooperative searching strategy is particularly devised to prevent the particles from being trapped into the local optimal solutions and tries to locate the global optimal solution efficiently. The effectiveness of the proposed algorithm is verified through the simulation study where the EPS-PSO algorithm is compared to a variety of exiting “cooperative” PSO algorithms in terms of noted benchmark functions.

scholarly journals APLIKASI JARINGAN SARAF TIRUAN DAN PARTICLE SWARM OPTIMIZATION UNTUK PERAMALAN INDEKS HARGA SAHAM BURSA EFEK INDONESIA

2017 ◽  
Vol 6 (1) ◽  
pp. 22
Author(s):  
Desy Wartati ◽  
Nur Aini Masruroh
Keyword(s):  
Particle Swarm Optimization ◽  
Stock Price ◽  
Particle Swarm ◽  
Computation Time ◽  
Bp Algorithm ◽  
Stock Index ◽  
Ann Model ◽  
Training Process ◽  
Backpropagation Algorithm ◽  
Swarm Optimization

Jakarta Composite Index (JCI) is the main stock index in Indonesia Stock Exchange, which indicates the movement of the performance of all stocks listed. The data of stock price index often experience rapid fluctuations in a short time, so it is needed to carry out an analysis to help investor making the right investment decisions. Forecasting JCI is one of the activities that can be done because it helps to predict the value of the stock price in accordance with the past patterns, so it can be a consideration to make a decision. In this research, there are two forecasting models created to predict JCI, which are Artificial Neural Network (ANN) model with (1) Backpropagation algorithm (BP) and (2) Backpropagation algorithm model combined with Particle Swarm Optimization algorithm (PSO). The development of both models is done from the stage of the training process to obtain optimal weights on each network layer, followed by a stage of the testing process to determine whether the models are valid or not based on the tracking signals that are generated. ANN model is used because it is known to have the ability to process data that is nonlinear such as stock price indices and PSO is used to help ANN to gain weight with a fast computing time and tend to provide optimal results. Forecast results generated from both models are compared based on the error of computation time and forecast error. ANN model with BP algorithm generates computation time of training process for 4,9927 seconds with MSE of training and testing process is respectively 0,0031 and 0,0131, and MAPE of forecast results is 2,55%. ANN model with BP algorithm combined with PSO generates computation time of training process for 4,3867 seconds with MSE of training and testing process is respectively 0,0030 and 0,0062, and MAPE of forecast result is 1,88%. Based on these results, it can be concluded that ANN model with BP algorithm combined with PSO provides a more optimal result than ANN model with BP algorithm.

Sign in / Sign up

Export Citation Format

Share Document