This paper introduces a novel routing architecture for Unmanned Aerial Vehicle (UAV) path planning in Search and Rescue (SAR) missions. The system combines a closed-loop probability update with Random-Key Optimizers (RKO) to address the stochastic and real-time constraints of these operations. Modeled as a dynamic probabilistic variant of the Open Vehicle Routing Problem, the architecture adaptively balances probability maximization with resource minimization, demonstrating scalability and competitive performance in computational tests. AI
RANK_REASON Academic paper detailing a new optimization method for a specific problem domain. [lever_c_demoted from research: ic=1 ai=0.7]
Read on arXiv cs.NE (Neural & Evolutionary) →
- Antonio Dantas Filho
- arXiv
- Open Vehicle Routing Problem
- Random-Key Optimizers
- search and rescue
- unmanned aerial vehicle
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →