Abstract
The deformation of the array shape during the turning process of an autonomous underwater vehicle (AUV)-towed line array sonar can significantly degrade its remote sensing performance. In this paper, a method for circular arc array modeling and dynamic deformation estimation is proposed. By treating the array shape as a hyperparameter, an adaptive central angle (shape) marginal likelihood maximization (ASMLM) algorithm is derived to jointly estimate the array shape and the directions of arrival (DOAs) of sources. The high-resolution ASMLM algorithm is used to improve the DOA estimation performance, effectively suppress left–right ambiguity and significantly reduce computational complexity, making it suitable for AUV platforms with limited computational resources. Experimental results from sea trials in the South China Sea are used to validate the superior performance of the proposed method over existing methods.
1. Introduction
Autonomous underwater vehicles (AUVs) are increasingly utilized for various underwater tasks due to their high mobility, stealth, and cost-effectiveness [1,2,3,4,5,6]. To meet the growing demands of marine exploration, remote sensing, surveillance, and anti-submarine warfare [3,7,8,9], AUVs are often equipped with sonar systems [9,10]. Early AUV sonar systems typically used conformal arrays mounted on the AUV hull, but the aperture of these systems is limited by the physical size of the AUV, restricting their ability to perform low-frequency [11], remote sensing. To address this limitation, towed arrays have been adopted for AUVs [1,11,12,13,14], providing larger apertures and thus improving detection performance [11,15].
However, several challenges are faced by the AUV-towed linear array, particularly due to the limited towing force and energy capacity of the AUV. These arrays are typically thinner and shorter than those towed by ships, making them more susceptible to shape deformations. During turns or encounters with ocean currents [16,17], significant bending of the towed linear array occurs [16,17,18,19,20,21], causing it to deviate from its expected straight-line shape. This bending introduces array shape mismatch, severely degrading the performance of the AUV’s sensing system. Additionally, the directivity of the towed linear array exhibits conical symmetry, resulting in left–right ambiguity [22] in the source DOA estimation.
The towed linear array shape estimation methods are generally divided into non-acoustic and acoustic methods. Traditionally, the shape of a towed linear array can be estimated using non-acoustic sensors [4,16,17,18,23], but this increases installation complexity and cost, making such methods unsuitable for the AUV-towed linear array. Alternatively, the array shape can be estimated based on received acoustic data [24,25]. In general, the shape of a towed linear array is modeled as either a parabola curve [18,20,21] or a circular arc [26], with the parabolic model being suitable for slow turns [18]. The schematic of the array shape variation in the AUV-towed linear array during the turning process is shown in Figure 1. The actual array shape is complex, making it challenging to accurately describe using simple mathematical models. To simplify this complexity, a circular arc model is adopted in this study to approximate the array overall shape, facilitating subsequent optimization and problem-solving. Although modeling a circular arc is simple, accurately estimating the dynamic changes in the arc shape during the turn is a challenging task.
Figure 1.
Illustration of the turning process of a towed linear array. During the turn, the towed array bends. The actual array shape is complex, making it challenging to describe using simple mathematical models. In this study, we adopt a circular arc model to simplify this complexity, facilitating optimization and problem-solving.
In addition to modeling challenges, limited computational resources are faced by AUVs, necessitating the development of low-complexity algorithms capable of achieving high-resolution sensing. Conventional beamforming (CBF) offers fast computation but low resolution [27], while algorithms such as estimation of signal parameters via rotational invariance technique (ESPRIT) and multiple signal classification (MUSIC) provide high resolution but struggle with performance in scenarios with insufficient snapshots or low signal-to-noise ratios (SNR) [28]. Sparse Bayesian Learning (SBL) [29,30,31] methods provide a solution by offering high-resolution capabilities even under challenging conditions, such as the adaptive bow SBL (ABSBL) method [18]. However, high computational complexity is typically associated with these methods [32], making them impractical for AUV platforms.
To address these challenges, a circular arc modeling approach for the AUV-towed linear array is proposed. Importantly, the model is conceptually simple, the curvature of the array overall shape is represented by a single parameter, the central angle, which avoids complex parameter coupling and reduces the computational burden. By treating the central angle as an unknown parameter to be estimated, a more precise array manifold matrix can be obtained, thereby improving the estimation performance and mitigating the effects of shape deformation.
In addition, a low-complexity sparse Bayesian learning method tailored for AUV-towed linear arrays is developed. This method addresses the computational limitations of AUV platforms while maintaining high-resolution sensing capabilities. Leveraging sparse signal reconstruction and gradient-based optimization, the proposed approach jointly estimates array shape and source directions of arrival (DOAs). Additionally, by considering array shape deformation, left–right ambiguity is resolved without the need for extra sensors or hardware.
The main contributions of this paper are as follows:
(1) Novel Array Shape Modeling and Estimation: A circular arc model for a towed linear array during turning is proposed. By introducing the central angle as a hyperparameter in the marginal likelihood function, the dynamically changing array shape is estimated, which leads to an accurate array manifold matrix, mitigating array shape mismatch and improving the DOA estimation performance.
(2) Low-Complexity Sparse Bayesian Learning: Considering the computational resource constraints of AUV platforms, a fast sparse Bayesian learning algorithm is derived. The array shape and source directions of arrival are efficiently estimated by this algorithm, enabling high-resolution remote sensing.
(3) Resolution of Left–Right Ambiguity: By incorporating the deformation of the array shape into the estimation process, the left–right ambiguity is effectively resolved when the towed linear array is bent, using only the acoustic data received by the array. The accuracy of the source DOA estimation is enhanced without the need for additional hardware or sensor support.
The remainder of the paper is organized as follows. The circular arc modeling method for the towed linear arrays and direction of arrival estimation are presented in Section 2. The proposed algorithm, termed adaptive central angle (shape) marginal likelihood maximization (ASMLM) method, which jointly addresses the direction of arrival estimation of the source and the array shape estimation, is introduced in Section 3. The computational efficiency, array shape estimation, spatial spectrum estimation performance, and left–right ambiguity suppression effects of the proposed algorithms are discussed in Section 4 through simulation analysis. The effectiveness of the algorithms is validated using experimental data from the South China Sea in Section 5. The conclusions are provided in Section 6.
2. Array Shape Modeling and Direction of Arrival Estimation Problem
Consider a towed linear array with M elements, as shown in Figure 2. In the established coordinate system, the position of the array head (element 1) is at the origin O, with coordinates . The x-axis is defined as the direction from the array head to the tail. The array shape is modeled as a circular arc, with the central angle in radians given by
where D is the arc length, which also serves as the aperture of a straight array, and R is the radius of the arc. The height of the arc chord is
Assuming the shape of the towed linear array is a minor arc, i.e., , the coordinates of its arc center are , given by
The coordinates of element m, denoted as , where , are expressed as
where
Substituting and into gives
Substituting Equations (3) and (6) into Equation (4), and simplifying, the coordinates of element m are derived as
Figure 2.
The shape of the towed linear array.
The source’s DOA is defined as the grazing angle relative to the x-axis. The measurement equation for the DOA estimation problem is given by
where , with L denoting the number of snapshots. The column vector , for . The array manifold matrix is , where N is the number of grid points, and the column vector . The m-th element of is , where , , and f is the frequency. The time delay for element m relative to the reference element (element 1) is given by , where c is the speed of sound. The sound path difference between element m and element 1 is shown in Figure 2, where , with and . Thus, we have
The m-th element of can be expressed as
Substituting Equations (1) and (7) into Equation (10), the m-th element of can be expressed as
In Equation (8), the source matrix , where . The noise matrix contains the noise vectors, with each column vector representing white Gaussian noise for the l-th snapshot.
Assume that sources impinge on the M-element towed linear array. The received array data is known, and is a row-sparse matrix, where only the rows corresponding to the K source directions are non-zero, while all other rows contain zero elements. Consequently, by identifying the non-zero rows , the DOAs of the sources can be estimated. This transforms the DOA estimation problem into a sparse reconstruction problem for based on Equation (8).
3. The Proposed Method
Since the arc length D of the towed linear array is fixed, the array shape can be uniquely determined by the central angle . Therefore, estimating from the received data directly yields the array shape. As both the sources and the array shape are unknown, this constitutes a joint estimation problem.
In Equation (8), assuming the noise follows an independent zero-mean Gaussian distribution, the noise variance for the l-th snapshot is , such that . The likelihood function can then be expressed as [29,30,33]
where denotes the complex Gaussian distribution. Assuming follows a Gaussian distribution with variance , the prior of the source signals is given by
where , each snapshot is a multivariate Gaussian with covariance matrix . Within the Bayesian estimation framework, the posterior of the source signals can be derived by combining the likelihood of the array observations with the prior of the source signals:
where is the evidence. The posterior follows a complex Gaussian distribution with mean and covariance [29,33,34]:
where
The evidence is given by
Taking the logarithm of Equation (17) yields [29,33]
where . The hyperparameters , , and are estimated by maximizing the log marginal likelihood function:
Simultaneous updates of the three hyperparameters , , and do not always lead to an optimal solution and can significantly increase computational complexity. This is because updating the central angle is to estimate the array shape, that is, to modify the array manifold matrix , while updating and aims to obtain the optimal DOA estimation result under the current array manifold matrix .
Therefore, our update strategy begins with initializing . Once and are updated to a suboptimal DOA estimate under the current array shape, is updated based on the current estimates of and . These steps are repeated until the convergence condition is met or the maximum number of iterations is reached.
3.1. Direction of Arrival Estimation
The sparse reconstruction of the source signal is achieved by solving the closed-form solution of the signal variance in spatial domain , which enables the fast estimation of the angle of arrival. By fixing the array shape hyperparameter and maximizing the log marginal likelihood function, the partial derivative of with respect to is
Setting Equation (20) equal to zero yields . By multiplying both sides by , we obtain , which does not have a closed-form solution [30]. To improve computational efficiency, we rewrite the logarithmic marginal likelihood. The covariance matrix in Equation (18) can be decomposed as [33,34]
Defining , where represents the component of after removing the contribution from . Thus, Equation (21) can be expressed as . Substituting this into Equation (18), the marginal likelihood can be rewritten as
where
with
The hyperparameter is obtained by taking the partial derivative of Equation (18) as follows:
Setting Equation (25) equal to zero yields the closed-form solution for :
For computational convenience, and are expressed as:
where
Using the Woodbury matrix identity [33], we compute
where . The hyperparameter is coupled with . In practice, is treated as a regularizer and fixed to , reducing computational complexity [35], with adjusted based on different signal-to-noise ratios.
To improve computational efficiency, we calculate only and , with and computed only when needed according to the formulas in Equation (27). When , we set , which leads to and . Initializing , we have , and thus . From Equation (28), we can calculate
obtain all the to be updated, namely
Substituting into Equation (23), we select the that maximizes . Then, we compute , and . The update formulas for and are as follows:
where . When , , . When , , . We update using Equation (26), calculate Equation (23), select the next that maximizes the value of Equation (23), and check if the termination condition is met. If convergence is not achieved, we continue updating and , as described in [21,33], and update and accordingly. Typically, the number of array elements M is smaller than the number of grid points N. In the SBL algorithm based on expectation maximization, the main steps involve estimating and to compute , where the computational complexities of and are and , respectively. the main steps of the proposed algorithm compute by estimating and , with a complexity of .
3.2. Array Shape Estimation
The array shape is determined by the hyperparameter , which is estimated from the received data. With fixed hyperparameters and , we maximize the expression in (18) to obtain
Take the partial derivative of in Equation (18):
Using the chain rule, we derive
In Equation (35) and Equation (36), let . The partial derivative of with respect to can then be written as
where
To compute , the partial derivative of the m-th element of in is given by:
where
The central angle is obtained by applying the gradient descent method, which allows for the estimation of the towed linear array shape.
The proposed algorithm is summarized in Algorithm 1. The main steps are as follows: (a) The central angle and noise variance are initialized. (b) The array manifold matrix is computed, followed by the calculation of , , and ; subsequently, is computed, the covariance and the mean are updated, and and are computed. (c) and are computed, is updated, the next is calculated, and , are updated, with and being computed. (d) The central angle is updated using the gradient descent method. (e) The estimated central angle and the variance are output.
| Algorithm 1 ASMLM |
|
Steps (b) and (c) are primarily aimed at obtaining the optimal estimate of under the current central angle , while step (d) optimizes the central angle under the current . The number of iterations can be set according to practical needs. For example, if the number of sources K is known, computing requires K iterations. If K is unknown, the number of updates for should satisfy the spatial sparsity assumption, i.e., . The iteration for stops when the maximum number of iterations is reached, or when the set convergence rate is reached.
The proposed method is designed to address the problem of array shape and remote source DOA estimation in AUV-based ocean remote sensing systems using towed linear array sonar. It enhances the capability of remote target localization. With array shape estimation and array signal processing as its core techniques, the method holds significant potential for applications in underwater target detection, ocean acoustic imaging, and environmental parameter estimation.
4. Simulations
A simulation analysis of the performance of the proposed ASMLM method during the steady turning process of a towed linear array is conducted in this section. The analysis focuses on the computational efficiency of the algorithm, the array shape estimation performance, the spatial spectrum estimation performance, and the effectiveness of left–right ambiguity suppression.
Consider a 48-element towed linear array with an element spacing of 0.417 , a total aperture of approximately 19.6 , and a sound speed of 1540 /. The bearing-time-records (BTRs) [22] of the two sound sources is shown in Figure 3a, where the energy of Source 1 is 0 , and its azimuth is varied from 65° to approximately 121°. The energy of Source 2 is , and its azimuth is varied from approximately 108° to 167°.
Figure 3.
Simulation data settings. (a) True BTRs of the sources; (b) Dynamic variation in the chord height.
A total of 120 Pings were sampled throughout the turning process. Between Ping 40 and Ping 80, the array shape closely resembled a circular arc. The variation in chord height during the turn, which is used to quantify the degree of bending, is illustrated in Figure 3b. For non-arc-shaped configurations, the chord height is defined as the maximum y-axis coordinate of the array elements. Based on the water-pulley model, the evolution of the array shape at different Pings is shown in Figure 4, visually demonstrating the dynamic deformation characteristics of the array during the turning maneuver.
Figure 4.
Array shapes under different Pings.
The processed frequency range is from 500 to 560 . White noise with a power of is added, and the number of frequency domain snapshots per ping is 50. The initial central angle is set to 0.2 radians and is set to 0.1. The grid interval is set to 1°. The BTRs estimation results obtained by different methods are shown in Figure 5. The CBF and MUSIC algorithms are applied based on the conventional linear array model. The ABSBL algorithm is implemented using a parabolic array model. For the linear array, the azimuth estimation range is limited to 0°–180°. However, due to the bending of the array, the azimuth estimation range can be extended to 0°–360°, allowing the left or right azimuth of the sound source to be distinguished.
Figure 5.
Estimation results of the broadband BTRs. (a) CBF; (b) MUSIC; (c) ABSBL; (d) ASMLM.
From Ping 1 to Ping 20, the array bending is slight, and the results processed based on the linear array model still allow the two source signals to be distinguished. From Ping 20 to Ping 100, significant array bending is observed, and the resulting shape mismatch severely affects the estimation performance of the CBF and MUSIC algorithms. The azimuths of the two sources are not successfully estimated by either algorithm. From Ping 100 to Ping 120, although the bending gradually decreases, the estimation of Source 2 remains ineffective for both algorithms, as it is weak and located near the endfire direction. The state-of-the-art ABSBL method performs well in estimating the two source signals from Ping 1 to Ping 30. From Ping 30 to Ping 100, a large curvature is present in the simulated array shape, while a parabolic model is adopted by the ABSBL algorithm. The array shape mismatch prevents the accurate estimation of the azimuths of both sources. From Ping 100 to Ping 120, the ability to estimate the weak Source 2 decreases. In contrast, both sources are consistently estimated throughout the entire process by the ASMLM method.
Additionally, as shown in Table 1, the average computation time per ping at each frequency point is measured as 0.0021 , 0.0126 , 6.0862 , and 0.3965 for CBF, MUSIC, ABSBL, and ASMLM, respectively. Although faster computation speeds are achieved by CBF and MUSIC, their estimation performance deteriorates under array bending and left–right ambiguity cannot be suppressed. The ABSBL algorithm shows good estimation performance when the central angle of the curved shape is not large, but its computation time is slower. In comparison, the ASMLM algorithm is found to effectively balance computation speed and estimation performance.
Table 1.
The average computation time per ping at each frequency point.
The spatial spectrum estimation results at different Pings are shown in Figure 6. In Figure 6a, the results at Ping 2 are presented, where the degree of the array is small. The MUSIC algorithm is sensitive to array shape mismatch, and the estimated power of Source 2 differs significantly from the true power. In contrast, the other methods accurately estimate both the azimuth and power of the two sources, among which ABSBL and ASMLM both show the best left–right ambiguity suppression. In Figure 6b–d, the spatial spectrum estimation results at Ping 10, Ping 28, and Ping 56 are shown, respectively. As the bending of the array increases, the performance of CBF, MUSIC, and ABSBL gradually degrades. ASMLM provides accurate azimuth estimates for the sources, though the power estimation for the weak Source 2 slightly decreases. As the bending of the array increases, an improvement in left–right ambiguity suppression is observed. In Figure 7, the suppression results for Source 1 at different Pings are shown. left–right ambiguity suppression power is calculated based on the estimated power difference between the symmetric left and right DOA peaks (between the true source and its mirror image). Under accurate array shape estimation, a lower degree of bending in the array results in poorer left–right ambiguity suppression, whereas a higher degree of bending leads to improved suppression performance.
Figure 6.
The spatial spectrum estimation results. (a) Ping 2; (b) Ping 10; (c) Ping 28; (d) Ping 56.
Figure 7.
Left–Right Ambiguity Suppression Results.
The array shape estimation results are shown in Figure 8. From Ping 1 to Ping 20 and from Ping 110 to Ping 120, accurate estimations of the chord height of the curved array are provided by both the ABSBL and ASMLM methods. However, from Ping 20 to Ping 110, the chord height varies between 2 and 3.6 , and the chord height estimated by the ABSBL method deviates significantly from the true value.
Figure 8.
Array Shape Estimation Results.
Overall, during the steady turning process, a low degree of array bending is observed at the initial stage of the maneuver, and the general array shape is effectively estimated by both the ABSBL and ASMLM algorithms. As the degree of bending increases, the performance of the ABSBL algorithm degrades, whereas the ASMLM algorithm maintains robust shape estimation performance throughout the entire turning process. In addition, clear advantages in both computational efficiency and left–right ambiguity suppression are demonstrated by the ASMLM algorithm.
5. Experimental Results
In August 2020, a towed linear array turning experiment is conducted in the South China Sea. The towed linear array consists of 48 elements with an element spacing of approximately 0.417 and is connected to the towing platform via a cable. The arc length (array aperture) is about 19.6 . Attitude sensors are installed at the head and tail of the array to record information such as the array’s heading. The array is deployed at a depth of approximately 50 , with a sound speed of about 1540 /. The GPS-recorded trajectory of the towing platform is shown in Figure 9, where a turning maneuver is performed by the platform in the direction indicated by the orange arrows. The trajectory corresponding to the dataset used in the experiment, consisting of a total of 120 Pings, is represented by the green arrows. The water depth at the experimental site is approximately 1015 .
Figure 9.
The trajectory of the towing platform.
The towing platform noise is used as the source signal for estimating the the arrival angles and the array shape. The sampling rate of the array is 16,000 Hz, and the data is processed in 1-second segments, with each segment treated as one Ping. The frequency-domain acoustic pressure received by the array is extracted using the Fourier transform and subsequently normalized. The processed frequency range is from 500 to 560 . The initial central angle is set to 0.2 radians and is set to 0.1. The grid interval is set to 1°. The BTR estimation results obtained by different methods are shown in Figure 10. The CBF method [18,20,28] has low resolution, and its estimation performance decreases when the source is located in the endfire direction (from Ping 80 to Ping 120), and it fails to suppress left–right ambiguity. The MUSIC method [18,19] provides high resolution but suffers from significant performance degradation under array shape mismatch, and left–right ambiguity remains unsuppressed. Both the ABSBL [18] and ASMLM algorithms are capable of achieving high resolution and effectively suppressing left–right ambiguity. However, as shown in Table 2, the average computation time per frequency point is measured as 6.1530 for the ABSBL algorithm and 0.3995 for the ASMLM algorithm. Clearly, a faster computation speed is achieved by the ASMLM algorithm.
Figure 10.
Broadband BTR Estimation Results. (a) CBF; (b) MUSIC; (c) ABSBL; (d) ASMLM.
Table 2.
The average computation time per ping at each frequency point.
The spatial spectrum estimation results at several Pings are illustrated in Figure 11. In Figure 11c,d, the sources are near the endfire direction. The CBF method shows low resolution, and the resolution of the MUSIC algorithm decreases due to array shape mismatch. High resolution and effective suppression of left–right ambiguity are achieved by both the ASMLM and ABSBL algorithms. Superior performance in suppressing left–right ambiguity is demonstrated by the ASMLM algorithm.
Figure 11.
Estimation Results for Different Pings. (a) Ping 5; (b) Ping 30; (c) Ping 70; (d) Ping 80.
In Figure 12, the variation in array chord height during the turning process is illustrated as estimated by the attitude sensor, the ABSBL algorithm, and the ASMLM algorithm. The array shape derived from the attitude sensor is obtained through interpolation and is regarded as a typical non-acoustic estimation method, which is used as a ground-truth reference. The ABSBL method represents a state-of-the-art acoustic-based approach. Given the complex actual shape of the towed array during turning maneuvers, the proposed ASMLM algorithm is compared with these two representative array shape estimation methods.
Figure 12.
Towed Array Shape Estimation Results.
Within the range of Ping 1 to Ping 30 and Ping 80 to Ping 120, comparable estimation results are obtained by the ABSBL and ASMLM algorithms. It is demonstrated that when the array exhibits a low degree of bending, the difference between these models is negligible. The impact of array shape mismatch can be effectively mitigated by the ABSBL and ASMLM algorithms. However, within the range of Ping 30 to Ping 80, where more significant array bending is encountered, the estimation results provided by the ASMLM algorithm align more closely with those obtained from the attitude sensor, thereby verifying the accuracy of the proposed towed array shape modeling and estimation method. Overall, more accurate estimation of the array shape is provided by the ASMLM algorithm, while high computational efficiency, high-resolution sensing, and effective left–right ambiguity suppression are maintained.
6. Conclusions
This paper presents an array shape estimation and high-resolution sensing method suitable for the steady turning process of AUV-towed linear array. The overall shape of the towed linear array is modeled as a circular arc, simplifying both modeling and computation. Within the Bayesian estimation framework, the array shape is introduced as a hyperparameter into the marginal likelihood function for estimation. Given the limited computational resources of the AUV remote sensing platform, the proposed algorithm is designed to efficiently estimate the dynamically changing array shape and the DOA of the source, enabling high-resolution sensing. Compared to the CBF and MUSIC methods, higher resolution is achieved by the proposed algorithm, while array mismatch issues are mitigated through array shape estimation and left–right ambiguities are effectively suppressed when the array is bent. When compared with the state-of-the-art ABSBL method, superior performance in computational speed, array shape estimation accuracy, and left–right ambiguity suppression is demonstrated by the ASMLM algorithm. The effectiveness of the proposed algorithm is validated using experimental data collected in the South China Sea.
Author Contributions
Conceptualization, J.W. and L.C.; methodology, X.P.; software, J.W.; validation, J.W.; formal analysis, J.W.; investigation, J.W. and J.J.; resources, X.P.; data curation, J.W.; writing—original draft preparation, J.W.; writing—review and editing, X.P., L.C. and J.J.; visualization, J.W.; supervision, X.P.; project administration, X.P.; funding acquisition, X.P. All authors have read and agreed to the published version of the manuscript.
Funding
This work was partially supported by the National Natural Science Foundation of China (Grant Nos. 41776108 and 61571397).
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Holmes, J.D.; Kukulya, A. Characteristics of an autonomous underwater vehicle with a towed hydrophone array. In Proceedings of the OCEANS 2006, Boston, MA, USA, 18–21 September 2006; IEEE: Piscataway, NJ, USA, 2006; pp. 1–5. [Google Scholar]
- Xing, T.; Wang, X.; Ding, K.; Ni, K.; Zhou, Q. A multi-source-data-assisted AUV for path cruising: An energy-efficient DDPG approach. Remote Sens. 2023, 15, 5607. [Google Scholar] [CrossRef] [Scilit]
- Li, D.; Du, L. Auv trajectory tracking models and control strategies: A review. J. Mar. Sci. Eng. 2021, 9, 1020. [Google Scholar] [CrossRef] [Scilit]
- Cohen, N.; Klein, I. BeamsNet: A data-driven approach enhancing Doppler velocity log measurements for autonomous underwater vehicle navigation. Eng. Appl. Artif. Intell. 2022, 114, 105216. [Google Scholar] [CrossRef] [Scilit]
- Jiang, Y.; Renner, B.C. Low-cost underwater swarm acoustic localization: A review. IEEE Access 2024, 12, 25779–25796. [Google Scholar] [CrossRef] [Scilit]
- Girard, A.R.; Sousa, J.B.; Silva, J.E. Autopilots for underwater vehicles: Dynamics, configurations, and control. In Proceedings of the OCEANS 2007-Europe, Aberdeen, UK, 18–21 June 2007; IEEE: Piscataway, NJ, USA, 2007; pp. 1–6. [Google Scholar]
- Paull, L.; Saeedi, S.; Seto, M.; Li, H. AUV navigation and localization: A review. IEEE J. Ocean. Eng. 2014, 39, 131–149. [Google Scholar] [CrossRef] [Scilit]
- Teeneti, C.R.; Truscott, T.T.; Beal, D.N.; Pantic, Z. Review of wireless charging systems for autonomous underwater vehicles. IEEE J. Ocean. Eng. 2021, 46, 68–87. [Google Scholar] [CrossRef] [Scilit]
- Tang, Y.; Wang, L.; Jin, S.; Zhao, J.; Huang, C.; Yu, Y. AUV-based side-scan sonar real-time method for underwater-target detection. J. Mar. Sci. Eng. 2023, 11, 690. [Google Scholar] [CrossRef] [Scilit]
- Song, F.; An, P.E.; Folleco, A. Modeling and simulation of autonomous underwater vehicles: Design and implementation. IEEE J. Ocean. Eng. 2003, 28, 283–296. [Google Scholar] [CrossRef]
- Chi, C.; Pallayil, V.; Chitre, M. Design of an adaptive noise canceller for improving performance of an autonomous underwater vehicle-towed linear array. Ocean Eng. 2020, 202, 106886. [Google Scholar] [CrossRef] [Scilit]
- Pallayil, V.; Chitre, M.; Deshpande, P. A digital thin line towed array for small autonomous underwater platforms. In Proceedings of the OCEANS 2007, Vancouver, BC, Canada, 29 September–4 October 2007; IEEE: Piscataway, NJ, USA, 2007; pp. 1–9. [Google Scholar]
- Benjamin, M.R.; Battle, D.; Eickstedt, D.; Schmidt, H.; Balasuriya, A. Autonomous control of an autonomous underwater vehicle towing a vector sensor array. In Proceedings of the 2007 IEEE International Conference on Robotics and Automation, Rome, Italy, 10–14 April 2007; IEEE: Piscataway, NJ, USA, 2007; pp. 4562–4569. [Google Scholar]
- Liu, Y.; Cheng, L.; Zou, Y.; Hu, Z. Thin fiber-optic hydrophone towed array for autonomous underwater vehicle. IEEE Sens. J. 2024, 24, 15125–15132. [Google Scholar] [CrossRef] [Scilit]
- Wolek, A.; McMahon, J.; Dzikowicz, B.R.; Houston, B.H. Tracking multiple surface vessels with an autonomous underwater vehicle: Field results. IEEE J. Ocean. Eng. 2022, 47, 32–45. [Google Scholar] [CrossRef] [Scilit]
- Odom, J.L.; Krolik, J.L. Passive towed array shape estimation using heading and acoustic data. IEEE J. Ocean. Eng. 2015, 40, 465–474. [Google Scholar] [CrossRef]
- Odom, J.L.; Krolik, J. Heading and hydrophone data fusion for towed array shape estimation. Proc. Meet. Acoust. 2013, 19, 055081. [Google Scholar] [CrossRef] [Scilit]
- Zheng, Z.; Yang, T.; Gerstoft, P.; Pan, X. Joint towed array shape and direction of arrivals estimation using sparse Bayesian learning during maneuvering. J. Acoust. Soc. Am. 2020, 147, 1738–1751. [Google Scholar] [CrossRef] [Scilit]
- Zheng, Z.; Yang, T.; Pan, X.; Gerstoft, P. Towed array beamforming using sparse Bayesian learning during maneuvering. In Proceedings of the OCEANS 2019-Marseille, Marseille, France, 17–20 June 2019; IEEE: Piscataway, NJ, USA, 2019; pp. 1–6. [Google Scholar]
- Gerstoft, P.; Hodgkiss, W.S.; Kuperman, W.; Song, H.; Siderius, M.; Nielsen, P.L. Adaptive beamforming of a towed array during a turn. IEEE J. Ocean. Eng. 2003, 28, 44–54. [Google Scholar] [CrossRef]
- Wang, J.; Pan, X.; Li, A.; Liu, F.; Jiao, J. Fast joint estimation of direction of arrival and towed array shape based on marginal likelihood maximization. Digital Signal Process. 2024, 154, 104676. [Google Scholar] [CrossRef] [Scilit]
- Odom, J.L.; Krolik, J.L.; Rogers, J.S. Maximum-likelihood spatial spectrum estimation in dynamic environments with a short maneuverable array. J. Acoust. Soc. Am. 2013, 133, 311–322. [Google Scholar] [CrossRef] [Scilit]
- Gray, D.A.; Anderson, B.D.; Bitmead, R.R. Towed array shape estimation using Kalman filters-theoretical models. IEEE J. Ocean. Eng. 1993, 18, 543–556. [Google Scholar] [CrossRef]
- Lan, T.; Wang, Y.; Qiu, L.; Liu, G. Array shape estimation based on tug vehicle noise for towed linear array sonar during turning. Ocean Eng. 2024, 303, 117554. [Google Scholar] [CrossRef] [Scilit]
- Wu, Q.; Xu, Y. A nonlinear data-driven towed array shape estimation method using passive underwater acoustic data. Remote Sens. 2022, 14, 304. [Google Scholar] [CrossRef] [Scilit]
- Bouvet, M. Beamforming of a distorted line array in the presence of uncertainties on the sensor positions. J. Acoust. Soc. Am. 1987, 81, 1833–1840. [Google Scholar] [CrossRef] [Scilit]
- Yang, T. Deconvolution of decomposed conventional beamforming. J. Acoust. Soc. Am. 2020, 148, EL195–EL201. [Google Scholar] [CrossRef] [Scilit]
- Yang, T. Deconvolved conventional beamforming for a horizontal line array. IEEE J. Ocean. Eng. 2018, 43, 160–172. [Google Scholar] [CrossRef] [Scilit]
- Gerstoft, P.; Mecklenbräuker, C.F.; Xenaki, A.; Nannuru, S. Multisnapshot sparse Bayesian learning for DOA. IEEE Signal Process. Lett. 2016, 23, 1469–1473. [Google Scholar] [CrossRef] [Scilit]
- Gemba, K.L.; Nannuru, S.; Gerstoft, P. Robust ocean acoustic localization with sparse Bayesian learning. IEEE J. Sel. Top. Sign. Process. 2019, 13, 49–60. [Google Scholar] [CrossRef] [Scilit]
- Nannuru, S.; Gemba, K.L.; Gerstoft, P.; Hodgkiss, W.S.; Mecklenbräuker, C.F. Sparse Bayesian learning with multiple dictionaries. Signal Process. 2019, 159, 159–170. [Google Scholar] [CrossRef] [Scilit]
- Li, C.; Liang, G.; Qiu, L.; Shen, T.; Zhao, L. An efficient sparse method for direction-of-arrival estimation in the presence of strong interference. J. Acoust. Soc. Am. 2023, 153, 1257–1271. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Tipping, M.E.; Faul, A.C. Fast marginal likelihood maximisation for sparse Bayesian models. In Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics, Key West, FL, USA, 3–6 January 2003; pp. 276–283. [Google Scholar]
- Faul, A.; Tipping, M. Analysis of sparse Bayesian learning. Adv. Neural Inf. Process. Syst. 2001, 20, 383–389. [Google Scholar]
- Liu, B.; Zhang, Z.; Xu, G.; Fan, H.; Fu, Q. Energy efficient telemonitoring of physiological signals via compressed sensing: A fast algorithm and power consumption evaluation. Biomed. Signal Process. Control 2014, 11, 80–88. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).











