ドゥビンズ車両の巡回セールスマン問題に対する定数近似アルゴリズム
Asymptotic constant-factor approximation algorithm for the Traveling Salesperson Problem for Dubins' vehicle
曲率制約のある車両で平面上のn点を巡回する最短経路問題に対し、初の定数近似アルゴリズムを提案し、従来の下界と上界のギャップを埋めた。
著者: Ketan Savla, Emilio Frazzoli, Francesco Bullo
分類: cs.RO
原文アブストラクト
This article proposes the first known algorithm that achieves a constant-factor approximation of the minimum length tour for a Dubins' vehicle through $n$ points on the plane. By Dubins' vehicle, we mean a vehicle constrained to move at constant speed along paths with bounded curvature without reversing direction. For this version of the classic Traveling Salesperson Problem, our algorithm closes the gap between previously established lower and upper bounds; the achievable performance is of order $n^{2/3}$.
