A Low-Cost Experimental Quadcopter Drone Design for Autonomous Search-and-Rescue Missions in GNSS-Denied Environments
Bibliographic record
Abstract
Autonomous drones may be called on to perform search-and-rescue operations in environments without access to signals from the global navigation satellite system (GNSS), such as underground mines, subterranean caverns, or confined tunnels. While technology to perform such missions has been demonstrated at events such as DARPA’s Subterranean (Sub-T) Challenge, the hardware deployed for these missions relies on heavy and expensive sensors, such as LiDAR, carried by costly mobile platforms, such as legged robots and heavy-lift multicopters, creating barriers for deployment and training with this technology for all but the wealthiest search-and-rescue organizations. To address this issue, we have developed a custom four-rotor aerial drone platform specifically built around low-cost low-weight sensors in order to minimize costs and maximize flight time for search-and-rescue operations in GNSS-denied environments. We document the various issues we encountered during the building and testing of the vehicle and how they were solved, for instance a novel redesign of the airframe to handle the aggressive yaw maneuvers commanded by the FUEL exploration framework running onboard the drone. The resulting system is successfully validated through a hardware autonomous flight experiment performed in an underground environment without access to GNSS signals. The contribution of the article is to share our experiences with other groups interested in low-cost search-and-rescue drones to help them advance their own programs.
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.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.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".