MétaCan
Menu
Back to cohort
Record W4416706990 · doi:10.1109/tase.2025.3637392

An Adaptive Coordination Exploration Approach for Multi-UAV Based on Entropy-Guided Local Planning

2025· article· W4416706990 on OpenAlexaff
Yonghao Zhao, Jianjun Ni, Yang Gu, Simon X. Yang

Bibliographic record

VenueIEEE Transactions on Automation Science and Engineering · 2025
Typearticle
Language
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsUniversity of Guelph
FundersJiangsu Provincial Key Research and Development ProgramNational Natural Science Foundation of China
KeywordsTask (project management)Complementarity (molecular biology)Motion planningWorkloadRobustness (evolution)Selection (genetic algorithm)PrioritizationPath (computing)

Abstract

fetched live from OpenAlex

Autonomous exploration in unknown environments is a critical capability for multi-UAV systems. However, existing methods often suffer from unbalanced task allocation, low exploration efficiency, and unstable paths, especially in large-scale and complex scenarios. To address these challenges, this paper presents an adaptive coordination exploration approach for multi-UAV systems. In the proposed approach, dynamic region allocation, entropy-guided local planning, and direction-consistent frontier selection are integrated to achieve efficient and collaborative exploration. The system first partitions the environment adaptively based on workload and regional complexity. It then prioritizes high-information-value areas for exploration. Directional constraints are further applied to improve path continuity and reduce turning redundancy. Extensive experiments in indoor maze and pillar environments, and outdoor forest and urban environments demonstrate that the proposed approach outperforms state-of-the-art baselines. Furthermore, ablation studies validate the necessity and complementarity of each module. This work provides a practical and efficient solution for multi-UAV exploration in structured and unstructured environments.

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 distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.641
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.002
Science and technology studies0.0010.000
Scholarly communication0.0010.003
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.060
GPT teacher head0.307
Teacher spread0.247 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations2
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Automation Science and EngineeringSame topicRobotic Path Planning AlgorithmsFrench-language works237,207