Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
7
0

Year Published

2010
2010
2011
2011

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

##### References 10 publications
1
7
0
Order By: Relevance
“…From this result we concluded that computing the level-n-labels of all vertices is essentially enough for multiple robots to weakly meet and, with some additional effort, also to reconstruct the visibility graph of the polygon. Our solution improves on the previous result [4] where LB-robots additionally were allowed to measure angles very roughly (in fact only to distinguish between angles smaller and larger than π). The results in the present paper show that this additional capability is not necessary.…”
Section: Summary and Future Worksupporting
confidence: 61%
See 3 more Smart Citations
“…From this result we concluded that computing the level-n-labels of all vertices is essentially enough for multiple robots to weakly meet and, with some additional effort, also to reconstruct the visibility graph of the polygon. Our solution improves on the previous result [4] where LB-robots additionally were allowed to measure angles very roughly (in fact only to distinguish between angles smaller and larger than π). The results in the present paper show that this additional capability is not necessary.…”
Section: Summary and Future Worksupporting
confidence: 61%
“…It was previously shown that without initial knowledge about the size of the polygon, such a robot cannot infer the size of a polygon and thus cannot reconstruct its visibility graph [6]. If the robot is only allowed to move along the boundary of the polygon, it cannot reconstruct the visibility graph, even if the number of vertices n is known beforehand [4]. It is still an open question whether the knowledge of n helps in the general case where the robot is not restricted to move along the boundary.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Section 2). Bilò et al showed that such a robot cannot reconstruct the visibility graph of a polygon by moving along the boundary only, even if the number of vertices n is known, unless provided with additional capabilities [2]. We extend the model by allowing the robot to look-back after moving, i.e.…”
Section: Introductionmentioning
confidence: 99%