Ramón Andrés García Rodríguez

Ramón Andrés García Rodríguez

Auto-generated profile, based on publicly available information

Ramón Andrés García Rodríguez

Universidad de Sevilla

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 November 2021 in Intelligent Service Robotics
Verified
Journal Article
Open access
PDF file
JMJ. G. Martin
J. G. Martin
JFJ. R. D. Frejo
J. R. D. Frejo
RGR. A. García
R. A. García
ECEduardo F. Camacho
Eduardo F. Camacho
The paper proposes the formulation of a single-task robot (ST), single-robot task (SR), time-extended assignment (TA), multi-robot task allocation (MRTA) problem with multiple, nonlinear criteria using discrete variables that drastically reduce the computation burden. Obtaining an allocation is addressed by a Branch and Bound (B&B) algorithm in low scale problems and by a genetic algorithm (GA) specifically developed for the proposed formulation in larger scale problems. The GA crossover and mutation strategies design ensure that the descendant allocations of each generation will maintain a certain level of feasibility, reducing greatly the range of possible descendants, and accelerating their convergence to a sub-optimal allocation. The proposed MRTA algorithms are simulated and analyzed in the context of a thermosolar power plant, for which the spatially distributed Direct Normal Irradiance (DNI) is estimated using a heterogeneous fleet composed of both aerial and ground unmanned vehicles. Three optimization criteria are simultaneously considered: distance traveled, time required to complete the task and energetic feasibility. Even though this paper uses a thermosolar power plant as a case study, the proposed algorithms can be applied to any MRTA problem that uses a multi-criteria and nonlinear cost function in an equivalent way. The performance and response of the proposed algorithms are compared for four different scenarios. The results show that the B&B algorithm can find the global optimal solution in a reasonable time for a case with four robots and six tasks. For larger problems, the genetic algorithm approaches the global optimal solution in much less computation time. Moreover, the trade-off between computation time and accuracy can be easily carried out by tuning the parameters of the genetic algorithm according to the available computational power.

1 January 2012 in IFAC Proceedings Volumes
Verified
Journal Article
Closed access
RGR.A. García
R.A. García
FRFrancisco R. Rubio
Francisco R. Rubio
MOM.G. Ortega
M.G. Ortega

8 April 2021 in Journal of Intelligent & Robotic Systems
Verified
Journal Article
Closed access
PDF file
JMJavier G. Martin
Javier G. Martin
RGRamon A. García
Ramon A. García
ECEduardo F. Camacho
Eduardo F. Camacho


1 July 2017 in Revista Iberoamericana de Automática e Informática Industrial
Verified
Journal Article
Open access
RGRamón A. García
Ramón A. García
FRFrancisco R. Rubio
Francisco R. Rubio
LOLuis Orihuela
Luis Orihuela
PGPablo Millán Gata
Pablo Millán Gata
MOManuel G. Ortega
Manuel G. Ortega

25 March 2024 in IEEE Access
Verified
Journal Article
Open access
JAJosé M. Aguilar-López
José M. Aguilar-López
RGRamón A. García
Ramón A. García
ECEduardo F. Camacho
Eduardo F. Camacho
This paper presents an original algorithm based on the Model Predictive Control strategy for estimating the direct normal irradiance of cloud shaded regions using a mobile robotic sensor system to improve the control of a solar thermal power plant. This new algorithm generates the waypoints of the robot team solving a minimisation problem where the objective function combines several criteria, including the measurements taken by the team. The novel method has been tested by simulation with groups of different numbers of unmanned aerial vehicles using the shape of real cloud shadows projected on the ground extracted from images and it improves the estimation error and the estimation time of previous algorithms.