Coordinated motion planning minimizing total travel length is FPT parameterized by k on graphs arising from discretizations of simple polygons.
Agarwal, and Alex Steiger
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Coordinated Motion Planning is FPT on Discretized Simple Polygons
Coordinated motion planning minimizing total travel length is FPT parameterized by k on graphs arising from discretizations of simple polygons.