Autonomous Vision-Guided High-Precision Firefighting using Unmanned Aerial Vehicles
Bibliographic record
Abstract
This paper presents a novel, precise, and fast framework for autonomous aerial forest fire fighting using unmanned aerial vehicles (UAVs) to extinguish a line of fires by most efficiently utilizing the on-board camera. Autonomous aerial firefighting algorithms using UAVs have been proven to be promising in early wildfire suppression. However, UAVs/drones have limited payloads, which do not allow them to carry as much retardant as fixed-wing aircraft do. Hence, firefighting drones should release the retardant in a way that accurately extinguishes wildfire and efficiently suppresses the line of fires. In this work, a DJI M300 RTK drone mounted on which a RGB camera and a 3D-printed water tanker are mounted and utilized to extinguish a line of fires in an outdoor experimental environment. A line of fires has been set up using firepits, whose GPS locations are known. The optimal path along which a drone should approach and release the retardant to extinguish the fire line is calculated using the RANSAC algorithm, as well as the in-motion dropping mission starting point. Nonetheless, due to errors in the drone's onboard GPS sensor, the drone does not exactly position itself at the starting point. In fact, in the proposed method, the drone uses on-board camera images to adjust itself and get aligned with the retardant-releasing line as it is supposed based on prediction, followed by approaching the fire line and releasing the retardant. The testing results show efficient and accurate suppression of fire spots whose video verification is provided at https://www.youtube.com/watch?v=ZP2KoxtwAsg.
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.000 | 0.001 |
| 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.000 | 0.001 |
| 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".