In this paper,we simulate,verify,and compare the performance of three classical geomagnetic matching aided navigation algorithms to assess their applicability to hypersonic vehicle navigation.Firstly,we introduce the ...In this paper,we simulate,verify,and compare the performance of three classical geomagnetic matching aided navigation algorithms to assess their applicability to hypersonic vehicle navigation.Firstly,we introduce the various sources of the geomagnetic field.Secondly,we describe the principles and processes of the geomagnetic contour matching(MAGCOM)algorithm,iterative closest contour point(ICCP)algorithm,and Sandia inertial magnetic aided navigation(SIMAN)algorithm.Thirdly,we discuss the principles of inertial/geomagnetic integrated navigation,and propose the state and observation equations of integrated navigation.Finally,we perform a simulation of inertial/geomagnetic integrated navigation on the hypersonic boost-glide vehicle trajectory.The simulation results indicate that the real-time performance of the SIMAN algorithm can be optimized such that the matching accuracy is higher than that of the other two algorithms.At the same time,the SIMAN algorithm can achieve better stability,and though the amount of measurement noise can be larger,it can still achieve good positioning accuracy.展开更多
In this paper, we analyze a bulk input M^[X]/M/1 queue with multiple working vacations. A quasi upper triangle transition probability matrix of two-dimensional Markov chain in this model is obtained, and with the matr...In this paper, we analyze a bulk input M^[X]/M/1 queue with multiple working vacations. A quasi upper triangle transition probability matrix of two-dimensional Markov chain in this model is obtained, and with the matrix analysis method, highly complicated probability generating function（PGF） of the stationary queue length is firstly derived, from which we got the stochastic decomposition result for the stationary queue length which indicates the evident relationship with that of the classical M^[X]/M/1 queue without vacation. It is important that we find the upper and the lower bounds of the stationary waiting time in the Laplace transform order using the properties of the conditional Erlang distribution. Furthermore, we gain the mean queue length and the upper and the lower bounds of the mean waiting time.展开更多
基金supported by the Space Science and Technology Innovation Fund of China(No.2016KC020028)the Fund of China Space Science and Technology(No.2017-HT-XG)。
文摘In this paper,we simulate,verify,and compare the performance of three classical geomagnetic matching aided navigation algorithms to assess their applicability to hypersonic vehicle navigation.Firstly,we introduce the various sources of the geomagnetic field.Secondly,we describe the principles and processes of the geomagnetic contour matching(MAGCOM)algorithm,iterative closest contour point(ICCP)algorithm,and Sandia inertial magnetic aided navigation(SIMAN)algorithm.Thirdly,we discuss the principles of inertial/geomagnetic integrated navigation,and propose the state and observation equations of integrated navigation.Finally,we perform a simulation of inertial/geomagnetic integrated navigation on the hypersonic boost-glide vehicle trajectory.The simulation results indicate that the real-time performance of the SIMAN algorithm can be optimized such that the matching accuracy is higher than that of the other two algorithms.At the same time,the SIMAN algorithm can achieve better stability,and though the amount of measurement noise can be larger,it can still achieve good positioning accuracy.
基金supported by National Natural Science Foundation of China(No. 10671170)Natural Science Foundation of Hebei Province(No. F2008000864)
文摘In this paper, we analyze a bulk input M^[X]/M/1 queue with multiple working vacations. A quasi upper triangle transition probability matrix of two-dimensional Markov chain in this model is obtained, and with the matrix analysis method, highly complicated probability generating function（PGF） of the stationary queue length is firstly derived, from which we got the stochastic decomposition result for the stationary queue length which indicates the evident relationship with that of the classical M^[X]/M/1 queue without vacation. It is important that we find the upper and the lower bounds of the stationary waiting time in the Laplace transform order using the properties of the conditional Erlang distribution. Furthermore, we gain the mean queue length and the upper and the lower bounds of the mean waiting time.
