Most of the existing direction of arrival (DOA) estimation algorithms are applied under the assumption that the array manifold is ideal. In practical engineering applications, the existence of non-ideal conditions such as mutual coupling between array elements, array amplitude and phase errors, and array element position errors leads to defects in the array manifold, which makes the performance of the algorithm decline rapidly or even fail. In order to solve the problem of DOA estimation in the presence of amplitude and phase errors and array element position errors, this paper introduces the first-order Taylor expansion equivalent model of the received signal under the uniform linear array from the Bayesian point of view. In the solution, the amplitude and phase error parameters and the array element position error parameters are regarded as random variables obeying the Gaussian distribution. At the same time, the expectation-maximization algorithm is used to update the probability distribution parameters, and then the two error parameters are solved alternately to obtain more accurate DOA estimation results. Finally, the effectiveness of the proposed algorithm is verified by simulation and experiment.

Thinning of antenna arrays has been a popular topic for the last several decades. With increasing computational power, this optimization task acquired a new hue. This paper suggests a genetic algorithm as an instrument for antenna array thinning. The algorithm with a deliberately chosen fitness function allows synthesizing thinned linear antenna arrays with low peak sidelobe level (SLL) while maintaining the half-power beamwidth (HPBW) of a full linear antenna array. Based on results from existing papers in the field and known approaches to antenna array thinning, a classification of thinning types is introduced. The optimal thinning type for a linear thinned antenna array is determined on the basis of a maximum attainable SLL. The effect of thinning coefficient on main directional pattern characteristics, such as peak SLL and HPBW, is discussed for a number of amplitude distributions.

A mathematical model to determine the optimal production lot size for a deteriorating production system under an extended product inspection policy is developed. The last-K product inspection policy is considered so that the nonconforming items can be reduced, under which the last K products in a production lot are inspected and the nonconforming items from those inspected are reworked. Consider that the products produced towards the end of a production lot are more likely to be nonconforming, is proposed an extended product inspection policy for a deteriorating production system. That is, in a production lot, product inspections are performed among the middle K1 items and after inspections, all of the last K2 products are directly reworked without inspections. Our objective here is the joint optimization of the production lot size and the corresponding extended inspection policy such that the expected total cost per unit time is minimized. Since there is no closed form expression for our optimal policy, the existence for the optimal production inspection policy and an upper bound for the optimal lot size are obtained. Furthermore, an efficient solution procedure is provided to search for the optimal policy. Finally, numerical examples are given to illustrate the proposed model and indicate that the expected total cost per unit time of our product inspection model is less than that of the last-K inspection policy.

In order to obtain better inverse synthetic aperture radar (ISAR) image, a novel structure-enhanced spatial spectrum is proposed for estimating the incoherence parameters and fusing multiband. The proposed method takes full advantage of the original electromagnetic scattering data and its conjugated form by combining them with the novel covariance matrices. To analyse the superiority of the modified algorithm, the mathematical expression of equivalent signal to noise ratio (SNR) is derived, which can validate our proposed algorithm theoretically. In addition, compared with the conventional matrix pencil (MP) algorithm and the conventional root-multiple signal classification (Root-MUSIC) algorithm, the proposed algorithm has better parameter estimation performance and more accurate multiband fusion results at the same SNR situations. Validity and effectiveness of the proposed algorithm is demonstrated by simulation data and real radar data.

In this paper, we propose a beam space coversion (BSC)-based approach to achieve a single near-field signal localization under uniform circular array (UCA). By employing the centro-symmetric geometry of UCA, we apply BSC to extract the two-dimensional (2-D) angles of near-field signal in the Vandermonde form, which allows for azimuth and elevation angle estimation by utilizing the improved estimation of signal parameters via rotational invariance techniques (ESPRIT) algorithm. By substituting the calculated 2-D angles into the direction vector of near-field signal, the range parameter can be consequently obtained by the 1-D multiple signal classification (MUSIC) method. Simulations demonstrate that the proposed algorithm can achieve a single near-field signal localization, which can provide satisfactory performance and reduce computational complexity.

