Search citation statements

Paper Sections

Select...

4

1

Citation Types

0

33

0

Year Published

2015

2018

Publication Types

Select...

2

2

Relationship

3

1

Authors

Journals

(33 citation statements)

0

33

0

“…Two types of exploration tasks have been well studied: perpetual exploration requires robots to visit nodes so that every node is visited infinitely many times by a robot, and terminating exploration requires robots to terminate after every node is visited by a robot at least once. For example, perpetual exploration has been studied for rings [1] and grids [2], and terminating exploration has been studied for rings [14,16], trees [15], grids [12], tori [13], and arbitrary networks [3].…”

confidence: 99%

“…Two types of exploration tasks have been well studied: perpetual exploration requires robots to visit nodes so that every node is visited infinitely many times by a robot, and terminating exploration requires robots to terminate after every node is visited by a robot at least once. For example, perpetual exploration has been studied for rings [1] and grids [2], and terminating exploration has been studied for rings [14,16], trees [15], grids [12], tori [13], and arbitrary networks [3].…”

confidence: 99%

“…To fit various applications and environments, numerous variants of exploration have been studied in the literature, for instance, terminating exploration -the robots stop moving after completion of the exploration of the whole graph [8,9,13]-, exclusive perpetual exploration -every node is visited infinitely often, but no two robots collide at the same node [1,2]-, exploration with return -each robot comes back to its initial location once the exploration is completed [11] -, etc.. Clearly, some of these variants may be mixed (e.g., exclusive perpetual exploration vs. non exclusive terminating exploration) and either weakened or strengthened (weak perpetual exploration -every node is visited infinitely often by at least one robot [3]-vs. strong perpetual exploration -every node is visited infinitely often by each robot-, etc.). Note that all these instances of exploration are different problems in the sense that, in most of the cases, solutions for any given instance cannot be used to solve another instance.…”

confidence: 99%

“…Indeed, since the network's port numbers may not be unique, it may be impossible for an algorithm to unambiguously indicate where each robot has to move. This model, introduced by Klasing, Markou, and Pelc [22] as an extension of the model of oblivious robots in continuous spaces (e.g., [14]), has been extensively employed and investigated, focusing on basic problems in specific classes of graphs under different schedulers: gathering and scattering (e.g., [4,5,6,7,10,16,17,19,21,22,25,26]), and exploration and traversal (e.g., [1,2,3,8,9,11,12,13,23,24]). Note that, with the exception of [3], the literature assumes unlabelled edges.…”

confidence: 99%