1. INTRODUCTION
As an interdisciplinary research area, Autonomous Underwater Vehicles (AUVs) have received extensive attention worldwide, and significant progress has already been made. As the endurance of AUVs continues to increase, their underwater navigation and positioning technology is becoming increasingly critical (Paull et al., Reference Paull, Saeedi and Seto2014; Xu et al., Reference Xu, Pang, Gan and Sun2006).
Traditional underwater navigation and positioning methods include underwater acoustic navigation (Ji and Liu, Reference Ji and Liu2010; Lee, Reference Lee2016), inertial navigation (Morgado et al., Reference Morgado, Oliveira and Silvestre2013) and deadreckoning navigation (Yan et al., Reference Yan, Peng, Zhou, Xu and Jia2010), which are widely used for AUV underwater operations. However, underwater acoustic navigation requires the installation of an acoustic array, which means that the AUV cannot operate independently. Further, dead-reckoning navigation and Inertial Navigation Systems (INS) have cumulative errors which necessitate the AUV coming to the surface periodically to receive Global Navigation Satellite System (GNSS) signals to correct them. In recent years, underwater terrain matching navigation (Nygren, Reference Nygren2008; Hagen et al., Reference Hagen, Anonsen and Saebo2012; Claus and Bachmayer, Reference Claus and Bachmayer2015), which can effectively correct the cumulative errors of INS, has become the focus of active underwater navigation and positioning research. As underwater terrain matching navigation does not need the support of external sensors, extended, hidden, all-weather, highly accurate navigation can be achieved.
Among the many terrain matching methods, the terrain contour matching and Sandia terrain matching navigation methods have been applied successfully to aircraft navigation (Xing, Reference Xing2004). Compared with the terrain-positioning methods successfully applied to aircraft, the development of underwater terrain-positioning technology has long been impeded by difficulty in obtaining accurate underwater terrain data, owing to the complexity of the ocean environment and restrictions on underwater terrain measurement techniques. However, in recent years, with the development of multi-beam sounding techniques, it has become possible to obtain highly accurate Digital Terrain Maps (DTMs). This has led to intensive study of underwater terrain matching navigation being conducted (Chen et al., Reference Chen, Li, Su, Chen and Jiang2015).
Continuous filtering methods are an active underwater terrain matching research area. These methods include the Extended Kalman Filter (EKF) (Hagen and Anonsen, Reference Hagen and Anonsen2014; Li et al., Reference Li, Ma, Chen, Jiang, Wang and Zhang2017), Unscented Kalman Filter (UKF) (Pan and Zhao, Reference Pan and Zhao2015), Particle Filter (Nordlund and Gustafsson, Reference Nordlund and Gustafsson2010; Teixeira et al., Reference Teixeira, Quintas, Maurya and Pascoal2017) and Point Mass Filter (Bergman and Ljung, Reference Bergman and Ljung2009). They have been studied in depth and exhibit good performance. However, they are overly dependent on continuous real-time multi-beam data. Due to AUVs having only a limited power source, continuous filtering methods are not applicable for practical application without a major breakthrough in power techniques. In contrast to continuous filtering methods, Underwater Terrain Positioning Methods (UTPMs) only need acoustic impulse (ping) data, which is a significant advantage (Chen, Reference Chen2013) In this paper, a UTPM that uses Maximum a Posteriori (MAP) estimation and a Pulse Coupled Neural Network (PCNN) model is proposed for AUV underwater navigation.
2. MAP-BASED MATCHING
2.1. Underlying principle of MAP
The basic idea underlying MAP is use of measurement data to estimate the system status. It is similar to Maximum Likelihood Estimation (MLE) as proposed by Fisher (Geisser, Reference Geisser, Kotz and Johnson1992), and can be seen as regularised MLE (Ding and Xiao, Reference Ding and Xiao2014).
If the posterior Probability Density Function (PDF) p(x|Z) of the estimated amount x is given, the estimated value ${\bi{\hat x}}$ of MAP is the value of x which maximises the posterior PDF. From the Bayesian formula, if p(Z|x) is known, the posterior PDF of the system status can be calculated using Equation (1):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn1.gif?pub-status=live)
where p(x) is the prior PDF of x, p(Z) is the PDF of measurement data Z and p(Z|x) can be obtained via calculation or experience. Let ${\bi{\hat x}}_{MAP}$ be the estimated value of MAP, taking the natural logarithms of both sides of Equation (1) results in Equation (2):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn2.gif?pub-status=live)
The physical significance of MAP is as follows: if measurement data Z are determinate, the probability that x is in the neighbourhood of ${\bi{\hat x}}_{MAP}$ is higher than that of other areas. Obviously, MAP should satisfy the following equation:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn3.gif?pub-status=live)
Equation (3) is called the posterior equation, which we can solve to obtain ${\bi{\hat x}}_{MAP}$. As p(Z|x) and x are independent, combining Equations (2) and (3), the posterior equation can be rewritten as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn4.gif?pub-status=live)
If there is no prior information of x – that is, the probability value of x is equivalent – the prior PDF p(x) can be considered as a normal distribution with variance tending to infinity, and p(x) is as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn5.gif?pub-status=live)
where n is the number of measured data, Px is the covariance matrix of the measured error and μ is the expected value. As the variance tends to infinity Px → ∞, ${\bi P}_{{\bi x}}^{-1} \to 0$. Taking the natural logarithms of both sides of Equation (5):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn6.gif?pub-status=live)
At this point, ${\bi{\hat x}}_{MAP}$ satisfies the following condition:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn7.gif?pub-status=live)
According to the basics of MLE, Equation (7) is the judging condition of MLE. Therefore, if there is no prior information of x, MAP will degenerate into MLE. In other words, MLE is a special MAP. However, as MAP considers the a priori statistical information of the estimated amount, MAP is better than MLE.
2.2. UTPM model
The vertical coordinates of an AUV can be measured using an acoustic altimeter and a water pressure sensor in real time, resulting in no cumulative error. Thus, the vertical position need not be considered in terrain matching. Based on the above analysis, in this paper, the positioning accuracy considered is horizontal accuracy.
Without considering the coordinate changes of the AUV in the vertical plane, and assuming the navigation system performs a data update at each sampling time, the UTPM model is stated as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn8.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn9.gif?pub-status=live)
where Xt is the INS position at time t, Ut is the position change between adjacent positioning times, νt is the error of INS, Yt is the real-time sounding data at time t, Ht is the local DTM data at xt and Et is the sounding error, which is defined as Gaussian white noise. To simplify the analysis, Equation (9) can be rewritten as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn10.gif?pub-status=live)
Assuming that the measurement errors are independent of the water depth, and the errors are independent and identically distributed, the possibility of measuring sequence yt at xt is p(yt|xt) = p(et), and the prior PDF can be expressed as Equation (11):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn11.gif?pub-status=live)
Assuming the positioning error of INS obeys vt ~ N(0, Σ), p(xt) can be expressed as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn12.gif?pub-status=live)
In Equation (12), X = (X, Y) is the indicating position of INS. Substituting Equations (11) and (12) into Equation (4), we obtain the posterior equation used for terrain matching positioning. The positioning point which satisfies the a posteriori equation is the MAP estimated position of terrain matching.
2.3. Pseudo-anchor points phenomenon
In principle, the positioning point which satisfies the a posteriori equation can always be calculated, and the true position can be fixed. Due to the complex underwater environment and the interference of measurement errors, the position is not always unique and the posterior PDF p(xt|yt) has multiple peaks. The peak which represents the actual position of the AUV is called the true positioning. The peaks outside the true positioning are called pseudo-peaks, and the corresponding anchor points are pseudo-anchor points. Pseudo-anchor points are a common phenomenon in underwater terrain matching positioning and negatively influence the matching result. This influence is particularly evident in flat areas and causes matching accuracy to decrease or even fail.
Let us analyse the existence characteristics of a pseudo-peak. According to Equation (9), we obtain the following:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn13.gif?pub-status=live)
where e k is the measurement error of the k-th real-time sounding data and h(x k) is the extracted depth data from DTM at x k. Suppose that x 0 is the real matching position, x 1 is the pseudo-anchor point, and y0 and y1 are the sounding sequence at x 0 and x 1, respectively. Let Δ y = [Δ y 1, Δ y 2, …, Δ y n] T be the difference sequence between y0 and y1; thus, y1 = y0 − Δ y. Further, assuming that the measurement errors are independent and identically distributed, we obtain Equation (14):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn14.gif?pub-status=live)
$p\lpar {\bi x}\vert {\bi y}\rpar =\displaystyle{{p\lpar {\bi x}\vert {\bi y}\rpar p\lpar {\bi x}\rpar }\over{p\lpar {\bi y}\rpar }}\propto p\lpar {\bi y}\vert {\bi x}\rpar $. Let J(xt) represent the power term of the exponential term part in Equation (11), then:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn15.gif?pub-status=live)
Thus:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn16.gif?pub-status=live)
As can be seen from Equation (16), when $\sum_{k=1}^{1}\lpar \Delta h_{k}^{2}-2e_{k}\Delta h_{k}\rpar \gg 0$, there is no pseudo-peak on the posterior PDF and x 0 is the best matching position. In the presence of pseudo-peaks, with the real-time sounding data increasing, the value of
$\sum_{k=1}^{n} \lpar \Delta h_{k}^{2}-2 e_{k} \Delta h_{k}\rpar $ will gradually increase. Thus, theoretically, when the sounding data are sufficient, there will be no pseudo-positioning. However, owing to the error of the measurement terrain and terrain similarity, the pseudo-anchor points will not be adequately removed by increasing the amount of sounding data. Further, too much sounding data results in heavy calculation, which affects the real-time performance of the terrain matching algorithm.
The pseudo-anchor points are derived from terrain similarity and measurement error. If the errors are independent and identically distributed, the pseudo-anchor points are decided by the sum of all measurement data errors. The terrain matching algorithm is based on the hypothesis that the effect of each set of measurement data for terrain matching is the same. In this hypothesis, the overall error is the average of individual errors, and differences in individual errors are not considered. When terrain features are flat, the differences in the overall errors are not obvious. However, with increasing measurement data, the effect of ‘error averaging’ also increases, which means that the result of terrain matching positioning cannot necessarily improve with increasing quantity of measurement data. Thus, if data with large error can be removed effectively, the effect of ‘error averaging’ can be effectively suppressed, and the terrain matching performance can be improved. To achieve this, a pseudo-anchor points discriminant method is proposed in this paper. In the proposed method, pseudo-anchor points are effectively removed by screening the data that have smaller errors in the measurement data, then discriminating all matching points.
3. PSEUDO-ANCHOR POINTS DISCRIMINANT METHOD BASED ON PCNN
3.1. PCNN model
By studying the cerebral cortex of mammals, Eckhorn et al. (Reference Eckhorn, Reitboeck, Arndt and Dicke1990) established a neuronal conduction characteristics model for the visual area, which eventually developed into PCNN (Lindblad and Kinser, Reference Lindblad and Kinser2013; Mohammed et al., Reference Mohammed, Badr and Abdelhalim2015). PCNN is a single-layer artificial neural network model that does not need training on sample data as the network implementation is dominated by an iterative algorithm. In contrast to traditional multi-layer artificial neural networks, PCNN can conduct self-learning and self-supervision.
As shown in Figure 1, the PCNN model includes three mutually coupled functional units: linking component, feeding component and step function. As shown in Equation (17), the input to the linking component is determined by the output from the previous iteration:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn17.gif?pub-status=live)
where, Lij is the link status related to neuron (i, j), V L and α L are an amplification factor and a decay time constant, Yij is the output of neuron (i, j) and n is the number of iterations.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig1g.jpeg?pub-status=live)
Figure 1. The PCNN model.
The input to the feeding component is determined by the output from the previous iteration, which is shown as Equation (18):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn18.gif?pub-status=live)
where Fij(n) is the feed status related to neuron (i, j), V F and α F are the amplification factor and decay time constant and A ij is the normalised value of sounding data (i, j). In contrast to the original PCNN model, it considers a single weight value β, which is a constant value. The combined output is shown as Equation (19):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn19.gif?pub-status=live)
where Uij is the status of neuron (i, j). As shown in Figure 1, the neuron output is defined by the step function shown in Equation (20):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn20.gif?pub-status=live)
where Tij(n) is the threshold value, which can be dynamically calculated and updated through Equation (21):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn21.gif?pub-status=live)
where V T and α T are an amplification factor and a decay time constant, respectively. As noted from Equations (17)–(21), the output of the PCNN is affected by its parameters: V L, α L, V F, α F, β, V T and α T. Therefore, to improve the performance of PCNN, the above parameters must be adjusted to the optimum.
The key features of PCNN are a nonlinear modulation coupling mechanism, the core of the PCNN model and threshold exponential decay mechanism. In the traditional PCNN model, the threshold changes repeatedly. Specifically, after a period of decline, owing to the activation of neurons, the threshold rises sharply, falls sharply and then rises sharply again. Thus, in PCNN, a significant amount of feature information is stored after processing in the activation cycle and activation phase, and the information in the direct output is poor. In order to overcome the above defect and reduce the amount of calculation, we improve the threshold function as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn22.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn23.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn24.gif?pub-status=live)
The improved model reduces the operating parameters of PCNN, with the meaning of the parameters remaining the same as in the standard PCNN model. The number of parameters is reduced from nine to five, and the complexity of their setting is also reduced. The input Fij is the value of the sounding data.
When the PCNN model is used to distinguish pseudo-anchor points, let the expressions for Uij(n) and Yij(n) remain unchanged and Equations (22), (23) and (24) respectively replace Equtions (18), (17) and (21). Further, we define the following three concepts:
(1) The external input of the PCNN neurons is the water depth value associated with the coordinates, which is Fij(n) = Aij;
(2) All PCNN neurons have the same structure and parameter;
(3) Each PCNN neuron can only be activated once.
3.2. Discriminant method of the pseudo-anchor points
The discriminant process is divided into two steps: (1) matching unit data selection using the PCNN model and (2) matching judgement by the selected data - the position which has the highest probability is the real matching position.
3.2.1. Data selection method based on PCNN
The input to the traditional PCNN is a two-dimensional matrix, whereas the input parameters of terrain matching are at least three two-dimensional matrices. To simplify the description process, suppose that the real-time sounding terrain is also a regular grid terrain. Then, the terrain matching process can be as shown in Figure 2. If the number of matching position and pseudo-anchor points is m, the number of terrain matrices processed by PCNN will be m + 1. The PCNN model can only process one data matrix and the output is Boolean data. Thus, when designing the PCNN structure, the output of the PCNN can be used to determine the similarity of the real-time sounding terrain and the DTM extracted data: ‘0’ means ‘not similar’, ‘1’ means ‘similar’. The inputs to the PCNN are the similarity measure of real-time sounding terrain and the DTM extracted data. Normalising the data to [0, 1], we obtain the similarity measure sequence $\lcub {\lambda_{i} } \rcub _{j=1}^{n} $, where λ i is defined as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn25.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig2g.jpeg?pub-status=live)
Figure 2. Sketch of the terrain searching and matching process.
In the output matrix of PCNN, a ‘1’ indicates that the sounding error of the corresponding data is small, the data should be retained in the second discrimination. Otherwise, if the data has output ‘0’, the data should be removed in the second discrimination. In other words, the ignition process is the similar terrain selection process. Figure 3 is a schematic diagram of the data selection process.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig3g.jpeg?pub-status=live)
Figure 3. The data selection process based on PCNN.
The PCNN ignition calculation is performed for each node in the matching area, and the number of ignitions is counted. We assume that there are N sounding data points in real-time terrain, and there are m positioning points satisfying the MAP condition. The flowchart of the data selection process is presented in Figure 4.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig4g.gif?pub-status=live)
Figure 4. Flowchart of the data selection process based on PCNN.
3.2.2. The matching judgement method
After the PCNN ignition calculation, the data with the smaller differences are extracted, then further judgement calculations are performed. Before judgement calculations, the data in (yt − ht(xt)) 2 have to undergo weight processing using the ignition matrix $\lcub {\mathop{\lambda}\limits^{\frown}}_j\rcub _{j=1}^{N}$, which is defined as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn26.gif?pub-status=live)
Let W replace (yt − ht(xt)) 2 in Equation (11), the weighted PDF can be defined as Equation (27):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn27.gif?pub-status=live)
where K is the number of nodes with value ‘1’ after PCNN ignition calculation. Calculate the prior PDF of m positioning points and the positioning point which has the maximum value is the best position estimate.
4. IMPLEMENTATION OF THE TERRAIN MATCHING ALGORITHM
4.1 Search area
For a terrain matching navigation system, the larger the search area, the higher the terrain matching reliability, and the greater the matching time. Therefore, a reasonable search area is necessary.
The search area is related to the performance of the INS. Considering the terrain resolution of DTM, the search area can be defined as a rectangular area determined by a confidence ellipse (Nygren, Reference Nygren2005), with the centre of the rectangular area (p c,x, p c,y) indicating the position from the INS. The index numbers of the local terrain can be calculated using Equation (28):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_eqn28.gif?pub-status=live)
where R x is the grid resolution along the x direction, R y is the grid resolution along the y direction, and, usually, R x = R y. U and V are the coefficients associated with l x and l y, which depend on the error accumulation characteristics of INS; usually, l x = 2UR x, l y = 2VR y. The search area is shown in Figure 5, where the w 1 − −w 2 coordinate system is the confidence ellipse coordinate system defined by Nygren (Reference Nygren2005).
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig5g.gif?pub-status=live)
Figure 5. Confidence ellipsoid and rectangular search area.
4.2. The UTPM process
The flowchart of the UTPM algorithm is shown in Figure 6.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig6g.gif?pub-status=live)
Figure 6. UTPM algorithm flowchart.
The instructions for the calculation process are as follows:
(1) Multi-beam data must be processed in real time, which includes removing outlier data and extracting terrain profile information.
(2) Multi-beam data include multiple pings. Considering the influence of the amount of computation and the cumulative errors of INS, two to ten pings are usually used.
(3) According to the requirements of underwater terrain matching navigation and basic knowledge of probability theory (Xie, Reference Xie2005; Chang et al., Reference Chang, Yang, Kou and Zhang2005), the confidence of the confidence ellipse must not be less than 0·95.
(4) The UTPM result can be used to correct the cumulative errors of INS diametrically or fused with other navigational data.
5. SIMULATION AND RESULT ANALYSIS
5.1. Underwater semi-physical simulation system
The simulation tests were executed in an underwater semi-physical simulation system. The system centre was a PC104 embedded computer. The structure of the simulation system is shown in Figure 7.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig7g.jpeg?pub-status=live)
Figure 7. Structure of the underwater semi-physical simulation system.
As shown in Figure 7, the simulation system comprised three components: monitoring computer, environment simulation computer and PC104 embedded computer. The monitoring computer was the actual AUV monitoring computer, which is responsible for issuing task-level parameters and startup instructions. At the same time, the ‘AUV’ status information was displayed. The environment simulation computer simulated the AUV movement in the marine environment and the sensors carried by the AUV. A PC104 embedded computer ran the AUV control system, and it had the same parameters as the master AUV computer, with the only difference being that the sensor information and the data packet were sent by the environment simulation computer, and the actuator information was also sent to the environment simulation computer through the Ethernet. The specifications of the PC104 computer are listed in Table 1.
Table 1. Specifications of the PC104 computer
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_tab1.gif?pub-status=live)
Based on the simulation system, the simulation test was divided into two parts: Test 1, algorithm validation based on an electronic chart, which verified the feasibility of the proposed algorithm; Test 2, playback simulation test using real multi-beam sounding data, which verified the applicability of the proposed algorithm in a real marine environment.
5.2. Algorithm validation
In Test 1, a visual simulation toolkit issued by MultiGen-Paradigm Inc., Vega software, was used for used to simulate the motion of AUV, Figure 8 shows the initial interface of the Vega-based simulation module. The intersecting rays (The green line in Figure 8) of Vega (were used to simulate a multi-beam sounding system (Li et al., Reference Li, Chen and Dong2011). Adding a Vega-based simulation module to the environment simulation computer, ‘AUV’ motion and data acquisition were conducted in this module.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig8g.jpeg?pub-status=live)
Figure 8. Initial interface of the Vega-based simulation module.
The DTM for the simulation test was obtained by interpolating the electronic chart. The size of the DTM was 5 km × 5 km, and the grid spacing was 10 m. The DTM is shown in Figure 9(a). A simulation model of DTM was then built and input to the Vega-based simulation module.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig9g.jpeg?pub-status=live)
Figure 9. DTM and matching area selection (a) DTM; (b) matching area selection.
As shown in Figure 9(b), five different terrain feature areas in DTM were selected. During Test 1, the selected local underwater map was interpolated with 2 m grid spacing. The systematic errors of attitude and heading would influence measurement data. However, these impacts are always negligible in terrain matching navigation because a Fibre Optic Gyrocompass (FOG) is very accurate (Hagen and Ånonsen, 2014; Zhao et al., Reference Zhao, Gao, Huang, Wang and Zhou2015). Therefore, the measurement error of the attitude sensor can be ignored in the simulation test. In order to quantify the terrain feature richness, the terrain entropy of the selected local underwater map was calculated (Wang et al., Reference Wang, Yan, Qian and Zhu2007). The interval distance between two adjacent ping samplings was 10 m. Table 2 shows the simulation parameters.
Table 2. Simulation parameters
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_tab2.gif?pub-status=live)
After setting the simulation parameters, the simulation tests were conducted based on different terrain profile combinations. For comparison, simulation tests using the MLE method (Peng et al., Reference Peng, Zhou, Li and Zhang2016) were conducted with the same simulation conditions. The simulation results obtained after 500 simulation tests are shown in Table 3.
Table 3. Algorithm simulation results based on electronic chart data
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_tab3.gif?pub-status=live)
In Table 3, the average positioning error is the average error in each matching area, the number of pseudo-anchor points is the maximum value in the simulation, 60 × 2 and 60 × 5 are terrain combined modes. For example, 60 × 2 is a terrain with two terrain profiles comprising 60 units of depth data in each profile.
In the simulation tests, the terrain tended to be gentle from Area 1 to Area 5. According to the definition of terrain entropy, the smaller the terrain entropy value, the richer are the terrain features and the higher the terrain adaptability. Comparing the MAP and MLE positioning results, in the area with smaller terrain entropy, the performance of the two algorithms is similar. As the terrain entropy increased, the matching positioning accuracy decreased and the pseudo-anchor points appeared. As can be seen in Table 3, under the same test conditions, the number of pseudo-anchor points of MAP is less than that of MLE. Without removal of the pseudo-anchor points, the matching accuracy of MAP is higher than that of MLE. Figure 10 shows the terrain matching results of MAP and MLE in Area 3. As can be seen, under the same simulation conditions, the pseudo-anchor points of MAP are less than those of MLE, and the probability distribution is more reasonable; hence, MAP is superior to MLE.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig10g.jpeg?pub-status=live)
Figure 10. Terrain matching results (a) MAP (b) MLE.
Comparison of the matching positioning results of different terrain profile combinations shows that the matching positioning accuracy of 60 × 5 is higher than that of 60 × 2. As can be seen in Table 3, in Areas 3 and 4, the number of pseudo-anchor points is significantly reduced. For example, there are five pseudo-anchor points using the MAP method in Area 4 by the 60 × 2 terrain, and only one pseudo-anchor point by the 60 × 5 terrain. However, in areas where the terrain is flatter (Area 5), the number of pseudo-anchor points is not significantly reduced (from 11 to ten using MAP and from 30 to 28 using MLE), and the calculation time is significantly increased. As can be seen, in the flat terrain area, because there are more pseudo-anchor points, the real-time performance of MLE is worse.
Figure 11 shows the posterior PDF distribution with different real-time terrain combinations in Area 5. As can be seen, in the flat terrain area, the posterior PDF distribution of 60 × 5 is not changed significantly compared with 60 × 2. In other words, the matching performance cannot be significantly improved by increasing real-time terrain data. After the discrimination of pseudo-anchor points by PCNN, the true positioning point can be found, and the positioning accuracy increases significantly. Therefore, the proposed pseudo-anchor points discriminant method is effective. However, it should also be noted that the calculation time of PCNN is proportional to the number of pseudo-anchor points and the amount of real-time terrain data. As the number of pseudo-anchor points and the amount of real-time terrain data increases, the calculation time also increases, which can affect the real-time performance of terrain matching.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig11g.jpeg?pub-status=live)
Figure 11. Probability distribution with different real-time terrains in Area 5 (a) 60 × 2 (b) 60 × 5.
In theory, by screening and determining each search point using PCNN, then calculating the PDF, the true matching position can be obtained. Figure 12 shows the probability distribution after PCNN screening with 60 × 5 real-time terrain data. After screening all search points, the probability distribution is a single peak distribution, which means that the effect of ‘error averaging’ is effectively suppressed. However, in the simulation, the calculation time is over 100 seconds, which is unacceptable for real-time performance. Therefore, combining MAP and PCNN is effective for terrain matching positioning. With advancements in computer performance, PCNN terrain matching positioning has greater advantage.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig12g.jpeg?pub-status=live)
Figure 12. Matching positioning based solely on PCNN.
5.3. Playback simulation
In Test 2, the data source of DTM was multi-beam sounding data measured in a sea trial. The multi-beam sounding data were acquired using GeoSwath Plus (GS+), a phase interferometry multi-beam sounding side scanner produced by the GeoAcoustics Company. The size of the measured area was 1,000 m × 900 m, and the depth was from 5 m to 40 m. After filtering and gridding processing, the grid spacing of DTM was 1 m × 1 m (Figure 13).
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_fig13g.jpeg?pub-status=live)
Figure 13. The DTM and independent survey line.
The navigational data in the GS+ original file were obtained using the Real-time Kinematic (RTK) technique (GeoAcoustics Limited, 2007). Thus, the navigation accuracy was up to several centimetres (Yao et al., Reference Yao, Hu and Xu2016). Therefore, RTK data can be used for the real position.
The path indicated by the arrow in Figure 13 is an independent multi-beam survey line, which is used to simulate real-time sounding data. The survey line is perpendicular to the lines marking the DTM; thus, data independence is ensured.
The playback simulation means that the data in the simulation are from sea trials and the data are read according to the state when the data were acquired in simulation tests. As the test data are from real multi-beam sounding, the playback simulation could verify the applicability of the proposed method in the real marine environment. The initial error of INS is established as σ x = σ y = 15 m, and the error characteristic satisfies σ x = σ y = N(0, (0 · 05t) 2). Calculation was completed of the terrain features of the independent line passing through the area, and five matching areas can be selected sequentially along the survey line, as shown in Figure 12. Similarly, the terrain entropy in the matching area is calculated separately and is shown in Table 4.
Table 4. Terrain entropy in the matching area.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_tab4.gif?pub-status=live)
Multiple playback simulation tests were conducted, with the results in Table 5 being obtained. Matching length is defined as the distance between the two furthest real-time terrain profiles. For example, there are five terrain profiles in the real-time terrain data, the length between adjacent terrain profiles is 10 m and the matching length is 40 m. The accuracy requirement is that positioning errors be less than 5 m.
Table 5. Playback simulation results
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20190808015617547-0291:S0373463319000067:S0373463319000067_tab5.gif?pub-status=live)
As can be seen from Table 5, in Area 1, which has the richest terrain features, the true positioning point can be found using only 80 × 2 real-time terrain data and increasing the data does not improve the positioning accuracy. In Areas 3 and 4, which have relatively rich terrain features, there are pseudo-anchor points using 80 × 2 real-time terrain data, but increasing the data to 80 × 5 causes the pseudo-anchor points to disappear; the positioning accuracy of MAP using 80 × 5 is close to the PCNN result for 80 × 2. In Areas 2 and 5, which have the poorest terrain features, the pseudo-anchor points still exist with 80 × 5 real-time terrain data; pseudo-anchor points discrimination must be conducted. In Area 5, the positioning accuracy between 80 × 5 and 80 × 2 is approximately the same, whereas in Area 2, the positioning accuracy meets the requirements only with 80 × 5 real-time terrain data. This is because the terrain is very flat in Area 2, which results in the terrain data using 80 × 2 being too small to describe the terrain features after PCNN ignition calculation. Therefore, before terrain matching positioning, the matching suitability of the local terrain must first be assessed, which is used to determine the real-time terrain combination mode in the terrain matching calculation.
As can be seen from the above analysis, the true positioning point can be found using only a small amount of real-time terrain data by the proposed terrain matching positioning method in most areas, and the pseudo-anchor points can be removed effectively. However, in excessively flat terrain areas, an overly small amount of terrain data cannot describe the terrain features, and so the amount of real-time terrain data has to be increased. In the playback simulation tests, because of the high resolution of DTM, the positioning error was less than 5 m in each matching area, and the accuracy was unrelated to the sailing distance and sailing time. Therefore, the proposed method is applicable for AUV underwater navigation.
6. CONCLUSIONS
In this paper, an Underwater Terrain Positioning Method (UTPM) using Maximum a Posteriori (MAP) was introduced and a discrimination method for pseudo-positioning points based on the Pulse Coupled Neural Network (PCNN) model for pseudo-anchor points in flat terrain areas was proposed. The following conclusions were reached:
1. The cumulative error of INS can be corrected effectively by the UTPM algorithm proposed in this paper.
2. In most areas, the true positioning point can only be found by combining several sets of terrain profile data with PCNN discrimination.
3. In flat terrain areas, the true positioning point can be found by combining more terrain profile data with PCNN discrimination.
4. The positioning performance is related to the local terrain entropy and the real-time terrain profile combination; therefore, adaptively selecting the terrain profile combination according to the local terrain entropy is efficacious.
ACKNOWLEDGMENTS
This research was supported by the National Natural Science Foundation of China (Grant No. 51775518); the Natural Science Foundation of NUC (Grant No. 2017001); and the 333 Academic Start Funding for Talents of NUC (Grant No. 13011915).