Traditional multi-band frequency selective surface (FSS) approaches are hard to achieve a perfect resonance response in a wide band due to the limit of the onset grating lobe frequency determined by the array. To solve this problem, an approach of combining elements in different period to build a hybrid array is presented. The results of series of numerical simulation show that multi-periodicity combined element FSS, which are designed using this approach, usually have much weaker grating lobes than the traditional FSS. Furthermore, their frequency response can be well predicted through the properties of their member element FSS. A prediction method for estimating the degree of expected grating lobe energy loss in designing multi-band FSS using this approach is provided.

The wheel brake system safety is a complex problem which refers to its technical state, operating environment, human factors, etc., in aircraft landing taxiing process. Usually, professors consider system safety with traditional probability techniques based on the linear chain of events. However, it could not comprehensively analyze system safety problems, especially in operating environment, interaction of subsystems, and human factors. Thus, we consider system safety as a control problem based on the system-theoretic accident model, the processes (STAMP) model and the system theoretic process analysis (STPA) technique to compensate the deficiency of traditional techniques. Meanwhile, system safety simulation is considered as system control simulation, and Monte Carlo methods are used which consider the range of uncertain parameters and operation deviation to quantitatively study system safety influence factors in control simulation. Firstly, we construct the STAMP model and STPA feedback control loop of the wheel brake system based on the system functional requirement. Then four unsafe control actions are identified, and causes of them are analyzed. Finally, we construct the Monte Carlo simulation model to analyze different scenarios under disturbance. The results provide a basis for choosing corresponding process model variables in constructing the context table and show that appropriate brake strategies could prevent hazards in aircraft landing taxiing.

According to the measurement principle of the traditional interferometer, a narrowband signal model is established and used, however, for wideband signals or multiple signals, this model is invalid. For the problems of direction finding with interferometer for wideband signals and multiple signals scene, a frequency domain phase interferometer is proposed and the concrete implementation scheme is given. The proposed method computes the phase difference in frequency domain, and finds multi-target results with judging the spectrum amplitude changing, and uses the frequency phase difference to compute the arrival angle. Theoretical analysis and simulation results show that the proposed method effectively solves the problem of the angle estimation with phase interferometer for wideband signals, and has good performance in multiple signals scene with non-overlapping spectrum or partially overlapping. In addition, the wider the signal bandwidth, the better direction finding performance of this algorithm.

Ant colony optimization (ACO) is a random search algorithm based on probability calculation. However, the uninformed search strategy has a slow convergence speed. The Bayesian algorithm uses the historical information of the searched point to determine the next search point during the search process, reducing the uncertainty in the random search process. Due to the ability of the Bayesian algorithm to reduce uncertainty, a Bayesian ACO algorithm is proposed in this paper to increase the convergence speed of the conventional ACO algorithm for image edge detection. In addition, this paper has the following two innovations on the basis of the classical algorithm, one of which is to add random perturbations after completing the pheromone update. The second is the use of adaptive pheromone heuristics. Experimental results illustrate that the proposed Bayesian ACO algorithm has faster convergence and higher precision and recall than the traditional ant colony algorithm, due to the improvement of the pheromone utilization rate. Moreover, Bayesian ACO algorithm outperforms the other comparative methods in edge detection task.

This paper presents a path planning approach for rotary unmanned aerial vehicles (R-UAVs) in a known static rough terrain environment. This approach aims to find collision-free and feasible paths with minimum altitude, length and angle variable rate. First, a three-dimensional (3D) modeling method is proposed to reduce the computation burden of the dynamic models of R-UAVs. Considering the length, height and tuning angle of a path, the path planning of R-UAVs is described as a tri-objective optimization problem. Then, an improved multi-objective particle swarm optimization algorithm is developed. To render the algorithm more effective in dealing with this problem, a vibration function is introduced into the collided solutions to improve the algorithm efficiency. Meanwhile, the selection of the global best position is taken into account by the reference point method. Finally, the experimental environment is built with the help of the Google map and the 3D terrain generator World Machine. Experimental results under two different rough terrains from Guilin and Lanzhou of China demonstrate the capabilities of the proposed algorithm in finding Pareto optimal paths.

