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.

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.

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.

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 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 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.

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.

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 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.

Sensors deployment optimization has become one of the most attractive fields in recent years. However, most of the previous work focused on the deployment problem in 2D space. Compared to the traditional form, sensors deployment in multidimensional space has greater research significance and practical potential to satisfy the detecting needs in complex environment. Aiming at solving this issue, a multi-dimensional space sensor network model is established, and the radar system is selected as an example. Considering the possible working mode of the radar system (e.g., searching and tracking), two distinctive deployment models are proposed based on maximum coverage area and maximum target detection probability in the attack direction respectively. The latter one is usually ignored in the previous literature. For uncovering the optimal deployment of the sensor network, the particle swarm optimization (PSO) algorithm is improved using the proposed weights determination scheme, in which the linear decreasing, the pooling strategy and the cloud theory are combined for weights updating. Experimental results illustrate the effectiveness of the proposed method.

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.

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.

The concept of unmanned weapon system-of-systems (UWSoS) involves a collection of various unmanned systems to achieve or accomplish a specific goal or mission. The mission reliability of UWSoS is represented by its ability to finish a required mission above the baselines of a given mission. However, issues with heterogeneity, cooperation between systems, and the emergence of UWSoS cannot be effectively solved by traditional system reliability methods. This study proposes an effective operation-loop-based mission reliability evaluation method for UWSoS by analyzing dynamic reconfiguration. First, we present a new connotation of an effective operation loop by considering the allocation of operational entities and physical resource constraints. Then, we propose an effective operation-loop-based mission reliability model for a heterogeneous UWSoS according to the mission baseline. Moreover, a mission reliability evaluation algorithm is proposed under random external shocks and topology reconfiguration, revealing the evolution law of the effective operation loop and mission reliability. Finally, a typical 60-unmanned-aerial-vehicle-swarm is taken as an example to demonstrate the proposed models and methods. The mission reliability is achieved by considering external shocks, which can serve as a reference for evaluating and improving the effectiveness of UWSoS.

This paper is concerned with the recursive filtering problem for a class of discrete-time nonlinear stochastic systems in the presence of multi-sensor measurement delay. The delay occurs in a multi-step and asynchronous manner, and the delay probability of each sensor is assumed to be known or unknown. Firstly, a new model is constructed to describe the measurement process, based on which a new particle filter is developed with the ability to fuse multi-sensor information in the case of known delay probability. In addition, an online delay probability estimation module is introduced in the particle filtering framework, which leads to another new filter that can be implemented without the prior knowledge of delay probability. More importantly, since there is no complex iterative operation, the resulting filter can be implemented recursively and is suitable for many real-time applications. Simulation results show the effectiveness of the proposed filters.

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.

With the passage of time, it has become important to investigate new methods for updating data to better fit the trends of the grey prediction model. The traditional GM(1,1) usually sets the grey action quantity as a constant. Therefore, it cannot effectively fit the dynamic characteristics of the sequence, which results in the grey model having a low precision. The linear grey action quantity model cannot represent the index change law. This paper presents a grey action quantity model, the exponential optimization grey model (EOGM(1,1)), based on the exponential type of grey action quantity; it is constructed based on the exponential characteristics of the grey prediction model. The model can fully reflect the exponential characteristics of the simulation series with time. The exponential sequence has a higher fitting accuracy. The optimized result is verified using a numerical example for the fluctuating sequence and a case study for the index of the tertiary industry’s GDP. The results show that the model improves the precision of the grey forecasting model and reduces the prediction error.

The time dependent vehicle routing problem with time windows (TDVRPTW) is considered. A multi-type ant system (MTAS) algorithm hybridized with the ant colony system (ACS) and the max-min ant system (MMAS) algorithms is proposed. This combination absorbs the merits of the two algorithms in solutions construction and optimization separately. In order to improve the efficiency of the insertion procedure, a nearest neighbor selection (NNS) mechanism, an insertion local search procedure and a local optimization procedure are specified in detail. And in order to find a balance between good scouting performance and fast convergence rate, an adaptive pheromone updating strategy is proposed in the MTAS. Computational results confirm the MTAS algorithm's good performance with all these strategies on classic vehicle routing problem with time windows (VRPTW) benchmark instances and the TDVRPTW instances, and some better results especially for the number of vehicles and travel times of the best solutions are obtained in comparison with the previous research.

