scholarly journals Signal Subspace Reconstruction for DOA Detection Using Quantum-Behaved Particle Swarm Optimization

2021 ◽  
Vol 13 (13) ◽  
pp. 2560
Author(s):  
Rui Zhang ◽  
Kaijie Xu ◽  
Yinghui Quan ◽  
Shengqi Zhu ◽  
Mengdao Xing

Spatial spectrum estimation, also known as direction of arrival (DOA) detection, is a popular issue in many fields, including remote sensing, radar, communication, sonar, seismic exploration, radio astronomy, and biomedical engineering. MUltiple SIgnal Classification (MUSIC) and Estimation Signal Parameter via Rotational Invariance Technique (ESPRIT), which are well-known for their high-resolution capability for detecting DOA, are two examples of an eigen-subspace algorithm. However, missed detection and estimation accuracy reduction often occur due to the low signal-to-noise ratio (SNR) and snapshot deficiency (small time-domain samples of the observed signal), especially for sources with different SNRs. To avoid the above problems, in this study, we develop a DOA detection approach through signal subspace reconstruction using Quantum-Behaved Particle Swarm Optimization (QPSO). In the developed scheme, according to received data, a noise subspace is established through performing an eigen-decomposition operation on a sampling covariance matrix. Then, a collection of angles randomly selected from the observation space are used to build a potential signal subspace on the basis of the steering matrix of the array. Afterwards, making use of the fact that the signal space is orthogonal to the noise subspace, a cost function, which contains the desired DOA information, is designed. Thus, the problem of capturing the DOA information can be transformed into the optimization of the already constructed cost function. In this respect, the DOA finding of multiple signal sources—that is, the multi-objective optimization problem—can be regarded as a single objective optimization problem, which can effectively reduce the probability of missed detection of the signals. Subsequently, the QPSO is employed to determine an optimal signal subspace by minimizing the orthogonality error so as to obtain the DOA. Ultimately, the performance of DOA detection is improved. An explicit analysis and derivation of the developed scheme are provided. The results of computer simulation show that the proposed scheme has superior estimation performance when detecting signals with very different SNR levels and small snapshots.

2014 ◽  
Vol 984-985 ◽  
pp. 1295-1300
Author(s):  
S.R. Darsana ◽  
K. Dhayalini ◽  
S. Sathiyamoorthy

This paper deals with solution of economic dispatch problem with smooth and non smooth cost function. With practical consideration, ED will have non smooth cost functions with equality and inequality constraints that make the problem, a large-scale highly constrained nonlinear optimization problem. Here particle swarm optimization (PSO) technique is used to solve economic dispatch. PSO based algorithm is easy to implement and it performs well on optimization problem. To demonstrate the effectiveness of the proposed method it is being applied to test ED problems, with smooth and non smooth cost functions. Comparison with lagrangian relaxation method showed the superiority of the proposed approach to check the efficiency, studies have been performed for 6 generating unit with smooth cost function. Numerical simulations indicate an improvement in total fuel cost savings.


Processes ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 2000
Author(s):  
Jin-Hwan Lee ◽  
Woo-Jung Kim ◽  
Sang-Yong Jung

This paper proposes a robust optimization algorithm customized for the optimal design of electric machines. The proposed algorithm, termed “robust explorative particle swarm optimization” (RePSO), is a hybrid algorithm that affords high accuracy and a high search speed when determining robust optimal solutions. To ensure the robustness of the determined optimal solution, RePSO employs the rate of change of the cost function. When this rate is high, the cost function appears as a steep curve, indicating low robustness; in contrast, when the rate is low, the cost function takes the form of a gradual curve, indicating high robustness. For verification, the performance of the proposed algorithm was compared with those of the conventional methods of robust particle swarm optimization and explorative particle swarm optimization with a Gaussian basis test function. The target performance of the traction motor for the optimal design was derived using a simulation of vehicle driving performance. Based on the simulation results, the target performance of the traction motor requires a maximum torque and power of 294 Nm and 88 kW, respectively. The base model, an 8-pole 72-slot permanent magnet synchronous machine, was designed considering the target performance. Accordingly, an optimal design was realized using the proposed algorithm. The cost function for this optimal design was selected such that the torque ripple, total harmonic distortion of back-electromotive force, and cogging torque were minimized. Finally, experiments were performed on the manufactured optimal model. The robustness and effectiveness of the proposed algorithm were validated by comparing the analytical and experimental results.


Author(s):  
Wei-Der Chang ◽  

Particle swarm optimization (PSO) is the most important and popular algorithm to solving the engineering optimization problem due to its simple updating formulas and excellent searching capacity. This algorithm is one of evolutionary computations and is also a population-based algorithm. Traditionally, to demonstrate the convergence analysis of the PSO algorithm or its related variations, simulation results in a numerical presentation are often given. This way may be unclear or unsuitable for some particular cases. Hence, this paper will adopt the illustration styles instead of numeric simulation results to more clearly clarify the convergence behavior of the algorithm. In addition, it is well known that three parameters used in the algorithm, i.e., the inertia weight w, position constants c1 and c2, sufficiently dominate the whole searching performance. The influence of these parameter settings on the algorithm convergence will be considered and examined via a simple two-dimensional function optimization problem. All simulation results are displayed using a series of illustrations with respect to various iteration numbers. Finally, some simple rules on how to suitably assign these parameters are also suggested


