Ernesto Jiménez

Ernesto Jiménez

Auto-generated profile, based on publicly available information

Ernesto Jiménez

Universidad Politecnica de Madrid, Madrid, Spain

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
31 October 2006 in Information Processing Letters
Verified
Journal Article
Closed access
EJErnesto Jiménez
Ernesto Jiménez
SASergio Arévalo
Sergio Arévalo
AFAntonio Fernández
Antonio Fernández

1 October 2021 in IEEE Transactions on Robotics
Verified
Journal Article
Open access
EFEduardo Castello Ferrer
Eduardo Castello Ferrer
EJErnesto Jimenez
Ernesto Jimenez
JLJosé Luis López-Presa
José Luis López-Presa
JMJavier Martin-Rueda
Javier Martin-Rueda
Interest in multirobot systems is rising rapidly both in academia and in industry. The use of multiple robots working in a coordinated way, rather than a single robot, has several advantages in a diverse range of applications. However, few studies have focused on operations in which robots can behave maliciously and alter the outcome of the collective mission. In this article, we present a set of Byzantine Follow The Leader (BFTL) problems, in which a subset of robots in the system shows unintended or inconsistent behavior (i.e., Byzantine robots). In the BFTL problems, leaders discover routes from their starting positions to specific destinations and guide the followers , while Byzantine robots try to hinder the leaders and mislead the followers. In this research, blockchain technology is used as a communication tool within multirobot systems, for leaders to broadcast directions to the whole group. We propose algorithms to tackle the BFTL problems, prove their correctness, and validate them in simulated experiments of realistic scenarios. Results show that the proposed algorithms mitigate the impact of Byzantine robots in multirobot systems conducting a BFTL mission. Our analysis provides minimum and maximum boundary calculations for important metrics including number of robots reaching their destination, number of steps taken, and weight requirements of the chain used during the mission. Our results provide a path toward the deployment of byzantine-resistant real-world multirobot systems.

21 July 2006
Verified
Conference Paper
Closed access
AFA. Fernandez
A. Fernandez
EJE. Jimenez
E. Jimenez
MRM. Raynal
M. Raynal
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t<n, where n is the total number of processes). It considers weak assumptions both on the initial knowledge of the processes and on the network behavior. More precisely, initially, a process knows only its identity and the fact that the process identities are different and totally ordered (it knows neither n nor t). Two eventual leader election protocols are presented. The first protocol assumes that a process also knows the lower bound alpha on the number of processes that do not crash. This protocol requires the following behavioral properties from the underlying network: the graph made up of the correct processes and fair lossy links is strongly connected, and there is a correct process connected to t-f other correct processes (where f is the actual number of crashes in the considered run) through eventually timely paths (paths made up of correct processes and eventually timely links). This protocol is not communication-efficient in the sense that each correct process has to send messages forever. The second protocol is communication-efficient: after some time, only the final common leader has to send messages forever. This protocol does not require the processes to know alpha, but requires stronger properties from the underlying network: each pair of correct processes has to be connected by fair lossy links (one in each direction), and there is a correct process whose output links to the rest of correct processes have to be eventually timely. This protocol enjoys also the property that each message is made up of several fields, each of which taking values from a finite domain

1 May 2009 in Journal of Computer and System Sciences
Verified
Journal Article
Closed access
CMCristian Martín
Cristian Martín
MLMikel Larrea
Mikel Larrea
EJErnesto Jiménez
Ernesto Jiménez

1 June 2007
Verified
Conference Paper
Closed access
AFAntonio Fernandez
Antonio Fernandez
VGVincent Gramoli
Vincent Gramoli
EJErnesto Jimenez
Ernesto Jimenez
AKAnne-Marie Kermarrec
Anne-Marie Kermarrec
MRMichel Raynal
Michel Raynal
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with providing useful P2P middleware services capable of dealing with resource assignment and management in a large-scale, heterogeneous and unreliable environment. The slicing service, has been proposed to allow for an automatic partitioning of P2P networks into groups (slices) that represent a controllable amount of some resource and that are also relatively homogeneous with respect to that resource. In this paper we propose two gossip-based algorithms to solve the distributed slicing problem. The first algorithm speeds up an existing algorithm sorting a set of uniform random numbers. The second algorithm statistically approximates the rank of nodes in the ordering. The scalability, efficiency and resilience to dynamics of both algorithms rely on their gossip-based models. These algorithms are proved viable theoretically and experimentally.

1 September 2015 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Open access
SASergio Arévalo
Sergio Arévalo
AAAntonio Fernández Anta
Antonio Fernández Anta
DIDamien Imbs
Damien Imbs
EJErnesto Jiménez
Ernesto Jiménez
MRMichel Raynal
Michel Raynal
\ud \ud This paper is on homonymous distributed systems where processes are prone to crash failures and have no\ud initial knowledge of the system membership (‘‘homonymous’’ means that several processes may have the same identifier). New classes of failure detectors suited to these systems are first defined. Among them, the classes HΩ and HΣ are introduced that are the homonymous counterparts of the Classes Ω and Σ, respectively. (Recall that the pair ⟨Ω, Σ⟩ defines the weakest failure detector to solve consensus.) Then, the paper shows how HΩ and HΣ can be implemented in homonymous systems without membership knowledge (under different synchrony requirements). Finally, two algorithms are presented that use these failure detectors to solve consensus in homonymous asynchronous systems where there is no initial knowledge of the membership. One algorithm solves consensus with ⟨HΩ, HΣ⟩, while the other uses only\ud HΩ, but needs a majority of correct processes.\ud Observe that the systems with unique identifiers and anonymous systems are extreme cases of\ud homonymous systems from which follows that all these results also apply to these systems. Interestingly, the new failure detector class HΩ can be implemented with partial synchrony (i.e., all messages sent after some bounded time GST will be received after at most an unknown bounded latency δ), while the analogous class AΩ defined for anonymous systems cannot be implemented (even in synchronous systems). Hence, the paper provides the first consensus algorithm for anonymous systems with this model of partial synchrony and a majority of correct processes