SearcharxivSearch

arXiv subjects

Danique de Moor

Publications and source records attributed to Danique de Moor.

3 recordsLinked to original sources

WFDroneBench: A Benchmark for Sensor Placement and Drone Routing for Wildfire Detection

Increasingly frequent and severe wildfires threaten ecosystems, public health, and infrastructure. Early detection is vital but limited by existing monitoring systems. Drones offer mobile, real-time coverage, but optimizing sensor placement and drone routing in dynamic fire zones remains challenging. To address this, we introduce WFDroneBench, an open-source Python benchmarking library for early wildfire detection that integrates machine-learned risk maps with optimization-based deployment strategies for sensors, charging stations, and drones. It evaluates risk maps, optimization strategies, and monitoring equipment using standardized metrics and realistic wildfire simulations. The framework supports benchmarking across predictive and decision-making components: machine learning researchers can assess risk models and compare routing strategies. WFDroneBench includes 7746 scenarios across 49 locations, built from historical ignitions, real-world wildfire risk maps, and simulated fire spread, along with two ground detector and three drone routing strategies. Our experiments show that the risk-aware strategy Max-Coverage significantly outperforms other baselines when risk maps are sufficiently accurate, achieving the fastest detection on the most difficult fires. We further find that risk-aware static infrastructure helps even under an imperfect risk map and drone-based detection outperforms ground sensors. Finally, our results reveal two key open challenges: (i) detecting small fires rapidly and reliably, and (ii) improving risk-map prediction, where the gap between ground-truth ignition patterns and available risk maps highlights a significant opportunity for ML innovation. We openly release all code, data, and documentation.

math.OC

Rapid drone-based wildfire detection at a fraction of current prevention spending

Early wildfire detection is critical to prevent small ignitions from escalating into large-scale disasters, yet current monitoring systems lack a quantitative framework for allocating detection infrastructure at scale. We jointly optimize the placement of monitoring infrastructure and the routing of autonomous drones under realistic operational constraints to quantify the investment required for rapid, large-scale wildfire detection. Evaluated out-of-sample on 3,693 California ignitions from 2021-2024, an optimized drone network operating at a $100 million five-year budget detects 97.3% of fires, including 74% within the first hour. Amortized over five years, that budget is about $20 million per year, roughly 5% of California's annual wildfire-prevention expenditure. Under current technology costs, drone-based monitoring is substantially more cost-effective than static ground sensors. Detection is governed primarily by spatial coverage, while routing strategy mainly determines detection speed.

math.OC

Global Nonconvex Optimization with Integer Variables

Nonconvex optimization refers to the process of solving problems whose objective or constraints are nonconvex. Historically, this type of problems have been very difficult to solve to global optimality, with traditional solvers often relying on approximate solutions. Bertsimas et al. introduce a novel approach for solving continuous nonconvex optimization problems to provable optimality, called the Relaxation Perspectification Technique - Branch and Bound (RPT-BB). In this paper, we extend the RPT-BB approach to the binary, mixed-binary, integer, and mixed-integer variable domains. We outline a novel branch-and-bound algorithm that makes use of the Relaxation Perspectification Technique (RPT), as well as binary, integer, and eigenvector cuts. We demonstrate the performance of this approach on four representative nonconvex problems, as well as one real-world nonconvex optimization problem, and we benchmark its performance on BARON and SCIP, two state-of-the-art optimization solvers for nonconvex mixed-integer problems. Our results show that our method stands well against BARON, and often outperforms BARON, in terms of computational time and optimal objective value. Moreover, our results show that, while SCIP continues to lead as the state-of-the-art solver, the proposed algorithm demonstrates strong performance on challenging instances, successfully solving problems to global optimality that SCIP and BARON are unable to solve within the time limit.

math.OC