The accuracy of X-ray pulsar-based navigation is greatly affected by the Doppler effect caused by the spacecraft orbital motion and the systematic biases introduced by the pulsar directional error, spacecraft-borne clock error, etc. In this paper, an innovative navigation method simultaneously employing the pulse phase (PP), the difference of two neighbor PPs (DPP) and the Doppler frequency (DF) of X-ray pulsars as measurements is proposed to solve this problem. With the aid of the spacecraft orbital dynamics, a single pair of PP and DF relative to the spacecraft’s state estimation error can be estimated by using the joint probability density function of the arrival photon timestamps as the likelihood function. The systematic biases involved to the PP is proved to be nearly invariant over two adjacent navigation periods and the major part of it is eliminated in the DPP; therefore, the DPP is also exploited as additional navigation measurement to weaken the impact of systematic biases on navigation accuracy. Results of photon-level simulations show that the navigation accuracy of the proposed method is remarkably better than that of the method only using PP, the method using both PP and DF and the method using both PP and DPP for Earth orbit.
This paper considers the problem of robust bearing-only source localization in impulsive noise with symmetric -stable distribution based on the Lp-norm minimization criterion. The existing Iteratively Reweighted Pseudolinear Least-Squares (IRPLS) method can be used to solve the least LP-norm optimization problem. However, the IRPLS algorithm cannot reduce the bias attributed to the correlation between system matrices and noise vectors. To reduce this kind of bias, a Total Lp-norm Optimization (TLPO) method is proposed by minimizing the errors in all elements of system matrix and data vector based on the minimum dispersion criterion. Subsequently, an equivalent form of TLPO is obtained, and two algorithms are developed to solve the TLPO problem by using Iterative Generalized Eigenvalue Decomposition (IGED) and Generalized Lagrange Multiplier (GLM), respectively. Numerical examples demonstrate the performance advantage of the IGED and GLM algorithms over the IRPLS algorithm.
In this paper, we study the multi-sensor multi-target tracking problem in the formulation of random finite sets. The Gaussian Mixture probability hypothesis density (GM-PHD) method is employed to formulate the sequential fusing multi-sensor GM-PHD (SFMGM-PHD) algorithm. First, the GM-PHD is applied to multiple sensors to get the posterior GM estimations in a parallel way. Second, we propose the SFMGM-PHD algorithm to fuse the multi-sensor GM estimations in a sequential way. Third, the unbalanced weighted fusing and adaptive sequence ordering methods are further proposed for two improved SFMGM-PHD algorithms. At last, we analyze the proposed algorithms in four different multi-sensor multi-target tracking scenes, and the results demonstrate the efficiency.
Compressive sensing is a very attractive technique to detect weak signals in a noisy background, and to overcome limitations from traditional Nyquist sampling. A very important part of this approach is the measurement matrix and how it relates to hardware implementation. However, reconstruction accuracy, resistance to noise and construction time are still open challenges. To address these problems, we propose a measurement matrix based on a cyclic direct product and QR decomposition (the product of an orthogonal matrix Q and an upper triangular matrix R). Using the definition and properties of a direct product, a set of high-dimensional orthogonal column vectors is first established by a finite number of cyclic direct product operations on low-dimension orthogonal “seed” vectors, followed by QR decomposition to yield the orthogonal matrix, whose corresponding rows are selected to form the measurement matrix. We demonstrate this approach with simulations and field measurements of a scaled submarine in a freshwater lake, at frequencies of 40 kHz–80 kHz. The results clearly show the advantage of this method in terms of reconstruction accuracy, signal-to-noise ratio (SNR) enhancement, and construction time, by comparison with Gaussian matrix, Bernoulli matrix, partial Hadamard matrix and Toeplitz matrix. In particular, for weak signals with an SNR less than 0 dB, this method still achieves an SNR increase using less data.
14 September 2023 in IET Radar, Sonar & Navigation
A well‐liked maneuvering target tracking algorithm is a variable structure multi‐model (VSMM). One of the crucial elements determining the tracking effect is the successful model set adaptation (MSA). The ability to further enhance tracking accuracy for the conventional VSMM method is constrained by the absence of a mechanism to thoroughly utilise observation and tracking data to optimise MSA. We incorporate the Reinforcement learning (RL) approach into the MSA procedure to address this issue and provide a VSMM algorithm based on Monte Carlo (MC) learning. To formulate the challenge of optimising the number of effective models as a RL problem, we first used the prediction error, the number of effective model sets, and tracking accuracy to build the models of the appropriate state space, decision space, and reward. The number of efficient models was optimised using MC learning, and the entire VSMM algorithm was then created. The proposed approach was compared to the simulated experiment's five maneuvering target tracking algorithms. The outcomes demonstrate that the suggested algorithm has a lower computation scale and accurate tracking accuracy.
A labeled multi‐Bernoulli filter is used to obtain estimates of the identities and states of targets in complex environments. However, when tracking multiple targets in dense clutters, the computational complexity of the traditional labeled multi‐Bernoulli filter will increase exponentially. A labeled multi‐Bernoulli tracking algorithm based on maximum likelihood recursive update is proposed, which can reduce the computational scale while maintaining tracking accuracy. Specifically, when performing posterior estimation, a maximum likelihood recursive update method is proposed to replace the complete enumeration, truncated enumeration, or sampling enumeration methods used in many traditional methods. Furthermore, combined with the Gaussian mixture technique, a maximum likelihood recursive updating labeled multi‐Bernoulli tracking algorithm is constructed. Simulation results demonstrated that the proposed filter obtained a good balance between the tracking accuracy and computational efficiency.