2019 ◽  
Vol 10 (1) ◽  
pp. 203 ◽  
Author(s):  
Luan N. T. Huynh ◽  
Quoc-Viet Pham ◽  
Xuan-Qui Pham ◽  
Tri D. T. Nguyen ◽  
Md Delowar Hossain ◽  
...  

In recent years, multi-access edge computing (MEC) has become a promising technology used in 5G networks based on its ability to offload computational tasks from mobile devices (MDs) to edge servers in order to address MD-specific limitations. Despite considerable research on computation offloading in 5G networks, this activity in multi-tier multi-MEC server systems continues to attract attention. Here, we investigated a two-tier computation-offloading strategy for multi-user multi-MEC servers in heterogeneous networks. For this scenario, we formulated a joint resource-allocation and computation-offloading decision strategy to minimize the total computing overhead of MDs, including completion time and energy consumption. The optimization problem was formulated as a mixed-integer nonlinear program problem of NP-hard complexity. Under complex optimization and various application constraints, we divided the original problem into two subproblems: decisions of resource allocation and computation offloading. We developed an efficient, low-complexity algorithm using particle swarm optimization capable of high-quality solutions and guaranteed convergence, with a high-level heuristic (i.e., meta-heuristic) that performed well at solving a challenging optimization problem. Simulation results indicated that the proposed algorithm significantly reduced the total computing overhead of MDs relative to several baseline methods while guaranteeing to converge to stable solutions.


2013 ◽  
Vol 686 ◽  
pp. 266-272 ◽  
Author(s):  
Syarizal Fonna ◽  
M. Ridha ◽  
Syifaul Huzni ◽  
Ahmad Kamal Ariffin

Particle Swarm Optimization (PSO) has been applied as optimization tool in various engineering problems. Inverse analysis is one of the potential application fields for PSO. In this research, the behavior of PSO, related to its inertia weight, in boundary element inverse analysis for detecting corrosion of rebar in concrete is studied. Boundary element inverse analysis was developed by combining BEM and PSO. The inverse analysis is carried out by means of minimizing a cost function. The cost function is a residual between the calculated and measured potentials on the concrete surface. The calculated potentials are obtained by solving the Laplace’s equation using BEM. PSO is used to minimize the cost function. Thus, the corrosion profile of concrete steel, such as location and size, can be detected. Variation in its inertia weight was applied to analyze the behavior of PSO for inverse analysis. The numerical simulation results show that PSO can be used for the inverse analysis for detecting rebar corrosion by combining with BEM. Also, it shows different behavior in minimizing cost function depending on inertia weight.


Energies ◽  
2020 ◽  
Vol 13 (21) ◽  
pp. 5679
Author(s):  
Mohamed A. M. Shaheen ◽  
Dalia Yousri ◽  
Ahmed Fathy ◽  
Hany M. Hasanien ◽  
Abdulaziz Alkuhayli ◽  
...  

The appropriate planning of electric power systems has a significant effect on the economic situation of countries. For the protection and reliability of the power system, the optimal reactive power dispatch (ORPD) problem is an essential issue. The ORPD is a non-linear, non-convex, and continuous or non-continuous optimization problem. Therefore, introducing a reliable optimizer is a challenging task to solve this optimization problem. This study proposes a robust and flexible optimization algorithm with the minimum adjustable parameters named Improved Marine Predators Algorithm and Particle Swarm Optimization (IMPAPSO) algorithm, for dealing with the non-linearity of ORPD. The IMPAPSO is evaluated using various test cases, including IEEE 30 bus, IEEE 57 bus, and IEEE 118 bus systems. An effectiveness of the proposed optimization algorithm was verified through a rigorous comparative study with other optimization methods. There was a noticeable enhancement in the electric power networks behavior when using the IMPAPSO method. Moreover, the IMPAPSO high convergence speed was an observed feature in a comparison with its peers.


2014 ◽  
Vol 1044-1045 ◽  
pp. 1418-1423
Author(s):  
Pasura Aungkulanon

Machining optimization problem aims to optimize machinery conditions which are important for economic settings. The effective methods for solving these problems using a finite sequence of instructions can be categorized into two groups; exact optimization algorithm and meta-heuristic algorithms. A well-known meta-heuristic approach called Harmony Search Algorithm was used to compare with Particle Swarm Optimization. We implemented and analysed algorithms using unconstrained problems under different conditions included single, multi-peak, curved ridge optimization, and machinery optimization problem. The computational outputs demonstrated the proposed Particle Swarm Optimization resulted in the better outcomes in term of mean and variance of process yields.


Sign in / Sign up

Export Citation Format

Share Document