activity
20222025
collaborators

5 papers

cs.CV2025

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…

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…

cs.RO2024

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…

cs.DM2022

Algorithms for the Euclidean Bipartite Edge Cover Problem

Rodrigo A. Castro, José M. Díaz-Báñez, Marco A. Heredia +3

Given a graph with costs on its edges, the minimum-cost edge cover problem consists of finding a subset of covering all vertices in at minimum cost. If is bip…