Figure 1 - uploaded by Hendy Suhandri
Content may be subject to copyright.
Source publication
The GNSS carrier phase observation allows for high precision positioning and attitude determination, as long as its integer ambiguity is correctly resolved. Solving integer ambiguities in attitude determination, using multiple antennae installed on the moving body, has some advantages: antennae are separated by relatively short distances, and their...
Citations
... Therefore, the iterative procedure of estimation method is developed, which sometimes outperform the conventional LS (CLS). A demonstration in [2] shown that the iterative LS (ILS) is able to yield convergent result in a more effective way than the CLS approach. The only known drawback is the iterative procedure however taking longer time to converge, which somehow burdens its computational effectivity. ...
... A tuned-derivative of squared-error system is applied through the system to improve the estimate [1]. The so-called convergent factor acts as a catalyst to shorten the number of iteration [see 2,4,5]. Furthermore, [1] described the concept of three estimation methods above in a simple illustration given in Figure 1. ...
Several Euler angles-based algorithms are proposed to solve the attitude determination problem. However, the algorithms suffer from the singularity problem and the ambiguous meaning of orientation angle determination. The quaternion is introduced due to its immunity against such problems. It efficiently reduces cost during computation compared to geometric based rotation matrix representation. Nevertheless, the quaternion constraints to N 2 (q) = ||q|| 2 = q*q = 1. Several methods are proposed to handle this situation. It however introduces another additional parameter into estimation process, which burdens the estimation process. This contribution aims to develop an extended iterative algorithm, namely gradient iterative algorithm, which is used to solve the quaternion components efficiently. Unlike the conventional least squares method, in which the estimate parameter convergence depends on a given set of initial values, the gradient iterative algorithm is able to give convergent estimate parameter in much faster computation time. The proposed method is tested against the conventional and the iterative least squares procedures using a set of fixed antenna arrays. In order to make a comparison from the tested methods, six important indicators are evaluated. Results show that the proposed method outperforms the other two methods. It is considered more effective and efficient by mean of the parameter convergence and the processing cost, which makes this method is adaptable for practical purposes.
