activity
20112022
most citedLine Search for an Oblivious Moving Target

2 citations · 5 across the 15 of their papers we have counts for

collaborators
Showing 2017Show all

5 papers · 1 filter

cs.DC2017

Gathering in the Plane of Location-Aware Robots in the Presence of Spies

Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis +2

A set of mobile robots (represented as points) is distributed in the Cartesian plane. The collection contains an unknown subset of byzantine robots which are indistinguishable from…

cs.DS2017

Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots

Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis +2

A graph environment must be explored by a collection of mobile robots. Some of the robots, a priori unknown, may turn out to be unreliable. The graph is weighted and each node is a…

cs.DC2017

Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits

Huda Chuangpishit, Jurek Czyzowicz, Leszek Gasieniec +3

Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection.…

cs.DC2017

Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults

Huda Chuangpishit, Jurek Czyzowicz, Evangelos Kranakis +1

A set of mobile robots is placed at points of an infinite line. The robots are equipped with GPS devices and they may communicate their positions on the line to a central authority…

cs.DC2017

Weak Coverage of a Rectangular Barrier

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc +5

Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intru…