Teach‐and‐repeat path following for an autonomous underwater vehicle
Bibliographic record
Abstract
Abstract This paper presents a teach‐and‐repeat path‐following method for an autonomous underwater vehicle (AUV) navigating long distances in environments where external navigation aides are denied. This method utilizes sonar images to construct a series of reference views along a path, stored as a topological map. The AUV can then renavigate along this path, either to return to the start location or to repeat the route. Utilizing unique assumptions about the sonar image‐generation process, this system exhibits robust image‐matching capabilities, providing observations to a discrete Bayesian filter that maintains an estimate of progress along the path. Image‐matching also provides an estimate of offset from the path, allowing the AUV to correct its heading and effectively close the gap. Over a series of field trials, this system demonstrated online control of an AUV in the ocean environment of Holyrood Arm, Newfoundland and Labrador, Canada. The system was implemented on an International Submarine Engineering Ltd. Explorer AUV and performed multiple path completions over both a 1 and 5 km track. These trials illustrated an AUV operating in a fully autonomous mode, in which navigation was driven solely by sensor feedback and adaptive control. Path‐following performance was as desired, with the AUV maintaining close offset to the path.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
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".