IntroductionThe geometric dilution of precision (GDOP) is a geometrically determined factor that describes the effect of geometry on the relationship between measurement error and position error. It is used to provide an indication of the quality of the solution. Some of the GPS receivers may not be able to process all visible satellites due to limited number of channels. Consequently, it is sometimes necessary to select the satellite subset that offers the optimal or acceptable solutions. The optimal satellite subset is sometimes obtained by minimizing the GDOP factor.The most straightforward approach for obtaining GDOP is to use matrix inversion to all combinations and select the minimum one. However, the matrix inversion by computer presents a computational burden to the navigation computer. For the case of processing four satellite signals, it has been shown that GDOP is approximately inversely proportional to the volume of the tetrahedron formed by four satellites (Kihara and Okada 1984;Stein 1985). Therefore, it is optimum to select satellite such that the volume is as large as possible, which is sometimes called the maximum volume method. However, it is not universal acceptable since it does not guarantee optimum selection of satellites.The neural network (NN) approach provides a promising and very realistic computational alternative. The application of NN approach for navigation solution processing has not been widely explored yet in the GPS community. Simon and El-Sherief (1995a) initially proposed the NN approach to approximate and classify the GDOP factors for the benefit of computational efficiency, where it could be seen that a total of 160 floating Abstract In this paper, the neural network (NN)-based navigation satellite subset selection is presented. The approach is based on approximation or classification of the satellite geometry dilution of precision (GDOP) factors utilizing the NN approach. Without matrix inversion required, the NN-based approach is capable of evaluating all subsets of satellites and hence reduces the computational burden. This would enable the use of a high-integrity navigation solution without the delay required for many matrix inversions. For overcoming the problem of slow learning in the BPNN, three other NNs that feature very fast learning speed, including the optimal interpolative (OI) Net, probabilistic neural network (PNN) and general regression neural network (GRNN), are employed. The network performance and computational expense on NN-based GDOP approximation and classification are explored. All the networks are able to provide sufficiently good accuracy, given enough time (for BPNN) or enough training data (for the other three networks).