Orthogonal genetic algorithm for solving quadratic bilevel programming problems

A quadratic bilevel programming problem is transformed into a single level complementarity slackness problem by applying Karush-Kuhn-Tucker（KKT） conditions.To cope with the complementarity constraints,a binary encoding scheme is adopted for KKT multipliers,and then the complementarity slackness problem is simplified to successive quadratic programming problems,which can be solved by many algorithms available.Based on 0-1 binary encoding,an orthogonal genetic algorithm,in which the orthogonal experimental design with both two-level orthogonal array and factor analysis is used as crossover operator,is proposed.Numerical experiments on 10 benchmark examples show that the orthogonal genetic algorithm can find global optimal solutions of quadratic bilevel programming problems with high accuracy in a small number of iterations.

Probability Simulation Optimization Approach Using Orthogonal Genetic Algorithm

In order to solve the complex optimization problem dealing with uncertain phenomenon effectively, this paper presents a probability simulation optimization approach using orthogonal genetic algorithm. This approach synthesizes the computer simulation technology, orthogonal genetic algorithm and statistical test method faultlessly, which can solve complex optimization problem effectively. In this paper, the author gives the correlative conception of probability simulation optimization and describes the probability simulation optimization approach using orthogonal genetic algorithm in detail. Theoretically speaking, it has a strong rationality and maneuverability that can apply probability method in solving the complex optimization problems with uncertain phenomenon. In demonstration, the optimization performance of this method is better than other traditional methods. Simulation resuh suggests that the approach referred to this paper is feasible, correct and valid.

A NOVEL NULLING ALGORITHM IN THE SUBARRAY OF A LARGE ARRAY

Forming nulls in the radiation pattern of an antenna is to suppress the interference from certain directions or to cancel desired signals. This letter presents an effective method based on the Gram-Schmidt orthogonal algorithm for fonning nulls in the subarray of a large array. The theory and realizing methods are discussed, and the corresponding fonnulas are derived in details. The simulation results are given to demonstrate the feasibility, the availability and the quick-convergence of the presented method.

A modified OMP method for multi-orbit three dimensional ISAR imaging of the space target

The conventional two dimensional(2D)inverse synthetic aperture radar(ISAR)imaging fails to provide the targets'three dimensional(3D)information.In this paper,a 3D ISAR imaging method for the space target is proposed based on mutliorbit observation data and an improved orthogonal matching pursuit(OMP)algorithm.Firstly,the 3D scattered field data is converted into a set of 2D matrix by stacking slices of the 3D data along the elevation direction dimension.Then,an improved OMP algorithm is applied to recover the space target's amplitude information via the 2D matrix data.Finally,scattering centers can be reconstructed with specific three dimensional locations.Numerical simulations are provided to demonstrate the effectiveness and superiority of the proposed 3D imaging method.

GS-orthogonalization OMP method for space target detection via bistatic space-based radar

A space-based bistatic radar system composed of two space-based radars as the transmitter and the receiver respectively has a wider surveillance region and a better early warning capability for high-speed targets,and it can detect focused space targets more flexibly than the monostatic radar system or the ground-based radar system.However,the target echo signal is more difficult to process due to the high-speed motion of both space-based radars and space targets.To be specific,it will encounter the problems of Range Cell Migration(RCM)and Doppler Frequency Migration(DFM),which degrade the long-time coherent integration performance for target detection and localization inevitably.To solve this problem,a novel target detection method based on an improved Gram Schmidt(GS)-orthogonalization Orthogonal Matching Pursuit(OMP)algorithm is proposed in this paper.First,the echo model for bistatic space-based radar is constructed and the conditions for RCM and DFM are analyzed.Then,the proposed GS-orthogonalization OMP method is applied to estimate the equivalent motion parameters of space targets.Thereafter,the RCM and DFM are corrected by the compensation function correlated with the estimated motion parameters.Finally,coherent integration can be achieved by performing the Fast Fourier Transform(FFT)operation along the slow time direction on compensated echo signal.Numerical simulations and real raw data results validate that the proposed GS-orthogonalization OMP algorithm achieves better motion parameter estimation performance and higher detection probability for space targets detection.

Vision-based Estimation of Relative Pose in Autonomous Aerial Refueling

The lack of autonomous aerial refueling capabilities is one of the greatest limitations of unmanned aerial vehicles. This paper discusses the vision-based estimation of the relative pose of a tanker and unmanned aerial vehicle, which is a key issue in autonomous aerial refueling. The main task of this paper is to study the relative pose estimation for a tanker and unmanned aerial vehicle in the phase of commencing refueling and during refueling. The employed algorithm includes the initialization of the orientation parameters and an orthogonal iteration algorithm to estimate the optimal solution of rotation matrix and translation vector. In simulation experiments, because of the small variation in the rotation angle in aerial refueling, the method in which the initial rotation matrix is the identity matrix is found to be the most stable and accurate among methods. Finally, the paper discusses the effects of the number and configuration of feature points on the accuracy of the estimation results when using this method.