Jamming suppression is traditionally achieved through the use of spatial filters based on array signal processing theory. In order to achieve better jamming suppression performance, many studies have applied blind source separation (BSS) to jamming suppression. BSS can achieve the separation and extraction of the individual source signals from the mixed signal received by the array. This paper proposes a perspective to recognize BSS as spatial band-pass filters (SBPFs) for jamming suppression applications. The theoretical derivation indicates that the processing of mixed signals by BSS can be perceived as the application of a set of SBPFs that gate the source signals at various angles. Simulations are performed using radar jamming suppression as an example. The simulation results suggest that BSS and SBPFs produce approximately the same effects. Simulation results are consistent with theoretical derivation results.

Solar radio burst (SRB) is one of the main natural interference sources of Global Positioning System (GPS) signals and can reduce the signal-to-noise ratio (SNR), directly affecting the tracking performance of GPS receivers. In this paper, a tracking algorithm based on the adaptive Kalman filter (AKF) with carrier-to-noise ratio estimation is proposed and compared with the conventional second-order phase-locked loop tracking algorithms and the improved Sage-Husa adaptive Kalman filter (SHAKF) algorithm. It is discovered that when the SRBs occur, the improved SHAKF and the AKF with carrier-to-noise ratio estimation enable stable tracking to loop signals. The conventional second-order phase-locked loop tracking algorithms fail to track the receiver signal. The standard deviation of the carrier phase error of the AKF with carrier-to-noise ratio estimation outperforms 50.51% of the improved SHAKF algorithm, showing less fluctuation and better stability. The proposed algorithm is proven to show more excellent adaptability in the severe environment caused by the SRB occurrence and has better tracking performance.

For the rapidly developing unmanned aerial vehicle (UAV) swarm, the system-of-systems (SoS) oriented design is a prospective conceptual design methodology due to the competence for complex mission requirements and subsystems interactions. In the SoS oriented design, the subsystems performance trade-off is the basis of design decisions. In the trade-off for surveillance missions, most previous works do not consider track reporting and mainly focus on the design of platforms. An improved method for the subsystems performance trade-off in the SoS oriented UAV swarm design is proposed. Within an improved design framework with subsystems disaggregation, this method is characterized by treating platforms, sensors, and communications as equally important subsystems, integrating operational strategies into the trade-off, and enabling the trade-off for track reporting. Those advantages are achieved by a behavior-based modular model structure for agent-based operational modeling and simulation. In addition, a method of analyzing the bounds of the communication range is also presented. Simulation experiments are conducted by using precision-based simulation replication rules and surrogate modeling methods. The results demonstrate the effectiveness of the proposed method, and show that the configuration of area partitioning changes the trade space of subsystems performances, indicating the necessity of integrating operational strategies into the conceptual design.

With the continuous improvement of radar intelligence, it is difficult for traditional countermeasures to achieve ideal results. In order to deal with complex, changeable, and unknown threat signals in the complex electromagnetic environment, a waveform intelligent optimization model based on intelligent optimization algorithm is proposed. By virtue of the universality and fast running speed of the intelligent optimization algorithm, the model can optimize the parameters used to synthesize the countermeasure waveform according to different external signals, so as to improve the countermeasure performance. Genetic algorithm (GA) and particle swarm optimization (PSO) are used to simulate the intelligent optimization of interrupted-sampling and phase-modulation repeater waveform. The experimental results under different radar signal conditions show that the scheme is feasible. The performance comparison between the algorithms and some problems in the experimental results also provide a certain reference for the follow-up work.

To utilizing the characteristic of radar cross section (RCS) of the low detectable aircraft, a special path planning algorithm to eluding radars by the variable RCS is presented. The algorithm first gives the RCS changing model of low detectable aircraft, then establishes a threat model of a ground-based air defense system according to the relations between RCS and the radar range coverage. By the new cost functions of the flight path, which consider both factors of the survival probability and the distance of total route, this path planning method is simulated based on the Dijkstra algorithm, and the planned route meets the flight capacity constraints. Simulation results show that using the effective path planning algorithm, the low detectable aircraft can give full play to its own advantage of stealth to achieve the purpose of silent penetration.

