Multi-UAV Cooperative Localization for Marine Targets Based on Weighted Subspace Fitting in SAGIN Environment
Bibliographic record
Abstract
As an indispensable part of the Internet of Vehicles (IoV), unmanned aerial vehicles (UAVs) can be deployed for target positioning and navigation in the space–air–ground-integrated network (SAGIN) environment. Maritime target positioning is very important for the safe navigation of ships, hydrographic surveys, and marine resource exploration. Traditional methods typically exploit satellites to locate marine targets in the SAGIN environment, and the location accuracy does not satisfy the requirements of modern ocean observation missions. In order to localize the marine target, we develop a system architecture in this article, which contains UAVs integrated with monostatic multiple-input–multiple-output (MIMO) radars. The main thrust is to estimate the direction-of-arrival (DOA) via MIMO radar. Herein, we consider a general scenario that unknown mutual coupling exist and a novel sparse reconstruction algorithm is proposed. The mutual coupling matrix (MCM) is adopted with the help of its special structure, we formulate the data model as a sparse representation form. Then, two novel matrices, a weighted matrix, and a reduced-dimensional matrix are constructed to reduce the computational complexity and enhance the sparsity, respectively. Thereafter, a sparse constraint model is constructed using the concept of optimal weighted subspace fitting (WSF). Finally, the DOA estimation of maritime targets can be achieved by reconstructing the support of a block sparse matrix. Based on the DOA estimation results, multiple UAVs are used to cross-locate marine targets multiple times, and an accurate marine target position is achieved in the SAGIN environment. Numerical results are carried out, which demonstrates the effectiveness of the proposed DOA estimator, and the multi-UAV cooperative localization system can realize accurate target localization.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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 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".