Guaranteed Performance Design for Formation Tracking and Collision Avoidance of Multiple USVs With Disturbances and Unmodeled Dynamics
Bibliographic record
Abstract
Searching and containing dynamic target like oil spillage in the ocean is a challenging task due to the natural time variance of the spread of the oil. The use of cooperative multi-marine vehicle systems in a cluttered environment for this purpose poses difficulties in sustaining formation pattern to pursue and contain the leakage. In this article, in order to provide realistic setup for the industrial applications of multi-marine vehicles systems, we present a novel approach for collision-free distributed formation control for a network of underactuated surface vessels (USVs). The proposed approach comprises two layers: A distributed coordination layer and a local fixed-time neural network control layer. In the first layer, formation leaders accomplish a specified formation configuration while tracking a desired trajectory from a tracking leader. The second control layer is to robustly drive the real USVs with parametric and nonparametric uncertainties to track their corresponding formation leaders. Because only parts of the formation leaders can acquire the states of the tracking leader, a distributed fixed-time estimator is proposed to obtain accurate estimations of the desired information for each USV in the network. Next, in order to effectively maneuver in cluttered environment, local path replanning-based repulsive potential function technique is proposed for each USV in the group formation to act on the formation leaders trajectories. Further, redesigned adaptive neural networks are integrated to compensate the model uncertainties. The stability of the proposed controller is verified by the Lyapunov direct method. Simulation studies of a hexagon formation are presented to illustrate the effectiveness of the proposed approach.
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.003 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| 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".