For a drone and ground robot moving along parallel lines with a tether of bounded length, the minimum-turn, minimum-speed, and minimum-length paths for the ground robot can all be found in linear time.
A visibility-based pursuit-evasion game with a circular obstacle
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Computing optimal trajectories for a tethered pursuer
For a drone and ground robot moving along parallel lines with a tether of bounded length, the minimum-turn, minimum-speed, and minimum-length paths for the ground robot can all be found in linear time.