For netted radars, a new alignment algorithm without prior spatial information (i.e., locations and attitudes of radars) and time delay is proposed to keep the spatio-temporal alignment. The unknown parameters to be estimated include the rotation matrix, the translation vector and the delay between radar stations in this paper. The minimum error function in unified space and time coordinate system is established based on the target trajectory measured by each radar. Firstly, the alternating spatio-temporal alignment method is used to estimate the spatial and temporal parameters, and its statistical performance is compared to the Cramer-Rao bound. Even under severe conditions in which each radar in the network can only observe part of the trajectory, the proposed algorithm can still be adopted to estimate the alignment parameters and complete the trajectory. Then, a trajectory matching algorithm based on random sample consensus (RANSAC) is proposed for multitarget. The corresponding relationship between trajectories is established through minimizing sum of paired trajectory error, and multitarget trajectories from each radar are matched. Finally, the spatio-temporal parameters are refined by all matched trajectory pairs. Simulation results show that the tracking information from different radars is transformed into a unified coordinate after spatio-temporal alignment. Moreover, the registration error is reduced and the tracking accuracy is improved.
Signal-to-noise ratio (SNR) gain of coherent signal fusions can be higher than non-coherent fusions for networked radars. However, the difficulty of the coherent fusion is that echoes from multiple radars are required to be accumulated with the same phase. The phase differences to be compensated are different for signals in different range-Doppler cells. Therefore, a cell-based coherent signal fusion in range-Doppler domain is proposed for networked radars, which is different from the existing fusions in echo domain. Before fusion, the range and Doppler compensation is made to keep the same target in the same range-Doppler cell for different radars. Then, we need to calculate the weight for each cell separately because of the different phase differences. An objective function is established to estimate the fusion weight for each range-Doppler cell using linearly constrained minimum power fusion. The weight maintains the signal power of the range-Doppler cell in which the target appears fixed after fusion, and minimizes the power of all cells. The range and velocity of the target in each cell are detected by cell averaging constant false alarm rate (CA-CFAR) detection on the signal fused by the corresponding weight. Simulation results show that the SNRs after fusion using the proposed algorithm are improved and the targets can be detected via CA-CFAR when a monostatic radar cannot detect the targets due to low SNRs. To verify the effectiveness of the proposed algorithm, a hardware test is carried out, and the result is consistent with the simulation result.
In modern electronic warfare, radar intelligence has become increasingly crucial when dealing with complex interference environments. This paper combines radar agile frequency technology with reinforcement learning to achieve adaptive frequency hopping for radar anti-jamming. Unlike traditional reinforcement learning with Markov decision processes (MDPs), the interaction between radar and jammers occurs within the partially observable Markov decision processes (POMDPs). In this context, the partial observation information available to the agent does not strictly satisfy the Markov property. This paper uses multiple layers of historical observation information to solve this problem. Historical observations can be viewed as a time series, and time-sensitive networks are employed to extract the temporal information embedded within the observations. In addition, the reward function is optimized to facilitate the faster learning of the agent in the jammer sweep environment. This simulation shows that the optimization of the agent state, network structure, and reward function can effectively help the radar to resist jamming.
4 June 2024 in IEEE Transactions on Aerospace and Electronic Systems
For networked radars on moving platforms, registration errors caused by time-varying relative positions and orientation angles deteriorate the target tracking accuracy significantly. In this paper, a spatio-temporal alignment method is proposed for networked radars on moving platforms by sharing the only parameter of Coherent Processing Intervals (CPIs). The time-varying spatio-temporal alignment parameters of moving radars are modelled as linear expressions of Discrete Cosine Transform (DCT) basis functions. The proposed method does not require the knowledge of positions and orientation angles of moving radars at each sample time and is suitable for asynchronous measurements from networked radars. For the registration objective function, the alignment parameter estimation using the steepest descent method is derived. In order to solve the problem of local optimal solution caused by the non-convexity of the objective function, a filling matrix based method for solving the global optimal solution of the registration function is proposed. Furthermore, the Cramér-Rao lower bound (CRLB) of the alignment parameter is derived for moving radars, which is compared with estimation errors of parameters. Simulation results show that this proposed alignment algorithm for moving radars improves the target tracking performance compared with the existing methods.