An MICP formulation and TPBS algorithm solve MT-TSP-MO and outperform a baseline on instances with up to 40 targets and 40 obstacles.
Parallel, asymptotically optimal algorithms for moving target travel- ing salesman problems,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Two-Phase Bilevel Search for the Moving-Target Traveling Salesman Problem with Moving Obstacles
An MICP formulation and TPBS algorithm solve MT-TSP-MO and outperform a baseline on instances with up to 40 targets and 40 obstacles.