In this paper we introduce the idea of two-stage learning for multiple kernel SVM (MKSVM) and present a new MKSVM algorithm based on two-stage learning (MKSVM-TSL). The first stage is the pre-learning and its aim is to obtain the information of data such that the “important” samples for classification can be generated in the formal learning stage and these samples are uniformly ergodic Markov chain (u.e.M.c.). To study comprehensively the proposed MKSVM-TSL algorithm, we estimate the generalization bound of MKSVM based on u.e.M.c. samples and obtain its fast learning rate. And in order to show the performance of the proposed MKSVM-TSL algorithm for better, we also perform the numerical experiments on various publicly available datasets. From the experimental results, we can find that compared to three classical multiple kernel learning (MKL) algorithms, the proposed MKSVM-TSL algorithm has better performance in three aspects of the total time of sampling and training, the accuracy and the sparsity of classifiers, respectively.
Conventional global navigation satellite system receivers typically employ a two-step positioning procedure (2SP) by first independently estimating the synchronization parameters and then using these parameters to solve a system of superdeterministic equations derived from multilateration to accomplish positioning. Direct position estimation (DPE) has emerged as a promising alternative that utilizes a single-step procedure to obtain the maximum likelihood estimate of a position. This approach has been shown to effectively mitigate biases incurred by the second estimation step in 2SP. However, for code-division multiple-access systems, the pseudo-orthogonality of the spreading codes causes the estimation problem not to be mapped to a perfectly orthogonal space. Additionally, the cross-correlation interference between satellites renders the maximum likelihood invariant theory untenable in the first estimation step of the 2SP. This study presents the derivation of the Cramér–Rao bound constraint for both the 2SP and DPE, evaluating the performance degradation of the 2SP compared to that of the DPE with the consideration of cross-correlation. Furthermore, a more stringent result is proven, indicating that the 2SP is not as asymptotically efficient as the DPE in all scenarios. The derived bounds are validated using realistic scenarios, and the root-mean-square error performance of the respective maximum likelihood estimators is compared.
Direct Position Estimation (DPE) is an alternative GNSS positioning method that models received satellite signals as a function of the receiver’s navigation state, allowing for the direct estimation of position, velocity, and time within the navigation domain. However, existing DPE algorithms face significant challenges due to the non-convex nature of the optimization problem and the large solution space, resulting in high computational complexity. To address these challenges, this paper introduces a framework for searching for navigation solutions in DPE through swarm intelligence algorithms, combined with a low-complexity correlation approach. Furthermore, an adaptive Dung Beetle Optimization (ADBO) algorithm is developed. By leveraging insights from fitness landscape analysis, the ADBO algorithm dynamically adjusts subpopulation proportions and the convergence factor while incorporating hybrid mutation strategies for effective adaptation to various types of optimization problems. Benchmark function tests demonstrate that the ADBO algorithm achieves superior convergence performance compared with other popular swarm intelligence algorithms. Both extensive simulations and real GNSS data experiments further validate that the proposed framework, incorporating the ADBO algorithm, achieves improved positioning accuracy compared to traditional positioning methods while outperforming traditional search algorithms and other swarm intelligence algorithms in both accuracy and computational efficiency.
The rapid expansion of BeiDou satellite navigation applications has led to a growing demand for real-time high-precision positioning services. Currently, high-precision positioning services face challenges such as a long initialization time and heavy reliance on reference station networks, thereby failing to fulfill the requirements for real-time, wide-area, and centimeter-level positioning. In this study, we consider the multi-frequency signals that are broadcast by a satellite to share a common reference clock and possess identical RF channels and propagation paths with strict temporal, spectral, and spatial coupling between signal components, resulting in strongly coherent propagation delays. Firstly, we accurately establish a multi-frequency signal model that fully exploits those coherent characteristics among the multi-frequency BDS signals. Subsequently, we propose a rapid high-precision ranging technique using the code and carrier phases of multi-frequency signals. The proposed method unitizes multi-frequency signals via a coherent joint processing unit consisting of a joint tracking state estimator and a coherent signal generator. The joint tracking state estimator simultaneously estimates the biased pseudorange and its change rate, ionospheric delay and its change rate, and ambiguities. The coherent signal generator updates the numerically controlled oscillator (NCO) to adjust the local reference signal’s code and carrier replicas of different frequencies, changing them according to the state estimated by the joint tracking state estimator. Finally, the simulation results indicate that the proposed method efficiently diminishes the estimated biased pseudorange and ionospheric delay errors to below 0.1 m. Furthermore, this method reduces the carrier phase errors by more than 60% compared with conventional single-frequency-independent tracking methods. Consequently, the proposed method can achieve rapid centimeter-level results ranging for up to 1 min without using precise atmosphere corrections and provide enhanced tracking sensitivity and robustness.