Luis-Evaristo Caraballo

Luis-Evaristo Caraballo

Auto-generated profile, based on publicly available information

Luis-Evaristo Caraballo

Departamento de Matemática Aplicada II, Universidad de Sevilla, Sevilla, Spain

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 July 2017 in European Journal of Operational Research
Verified
Journal Article
Closed access
LCL.E. Caraballo
L.E. Caraballo
JDJosé Miguel Díaz-Báñez
José Miguel Díaz-Báñez
IMI. Maza
I. Maza
AOA. Ollero
A. Ollero

28 March 2017 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
JDJosé Miguel Díaz-Báñez
José Miguel Díaz-Báñez
LCLuis Evaristo Caraballo
Luis Evaristo Caraballo
MLMario Alberto Lopez
Mario Alberto Lopez
SBSergey Bereg
Sergey Bereg
IMIvan Maza
Ivan Maza
AOAnibal Ollero
Anibal Ollero
This paper addresses a synchronization problem that arises when a team of robots needs to communicate while repeatedly performing assigned tasks in a cooperative scenario. Each robot has a limited communication range and moves along a previously defined closed trajectory. When two robots are close enough, a communication link may be established, allowing the robots to exchange information. The goal is to schedule the motions such that the entire system can be synchronized for maximum information exchange; that is, every pair of neighbors always visit the feasible communication link at the same time. An algorithm for scheduling the team of robots in this scenario is proposed and a robust framework that assures the synchronization of a large team of robots is presented. Simulations, experiments, and computational results demonstrate the applicability of the algorithm. The approach allows the design of fault-tolerant systems that can be used for multiple tasks, such as surveillance, area exploration, and searching for targets in hazardous environments, among others.

1 May 2014
Verified
Conference Paper
Closed access
LCL.E. Caraballo
L.E. Caraballo
JAJ.J. Acevedo
J.J. Acevedo
JDJosé Miguel Díaz-Báñez
José Miguel Díaz-Báñez
BABegoña C. Arrue
Begoña C. Arrue
IMIvan Maza
Ivan Maza
AOA. Ollero
A. Ollero
In monitoring missions, using a cooperative team of Unmanned Aerial Vehicles (UAVs), the goal is to minimize the elapsed time between two consecutive observations of any point in the area. Techniques based in area partitioning achieve the goal when the sub-area assigned to each UAV is according to its capabilities. In previous work of the authors [1] it was presented the one-to-one strategy to obtain in a decentralized way a near optimal partition from any initial grid partition. In this paper a generalization of that strategy called the block-sharing technique is presented. The goal in this work is to accelerate the convergence to an optimal partition with respect to previous work.

27 October 2015 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
LCL. E. Caraballo
L. E. Caraballo
COC. Ochoa
C. Ochoa
PPP. Pérez-Lantero
P. Pérez-Lantero
JRJ. Rojas-Ledesma
J. Rojas-Ledesma

8 May 2018 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
SBSergey Bereg
Sergey Bereg
LCLuis-Evaristo Caraballo
Luis-Evaristo Caraballo
JDJosé-Miguel Díaz-Báñez
José-Miguel Díaz-Báñez
MLMario A. Lopez
Mario A. Lopez

19 November 2020 in Computational Geometry
Verified
Journal Article
Closed access
LCLuis E. Caraballo
Luis E. Caraballo
JDJosé Miguel Díaz-Báñez
José Miguel Díaz-Báñez
RFRuy Fabila-Monroy
Ruy Fabila-Monroy
CHCarlos Hidalgo-Toscano
Carlos Hidalgo-Toscano
JLJesús Leaños
Jesús Leaños
AMAmanda Montejano
Amanda Montejano