Showing cs.CGShow all
2 papers · 1 filter
cs.CG2025
Computing optimal trajectories for a tethered pursuer
Aurelio Barrera-Vicent, José Miguel Díaz-Báñez, Fabio Rodríguez +1
In this paper, we introduce a trajectory planning problem for a marsupial robotics system consisting of a ground robot, a drone, and a taut tether of bounded length connecting the…
cs.CG2025
The Euclidean -Matching Problem is NP-hard
José-Miguel Díaz-Báñez, Ruy Fabila-Monroy, José-Manuel Higes-López +3
Let be a complete edge-weighted graph on vertices. To each subset of vertices of assign the cost of the minimum spanning tree of the subset as its weight. Suppose that…