BiLSTM-Attention-PFTBD: Robust Long-Baseline Acoustic Localization for Autonomous Underwater Vehicles in Adversarial Environments
Bibliographic record
Abstract
The accurate and reliable localization and tracking of Autonomous Underwater Vehicles (AUVs) are essential for the success of various underwater missions, such as environmental monitoring, subsea resource exploration, and military operations. long-baseline acoustic localization (LBL) is a fundamental technique for underwater positioning, but it faces significant challenges in adversarial environments. These challenges include abrupt target maneuvers and intentional signal interference, both of which degrade the performance of traditional localization algorithms. Although particle filter-based Track-Before-Detect (PFTBD) algorithms are effective under normal submarine conditions, they struggle to maintain accuracy in adversarial environments due to their dependence on conventional likelihood calculations. To address this, we propose the BiLSTM-Attention-PFTBD algorithm, which enhances the traditional PFTBD framework by integrating bidirectional Long Short-Term Memory (BiLSTM) networks with multi-head attention mechanisms. This combination enables better feature extraction and adaptation for localizing AUVs in adversarial underwater environments. Simulation results demonstrate that the proposed method outperforms traditional PFTBD algorithms, significantly reducing localization errors and maintaining robust tracking accuracy in adversarial settings.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".