In the applications of joint control and robot movement, the joint torque estimation has been treated as an effective technique and widely used. Researches are made to analyze the kinematic and compliance model of the robot joint with harmonic drive to acquire high precision torque output. Through analyzing the structures of the harmonic drive and experiment apparatus, a scheme of the proposed joint torque estimation method based on both the dynamic characteristics and unscented Kalman filter (UKF) is designed and built. Based on research and scheme, torque estimation methods in view of only harmonic drive compliance model and compliance model with the Kalman filter are simulated as guidance and reference to promote the research on the torque estimation technique. Finally, a promoted torque estimation method depending on both harmonic drive compliance model and UKF is designed, and simulation results compared with the measurements of a commercial torque sensor, have verified the effectiveness of the proposed method.

The non-minimum phase feature of tail-controlled missile airframes is analyzed. Three selection strategies for desired performance indexes are presented. An acceleration autopilot design methodology based on output feedback and optimization is proposed. Performance and robustness comparisons between the two-loop and classical three-loop topologies are made. Attempts to improve the classical three-loop topology are discussed. Despite the same open-loop structure, the classical three-loop autopilot shows distinct characteristics from a two-loop autopilot with PI compensator. Both the two-loop and three-loop topologies can stabilize a static unstable missile. However, the finite actuator resource is the crucial factor dominating autopilot function.

The theory of compressed sensing (CS) provides a new chance to reduce the data acquisition time and improve the data usage factor of the stepped frequency radar system. In light of the sparsity of radar target reflectivity, two imaging methods based on CS, termed the CS-based 2D joint imaging algorithm and the CS-based 2D decoupled imaging algorithm, are proposed. These methods incorporate the coherent mixing operation into the sparse dictionary, and take random measurements in both range and azimuth directions to get high resolution radar images, thus can remarkably reduce the data rate and simplify the hardware design of the radar system while maintaining imaging quality. Experimentsfrom both simulated data and measured data in the anechoic chamber show that the proposed imaging methods can get more focused images than the traditional fast Fourier transform method. Wherein the joint algorithm has stronger robustness and can provide clearer inverse synthetic aperture radar images, while the decoupled algorithm is computationally more efficient but has slightly degraded imaging quality, which can be improved by increasing measurements or using a robuster recovery algorithm nevertheless

The earth observation satellites (EOSs) scheduling problem for emergency tasks often presents many challenges. For example, the scheduling calculation should be completed in seconds, the scheduled task rate is supposed to be as high as possible, the disturbance measure of the scheme should be as low as possible, which may lead to the loss of important observation opportunities and data transmission delays. Existing scheduling algorithms are not designed for these requirements. Consequently, we propose a rolling horizon strategy (RHS) based on event triggering as well as a heuristic algorithm based on direct insertion, shifting, backtracking, deletion, and reinsertion (ISBDR). In the RHS, the driven scheduling mode based on the emergency task arrival and control station time window events are designed to transform the long-term, large-scale problem into a short-term, small-scale problem, which can improve the schedulability of the original scheduling scheme and emergency response sensiti-vity. In the ISBDR algorithm, the shifting rule with breadth search capability and backtracking rule with depth search capability are established to realize the rapid adjustment of the original plan and improve the overall benefit of the plan and early completion of emergency tasks. Simultaneously, two heuristic factors, namely the emergency task urgency degree and task conflict degree, are constructed to improve the emergency task scheduling guidance and algorithm efficiency. Finally, we conduct extensive experiments by means of simulations to compare the algorithms based on ISBDR and direct insertion, shifting, deletion, and reinsertion (ISDR). The results demonstrate that the proposed algorithm can improve the timeliness of emergency tasks and scheduling performance, and decrease the disturbance measure of the scheme, therefore, it is more suitable for emergency task scheduling.

The problem of scheduling radar dwells in multifunction phased array radar systems is addressed. A novel dwell scheduling algorithm is proposed. The whole scheduling process is based on an online pulse interleaving technique. It takes the system timing and energy constraints into account. In order to adapt the dynamic task load, the algorithm considers both the priorities and deadlines of tasks.  The simulation results demonstrate that compared with the conventional adaptive dwell scheduling algorithm, the proposed one can improve the task drop rate and system resource utility effectively.

