Robust Control of Underwater Vehicles with Fault-Tolerant Infinity-Norm Thruster Force Allocation
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
There are to objectives to this paper. First, a chattering-free sliding mode controller is proposed for the trajectory control of remotely operated vehicles (ROVs). Secondly, a new approach for thruster force allocation is proposed that is based on minimizing the l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">infin</sub> norm. With regards to the former, a new adaptive term is developed that eliminates the high frequency control action inherent in a conventional sliding-mode controller, and also removes the need for a priori knowledge of upper bounds on uncertainties in the dynamic parameters of the ROV. With regards to the latter, it is demonstrated that the l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">infin</sub> norm optimization can be cast as a linear problem that affords easy incorporation of the thruster saturation limits. Using numerical simulations, it is shown that the proposed l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">infin</sub> thruster allocation is capable of meeting the adaptive sliding mode controller's demands in the presence of thruster failures and is therefore fault tolerant. Finally, a recurrent neural network is designed in order to obtain a real time solution rate to the thruster allocation problem.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it