Enhancing drone swarm efficiency through a high-flexibility biomimetic formation algorithm
Bibliographic record
Abstract
With the rapid advancement of unmanned aerial vehicle technologies, drone swarms have been increasingly adopted in applications ranging from agriculture and logistics to defense and performance arts. However, conventional swarm control architectures, predominantly centralized, remain limited in scalability, adaptability, and robustness under dynamic conditions. To address these limitations, this study presents a bio-inspired formation control framework that integrates decentralized coordination and autonomous role assignment. The proposed system incorporates a reference–follower mechanism, enabling drones to dynamically select reference units based on spatial proximity, thereby enhancing inter-drone interaction and formation stability. Furthermore, a hybrid communication architecture based on robot operating system (ROS) and message queuing telemetry transport protocols is developed to overcome the constraints of traditional ROS communication frameworks and improve scalability. The proposed framework shows strong potential for application in various domains such as precision agriculture, search and rescue, and environmental monitoring, offering a flexible and adaptive solution for future drone swarm operations. Finally, simulation and real-world flight experiments validate the proposed approach, demonstrating significant improvements in formation flexibility, communication efficiency, and adaptive leader switching compared to conventional leader–follower and virtual structure models.
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.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.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".