Oblivious Robots on Graphs: Exploration

Ilcinkas, David

doi:10.1007/978-3-030-11072-7_9

Cited by 7 publications

(4 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The importance of obliviousness comes from its link to self-stabilization and fault-tolerance (Dijkstra (1982); Dolev (2000)); in addition to robustness, its practical advantage comes from the fact that it does not require any persistent memory (except for storing and executing the algorithm itself); its theoretical relevance derives from the fact that its presence renders the robots computationally weak and the solution to problems even more challenging. the research on the impact and limitations imposed by obliviousness has been investigated quite a lot in the literature (e.g., in Lamani et al (2010); Flocchini et al (2013); Bérard et al (2016); Ilcinkas (2019)).…”

Section: Periodicmentioning

confidence: 99%

Peer Review #2 of "Compacting oblivious agents on dynamic rings (v0.1)"

2021

View full text Add to dashboard Cite

In this paper we investigate dynamic networks populated by autonomous mobile agents.Dynamic networks are networks whose topology can change continuously, at unpredictable locations and at unpredictable times. These changes are not considered to be faults, but rather an integral part of the nature of the system. The agents can autonomously move on the network, with the goal of solving cooperatively an assigned common task.Here, we focus on a specific network: the unoriented ring. More specifically, we study 1interval connected dynamic rings (i.e., at any time, at most one of the edges might be missing). The agents move according to the widely used Look-Compute-Move life cycle, and can be homogenous (thus identical) or heterogenous (agents are assigned colors from a set of c > 1 colors). For identical agents, their goal is to form a compact segment, where agents occupy a continuous part of the ring and no two agents occupy the same node -we call this the Compact Configuration Problem. In the case of agents with colors, called the Colored Compact Configuration Problem, the goal is to group agents such that each group is formed by all agents having the same color, it occupies a continuous segment of the network, and groups of agents having different colors occupy distinct areas of the network.In this paper we determine the necessary conditions to solve both proposed problems. For all solvable cases, we provide algorithms for both the monochromatic and the colored version of the compact configuration problem. All our algorithms work even for the simplest model where agents have no persistent memory, no communication capabilities and do not agree on a common orientation within the network. To the best of our knowledge this is the first work on the compaction problem in a dynamic network.

show abstract

Section: Periodicmentioning

confidence: 99%

Peer Review #2 of "Compacting oblivious agents on dynamic rings (v0.1)"

2021

View full text Add to dashboard Cite

show abstract

“…The importance of obliviousness comes from its link to self-stabilization and fault-tolerance ( Dijkstra, 1982 ; Dolev, 2000 ); in addition to robustness, its practical advantage comes from the fact that it does not require any persistent memory (except for storing and executing the algorithm itself); its theoretical relevance derives from the fact that its presence renders the robots computationally weak and the solution to problems even more challenging. the research on the impact and limitations imposed by obliviousness has been investigated quite a lot in the literature (e.g., in Lamani, Potop-Butucaru & Tixeuil, 2010 ; Flocchini et al, 2013 ; Bérard et al, 2016 ; Ilcinkas, 2019 ).…”

Section: Introductionmentioning

confidence: 99%

Compacting oblivious agents on dynamic rings

Das

Luna

Mazzei

et al. 2021

PeerJ Computer Science

View full text Add to dashboard Cite

In this paper we investigate dynamic networks populated by autonomous mobile agents. Dynamic networks are networks whose topology can change continuously, at unpredictable locations and at unpredictable times. These changes are not considered to be faults, but rather an integral part of the nature of the system. The agents can autonomously move on the network, with the goal of solving cooperatively an assigned common task. Here, we focus on a specific network: the unoriented ring. More specifically, we study 1-interval connected dynamic rings (i.e., at any time, at most one of the edges might be missing). The agents move according to the widely used Look–Compute–Move life cycle, and can be homogenous (thus identical) or heterogenous (agents are assigned colors from a set of c > 1 colors). For identical agents, their goal is to form a compact segment, where agents occupy a continuous part of the ring and no two agents occupy the same node: we call this the Compact Configuration Problem. In the case of agents with colors, called the Colored Compact Configuration Problem, the goal is to group agents such that each group is formed by all agents having the same color, it occupies a continuous segment of the network, and groups of agents having different colors occupy distinct areas of the network. In this paper we determine the necessary conditions to solve both proposed problems. For all solvable cases, we provide algorithms for both the monochromatic and the colored version of the compact configuration problem. All our algorithms work even for the simplest model where agents have no persistent memory, no communication capabilities and do not agree on a common orientation within the network. To the best of our knowledge this is the first work on the compaction problem in a dynamic network.

show abstract

“…In the context of robots evolving on graphs, the two benchmarking tasks are exploration [13] and gathering [4]. In this paper, we address the gathering problem, which requires that robots eventually all meet at a single node, not known beforehand, and terminate upon completion.…”

Section: Introductionmentioning

confidence: 99%

Asynchronous Gathering in a Torus

Kamei,

Lamani,

Ooshita

et al. 2021

Preprint

View full text Add to dashboard Cite

We consider the gathering problem for asynchronous and oblivious robots that cannot communicate explicitly with each other, but are endowed with visibility sensors that allow them to see the positions of the other robots. Most of the investigations on the gathering problem on the discrete universe are done on ring shaped networks due to the number of symmetric configurations. We extend in this paper the study of the gathering problem on torus shaped networks assuming robots endowed with local weak multiplicity detection. That is, robots cannot make the difference between nodes occupied by only one robot from those occupied by more than one robots unless it is their current node. As a consequence, solutions based on creating a single multiplicity node as a landmark for the gathering cannot be used. We present in this paper a deterministic algorithm that solves the gathering problem starting from any rigid configuration on an asymmetric unoriented torus shaped network.

show abstract

Oblivious Robots on Graphs: Exploration

Cited by 7 publications

References 23 publications

Peer Review #2 of "Compacting oblivious agents on dynamic rings (v0.1)"

Peer Review #2 of "Compacting oblivious agents on dynamic rings (v0.1)"

Compacting oblivious agents on dynamic rings

Asynchronous Gathering in a Torus

Contact Info

Product

Resources

About