A method is proposed to resolve the typical problem of air combat situation assessment. Taking the one-to-one air combat as an example and on the basis of air combat data recorded by the air combat maneuvering instrument, the problem of air combat situation assessment is equivalent to the situation classification problem of air combat data. The fuzzy C-means clustering algorithm is proposed to cluster the selected air combat sample data and the situation classification of the data is determined by the data correlation analysis in combination with the clustering results and the pilots' description of the air combat process. On the basis of semi-supervised naive Bayes classifier, an improved algorithm is proposed based on data classification confidence, through which the situation classification of air combat data is carried out. The simulation results show that the improved algorithm can assess the air combat situation effectively and the improvement of the algorithm can promote the classification performance without significantly affecting the efficiency of the classifier.

A system of systems (SoS) composes a set of independent constituent systems (CSs), where the degree of authority to control the independence of CSs varies, depending on different SoS types. Key researchers describe four SoS types with descending levels of central authority: directed, acknowledged, collaborative and virtual. Although the definitions have been recognized in SoS engineering, what is challenging is the difficulty of translating these definitions into models and simulation environments. Thus, we provide a goal-based method including a mathematical baseline to translate these definitions into more effective agent-based modeling and simulations. First, we construct the theoretical models of CS and SoS. Based on the theoretical models, we analyze the degree of authority influenced by SoS characteristics. Next, we propose a definition of SoS types by quantitatively explaining the degree of authority. Finally, we recognize the differences between acknowledged SoS and collaborative SoS using a migrating waterfowl flock by an agent-based model (ABM) simulation. This paper contributes to the SoS body of knowledge by increasing our understanding of the degree of authority in an SoS, so we may identify suitable SoS types to achieve SoS goals by modeling and simulation.

The dynamic weapon target assignment (DWTA) problem is of great significance in modern air combat. However, DWTA is a highly complex constrained multi-objective combinatorial optimization problem. An improved elitist non-dominated sorting genetic algorithm-II (NSGA-II) called the non-dominated shuffled frog leaping algorithm (NSFLA) is proposed to maximize damage to enemy targets and minimize the self-threat in air combat constraints. In NSFLA, the shuffled frog leaping algorithm (SFLA) is introduced to NSGA-II to replace the inside evolutionary scheme of the genetic algorithm (GA), displaying low optimization speed and heterogeneous space search defects. Two improvements have also been raised to promote the internal optimization performance of SFLA. Firstly, the local evolution scheme, a novel crossover mechanism, ensures that each individual participates in updating instead of only the worst ones, which can expand the diversity of the population. Secondly, a discrete adaptive mutation algorithm based on the function change rate is applied to balance the global and local search. Finally, the scheme is verified in various air combat scenarios. The results show that the proposed NSFLA has apparent advantages in solution quality and efficiency, especially in many aircraft and the dynamic air combat environment.

In consideration of the field-of-view (FOV) angle constraint, this study focuses on the guidance problem with impact time control. A deep reinforcement learning guidance method is given for the missile to obtain the desired impact time and meet the demand of FOV angle constraint. On basis of the framework of the proportional navigation guidance, an auxiliary control term is supplemented by the distributed deep deterministic policy gradient algorithm, in which the reward functions are developed to decrease the time-to-go error and improve the terminal guidance accuracy. The numerical simulation demonstrates that the missile governed by the presented deep reinforcement learning guidance law can hit the target successfully at appointed arrival time.

In this paper, the reactive splitter network and metasurface are proposed to radiate the wide-beam isolated element pattern and suppress mutual coupling (MC) of the low-profile phased array with the triangular lattice, respectively. Thus, broadband wide-angle impedance matching (WAIM) is implemented to promote two-dimensional (2D) wide scanning. For the isolated element, to radiate the wide-beam patterns approximating to the cosine form, two identical slots backed on one substrate integrated cavity are excited by the feeding network consisting of a reactive splitter and two striplines connected with splitter output paths. For adjacent elements staggered with each other, with the metasurface superstrate, the even-mode coupling voltages on the reactive splitter are cancelled out, yielding reduced MC. With the suppression of MC and the compensation of isolated element patterns, WAIM is realized to achieve 2D wide-angle beam steering up to ± 65° in E-plane, ± 45° in H-plane and ± 60° in D-plane from 4.9 GHz to 5.85 GHz.

