Observer-Based Adaptive Neural Network Trajectory Tracking Control for Remotely Operated Vehicle
Bibliographic record
Abstract
This paper focuses on the adaptive trajectory tracking control for a remotely operated vehicle (ROV) with an unknown dynamic model and the unmeasured states. Unlike most previous trajectory tracking control approaches, in this paper, the velocity states and the angular velocity states in the body-fixed frame are unmeasured, and the thrust model is inaccurate. Obviously, it is more in line with the actual ROV systems. Since the dynamic model is unknown, a new local recurrent neural network (local RNN) structure with fast learning speed is proposed for online identification. To estimate the unmeasured states, an adaptive terminal sliding-mode state observer based on the local RNN is proposed, so that the finite-time convergence of the trajectory tracking error can be guaranteed. Considering the problem of inaccurate thrust model, an adaptive scale factor is introduced into thrust model, and the thruster control signal is considered as the input of the trajectory tracking system directly. Based on the local RNN output, the adaptive scale factor, and the state estimation values, an adaptive trajectory tracking control law is constructed. The stability of the trajectory tracking control system is analyzed by the Lyapunov theorem. The effectiveness of the proposed control scheme is illustrated by simulations.
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.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".