UAV捜索救助のための厳密被覆経路計画アルゴリズム
An exact coverage path planning algorithm for UAV-based search and rescue operations
風条件下で複数UAVが矩形探索領域を最短時間で被覆する経路計画を混合整数計画として定式化し、厳密解法と下界を提案した。
著者: Sina Kazemdehbashi, Yanchao Liu
分類: cs.RO
原文アブストラクト
Unmanned aerial vehicles (UAVs) are increasingly utilized in global search and rescue efforts, enhancing operational efficiency. In these missions, a coordinated swarm of UAVs is deployed to efficiently cover expansive areas by capturing and analyzing aerial imagery and footage. Rapid coverage is paramount in these scenarios, as swift discovery can mean the difference between life and death for those in peril. This paper focuses on optimizing flight path planning for multiple UAVs in windy conditions to efficiently cover rectangular search areas in minimal time. We address this challenge by dividing the search area into a grid network and formulating it as a mixed-integer program (MIP). Our research introduces a precise lower bound for the objective function and an exact algorithm capable of finding either the optimal solution or a near-optimal solution with a constant absolute gap to optimality. Notably, as the problem complexity increases, our solution exhibits a diminishing relative optimality gap while maintaining negligible computational costs compared to the MIP approach.