In this paper, the newly-derived maximum correntropy Kalman filter (MCKF) is re-derived from the M-estimation perspective, where the MCKF can be viewed as a special case of the M-estimations and the Gaussian kernel function is a special case of many robust cost functions. Based on the derivation process, a unified form for the robust Gaussian filters (RGF) based on M-estimation is proposed to suppress the outliers and non-Gaussian noise in the measurement. The RGF provides a unified form for one Gaussian filter with different cost functions and a unified form for one robust filter with different approximating methods for the involved Gaussian integrals. Simulation results show that RGF with different weighting functions and different Gaussian integral approximation methods has robust anti-jamming performance.

This paper proposes a fast integral terminal sliding mode (ITSM) control method for a cascaded nonlinear dynamical system with mismatched uncertainties. Firstly, an integral terminal sliding mode surface is presented, which not only avoids the singularity in the traditional terminal sliding mode, but also addresses the mismatched problems in the nonlinear control system. Secondly, a new ITSM controller with finite convergence time based on the backstepping technique is derived for a cascaded nonlinear dynamical system with mismatched uncertainties. Thirdly, the convergence time of ITSM is analyzed, whose convergence speed is faster than those of two nonsingular terminal sliding modes. Finally, simulation results are presented in order to evaluate the effectiveness of ITSM control strategies for mismatched uncertainties.

This paper proposes a parallel cyclic shift structure of address decoder to realize a high-throughput encoding and decoding method for irregular-quasi-cyclic low-density parity-check (IR-QC-LDPC) codes, with a dual-diagonal parity structure. A normalized min-sum algorithm (NMSA) is employed for decoding. The whole verification of the encoding and decoding algorithm is simulated with Matlab, and the code rates of 5/6 and 2/3 are selected respectively for the initial bit error ratio as 6% and 1.04%. Based on the results of simulation, multi-code rates are compatible with different basis matrices. Then the simulated algorithms of encoder and decoder are migrated and implemented on the field programmable gate array (FPGA). The 183.36 Mbps throughput of encoder and the average 27.85 Mbps decoding throughput with the initial bit error ratio 6% are realized based on FPGA.

Rotating machinery is widely used in the industry. They are vulnerable to many kinds of damages especially for those working under tough and time-varying operation conditions. Early detection of these damages is important, otherwise, they may lead to large economic loss even a catastrophe. Many signal processing methods have been developed for fault diagnosis of the rotating machinery. Local mean decomposition (LMD) is an adaptive mode decomposition method that can decompose a complicated signal into a series of mono-components, namely product functions (PFs). In recent years, many researchers have adopted LMD in fault detection and diagnosis of rotating machines. We give a comprehensive review of LMD in fault detection and diagnosis of rotating machines. First, the LMD is described. The advantages, disadvantages and some improved LMD methods are presented. Then, a comprehensive review on applications of LMD in fault diagnosis of the rotating machinery is given. The review is divided into four parts:fault diagnosis of gears, fault diagnosis of rotors, fault diagnosis of bearings, and other LMD applications. In each of these four parts, a review is given to applications applying the LMD, improved LMD, and LMD-based combination methods, respectively. We give a summary of this review and some future potential topics at the end.

Moth-flame optimization (MFO) is a novel metaheuristic algorithm inspired by the characteristics of a moth's navigation method in nature called transverse orientation. Like other metaheuristic algorithms, it is easy to fall into local optimum and leads to slow convergence speed. The chaotic map is one of the best methods to improve exploration and exploitation of the metaheuristic algorithms. In the present study, we propose a chaos-enhanced MFO (CMFO) by incorporating chaos maps into the MFO algorithm to enhance its performance. The chaotic map is utilized to initialize the moths' population, handle the boundary overstepping, and tune the distance parameter. The CMFO is benchmarked on three groups of benchmark functions to find out the most efficient one. The performance of the CMFO is also verified by using two real engineering problems. The statistical results clearly demonstrate that the appropriate chaotic map (singer map) embedded in the appropriate component of MFO can significantly improve the performance of MFO.