Unmanned aerial vehicles (UAVs) may play an important role in data collection and offloading in vast areas deploying wireless sensor networks, and the UAV's action strategy has a vital influence on achieving applicability and computational complexity. Dynamic programming (DP) has a good application in the path planning of UAV, but there are problems in the applicability of special terrain environment and the complexity of the algorithm. Based on the analysis of DP, this paper proposes a hierarchical directional DP (DDP) algorithm based on direction determination and hierarchical model. We compare our methods with Q-learning and DP algorithm by experiments, and the results show that our method can improve the terrain applicability, meanwhile greatly reduce the computational complexity.

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.

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 study the orthogonal time frequency space signal transmission over multi-path channel in the presence of phase noise (PHN) at both sides of millimeter wave (mmWave) communication links. The statistics characteristics of the PHN-induced common phase error and inter-Doppler interference are investigated. Then, a column-shaped pilot structure is designed, and training pilots are used to realize linear-complexity PHN tracking and compensation. Numerical results demonstrate that the proposed scheme enables the signal to noise ratio loss to be restrained within 1 dB in contrast to the no PHN case.

In this paper, the formation control problem of second-order nonholonomic mobile robot systems is investigated in a dynamic event-triggered scheme. Event-triggered control protocols combined with persistent excitation (PE) conditions are presented. In event-detecting processes, an inactive time is introduced after each sampling instant, which can ensure a positive minimum sampling interval. To increase the flexibility of the event-triggered scheme, internal dynamic variables are included in event-triggering conditions. Moreover, the dynamic event-triggered scheme plays an important role in increasing the lengths of time intervals between any two consecutive events. In addition, event-triggered control protocols without forward and angular velocities are also presented based on approximate-differentiation (low-pass) filters. The asymptotic convergence results are given based on a nested Matrosov theorem and artificial sampling methods.

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.

Focusing on obstacle avoidance in three-dimensional space for unmanned aerial vehicle (UAV), the direct obstacle avoidance method in dynamic space based on three-dimensional velocity obstacle spherical cap is proposed, which quantifies the influence of threatening obstacles through velocity obstacle spherical cap parameters. In addition, the obstacle avoidance schemes of any point on the critical curve during the multi-obstacles avoidance are given. Through prediction, the insertion point for the obstacle avoidance can be obtained and the flight path can be replanned. Taking the Pythagorean Hodograph (PH) curve trajectory re-planning as an example, the three-dimensional direct obstacle avoidance method in dynamic space is tested. Simulation results show that the proposed method can realize the online obstacle avoidance trajectory re-planning, which increases the flexibility of obstacle avoidance greatly.

To analyze the behavioral model of the command, control, communication, computer, intelligence, surveillance, reconnaissance (C4ISR) architecture, we propose an executable modeling and analyzing approach to it. First, the meta concept model of the C4ISR architecture is introduced. According to the meta concept model, we construct the executable meta models of the C4ISR architecture by extending the meta models of fUML. Then, we define the concrete syntax and executable activity algebra (EAA) semantics for executable models. The semantics functions are introduced to translating the syntax description of executable models into the item of EAA. To support the execution of models, we propose the executable rules which are the structural operational semantics of EAA. Finally, an area air defense of the C4ISR system is used to illustrate the feasibility of the approach.

This paper investigates the sliding-mode-based fixed-time distributed average tracking (DAT) problem for multiple Euler-Lagrange systems in the presence of external disturbances. The primary objective is to devise controllers for each agent, enabling them to precisely track the average of multiple time-varying reference signals. By averaging these signals, we can mitigate the influence of errors and uncertainties arising during measurements, thereby enhancing the robustness and stability of the system. A distributed fixed-time average estimator is proposed to estimate the average value of global reference signals utilizing local information and communication with neighbors. Subsequently, a fixed-time sliding mode controller is introduced incorporating a state-dependent sliding mode function coupled with a variable exponent coefficient to achieve distributed average tracking of reference signals, and rigorous analytical methods are employed to substantiate the fixed-time stability. Finally, numerical simulation results are provided to validate the effectiveness of the proposed methodology, offering insights into its practical application and robust performance.