マルチロータUAVのための軌道ベース巡回セールスマン問題
Trajectory-based Traveling Salesman Problem for Multirotor UAVs
UAVの運動学的制約を考慮し、各ウェイポイントを速度と飛行方向で離散化して時間最適軌道を計算するTBTSPを提案し、ミッション時間を最大15%短縮した。
著者: Fabian Meyer, Katharina Glock
分類: cs.RO, math.OC
原文アブストラクト
This paper presents a new method for integrated time-optimal routing and trajectory optimization of multirotor unmanned aerial vehicles (UAVs). Our approach extends the well-known Traveling Salesman Problem by accounting for the limited maneuverability of the UAVs due to their kinematic properties. To this end, we allow each waypoint to be traversed with a discretized velocity as well as a discretized flight direction and compute time-optimal trajectories to determine the travel time costs for each edge. We refer to this novel optimization problem as the Trajectory-based Traveling Salesman Problem (TBTSP). The results show that compared to a state-of-the-art approach for Traveling Salesman Problems with kinematic restrictions of UAVs, we can decrease mission duration by up to 15\%.
