2015
DOI: 10.1137/140958682
|View full text |Cite
|
Sign up to set email alerts
|

Pattern Formation by Oblivious Asynchronous Mobile Robots

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
91
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 86 publications
(92 citation statements)
references
References 17 publications
1
91
0
Order By: Relevance
“…They never cross, if the sum of their distances is smaller than the other way. The proof is given in [19]. As shown in fig.…”
Section: Collision Avoidance Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…They never cross, if the sum of their distances is smaller than the other way. The proof is given in [19]. As shown in fig.…”
Section: Collision Avoidance Algorithmmentioning
confidence: 99%
“…Assume each robot has one neighbor at least. According to Lemma 1, we propose a collision avoidance algorithm based on [10], [11], [14]- [16], [19], which consists of 6 steps: (1) Positions P ci (x ci , y ci ) in initial group are separated into .. = y f i+j , all of these positions P f i , P f i+1 , ...P f i+j in each set of final group are reordered according to x f i , and at the same time the positions with the same subscripts P ci , P ci+1 , ...P ci+j in the associated set of initial group also are reordered according to x ci . (4) Similar to (3), if y ci − y ci+k < ε, (k = 1, ..., j), P ci , P ci+1 , ...P ci+j of each set are reordered again according to x ci , and P f i , P f i+1 , ...P f i+j coordinated positions in final group are also reordered according to fig.…”
Section: Collision Avoidance Algorithmmentioning
confidence: 99%
“…In literature, the researchers have established various theoretical models for MRS. Based on those models, the fundamental coordination problems are studied. Specifically, the theoretical models are divided into fully-synchronous, semi-synchronous, and asynchronous [38] and fundamental coordination problems include gathering [39], pattern formation [35,40], flocking [41], and so on. We categorize the local coordination in MRS according to three criteria, namely, system model, and robot ability, the problem as shown in Figure 3.…”
Section: Local Coordination In Multi-robot Systemsmentioning
confidence: 99%
“…In [5], Das et al investigated the problem of forming a sequence of patterns in a given order. In [3,9], the problem was studied allowing the pattern to have multiplicities. In [4,9] the so-called EMBEDDED PATTERN FORMATION problem was studied where the pattern to be formed is provided as a set of visible points in the plane.…”
Section: Earlier Workmentioning
confidence: 99%
“…In [3,9], the problem was studied allowing the pattern to have multiplicities. In [4,9] the so-called EMBEDDED PATTERN FORMATION problem was studied where the pattern to be formed is provided as a set of visible points in the plane. Recently in [10], the pattern formation problem was studied on an infinite grid for robots with limited visibility.…”
Section: Earlier Workmentioning
confidence: 99%