SMART: Vision-Based Method of Cooperative Surveillance and Tracking by Multiple UAVs in the Urban Environment
Bibliographic record
Abstract
UAV surveillance and tracking have attracted great enthusiasm in intelligent transportation, and various approaches have been reported up to now. However, these approaches often ignored the uncertainties in the urban environment, such as occlusion, view change, and background clutter. Ignoring these uncertain factors often leads to a reduction in surveillance performance and tracking quality. This study devotes to improving the cooperative surveillance capability of multi-UAV formation by designing different cooperative strategies in the urban environment. To be specific, a novel cooperative architecture is designed to control the observation locations of multiple UAVs throughout the formation process. For different types of interference, we introduce a novel target recognition rate of each UAV as the decision factor and design corresponding cooperative strategies to guarantee the accuracy of cooperative surveillance. Based on this architecture, we develop a vision-based method of cooperative surveillance and tracking by multiple UAVs (SMART) whose objective function is the motion cost and flight reliability of UAVs to ensure that each UAV can be in the optimal surveillance location for the target. The proposed SMART skillfully integrates the strict, elastic, and flight constraint strategies. During the execution of the multi-UAV formation, the inherent safety constraints of multiple UAVs and the designed strategies are used to solve the quadratic optimization model to adjust the locations of these UAVs. To demonstrate the superiority of our method, we conduct a 3D simulation urban environment and devise several experiments to analyze the performance of SMART on it. The experimental results demonstrate that SMART can not only maintain the high cooperative flight capability, but also provide high flexibility and fault tolerance.
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.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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 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".