5 papers
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…
Reducing the gap between general purpose data and aerial images in concentrated solar power plants
M. A. Pérez-Cutiño, J. Valverde, J. Capitán +1
In the context of Concentrated Solar Power (CSP) plants, aerial images captured by drones present a unique set of challenges. Unlike urban or natural landscapes commonly found in e…
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…
Efficient variable-length hanging tether parameterization for marsupial robot planning in 3D environments
S. MartÃnez-Rozas, D. Alejo, F. Caballero +6
This paper presents a novel approach to efficiently parameterize and estimate the state of a hanging tether for path and trajectory planning of a UGV tied to a UAV in a marsupial c…
MASPA: An efficient strategy for path planning with a tethered marsupial robotics system
Jesús Capitán, José M. DÃaz-Báñez, Miguel A. Pérez-Cutiño +2
A tethered marsupial robotics system comprises three components: an Unmanned Ground Vehicle (UGV), an Unmanned Aerial Vehicle (UAV), and a tether connecting both robots. Marsupial…