Matches in SemOpenAlex for { <https://semopenalex.org/work/W3095825352> ?p ?o ?g. }
Showing items 1 to 74 of
74
with 100 items per page.
- W3095825352 startingPage "17" @default.
- W3095825352 abstract "A swarm of anonymous oblivious mobile robots, operating in deterministic Look-Compute-Move cycles, is confined within a circular track. All robots agree on the clockwise direction (chirality), they are activated by an adversarial semi-synchronous scheduler (SSYNCH), and an active robot always reaches the destination point it computes (rigidity). Robots have limited visibility: each robot can see only the points on the circle that have an angular distance strictly smaller than a constant ϑ from the robot’s current location, where 0 < ϑ ≤ π (angles are expressed in radians).We study the Gathering problem for such a swarm of robots: that is, all robots are initially in distinct locations on the circle, and their task is to reach the same point on the circle in a finite number of turns, regardless of the way they are activated by the scheduler. Note that, due to the anonymity of the robots, this task is impossible if the initial configuration is rotationally symmetric; hence, we have to make the assumption that the initial configuration be rotationally asymmetric.We prove that, if ϑ = π (i.e., each robot can see the entire circle except its antipodal point), there is a distributed algorithm that solves the Gathering problem for swarms of any size. By contrast, we also prove that, if ϑ ≤ π/2, no distributed algorithm solves the Gathering problem, regardless of the size of the swarm, even under the assumption that the initial configuration is rotationally asymmetric and the visibility graph of the robots is connected.The latter impossibility result relies on a probabilistic technique based on random perturbations, which is novel in the context of anonymous mobile robots. Such a technique is of independent interest, and immediately applies to other Pattern-Formation problems." @default.
- W3095825352 created "2020-11-09" @default.
- W3095825352 creator A5015796580 @default.
- W3095825352 creator A5052863751 @default.
- W3095825352 creator A5054829031 @default.
- W3095825352 creator A5059668922 @default.
- W3095825352 date "2020-10-01" @default.
- W3095825352 modified "2023-09-23" @default.
- W3095825352 title "Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots." @default.
- W3095825352 doi "https://doi.org/10.4230/lipics.disc.2020.12" @default.
- W3095825352 hasPublicationYear "2020" @default.
- W3095825352 type Work @default.
- W3095825352 sameAs 3095825352 @default.
- W3095825352 citedByCount "1" @default.
- W3095825352 countsByYear W30958253522022 @default.
- W3095825352 crossrefType "proceedings-article" @default.
- W3095825352 hasAuthorship W3095825352A5015796580 @default.
- W3095825352 hasAuthorship W3095825352A5052863751 @default.
- W3095825352 hasAuthorship W3095825352A5054829031 @default.
- W3095825352 hasAuthorship W3095825352A5059668922 @default.
- W3095825352 hasConcept C11413529 @default.
- W3095825352 hasConcept C120665830 @default.
- W3095825352 hasConcept C121332964 @default.
- W3095825352 hasConcept C123403432 @default.
- W3095825352 hasConcept C13533509 @default.
- W3095825352 hasConcept C154945302 @default.
- W3095825352 hasConcept C181335050 @default.
- W3095825352 hasConcept C2524010 @default.
- W3095825352 hasConcept C33923547 @default.
- W3095825352 hasConcept C41008148 @default.
- W3095825352 hasConcept C49937458 @default.
- W3095825352 hasConcept C70943382 @default.
- W3095825352 hasConcept C90509273 @default.
- W3095825352 hasConceptScore W3095825352C11413529 @default.
- W3095825352 hasConceptScore W3095825352C120665830 @default.
- W3095825352 hasConceptScore W3095825352C121332964 @default.
- W3095825352 hasConceptScore W3095825352C123403432 @default.
- W3095825352 hasConceptScore W3095825352C13533509 @default.
- W3095825352 hasConceptScore W3095825352C154945302 @default.
- W3095825352 hasConceptScore W3095825352C181335050 @default.
- W3095825352 hasConceptScore W3095825352C2524010 @default.
- W3095825352 hasConceptScore W3095825352C33923547 @default.
- W3095825352 hasConceptScore W3095825352C41008148 @default.
- W3095825352 hasConceptScore W3095825352C49937458 @default.
- W3095825352 hasConceptScore W3095825352C70943382 @default.
- W3095825352 hasConceptScore W3095825352C90509273 @default.
- W3095825352 hasLocation W30958253521 @default.
- W3095825352 hasOpenAccess W3095825352 @default.
- W3095825352 hasPrimaryLocation W30958253521 @default.
- W3095825352 hasRelatedWork W1485100503 @default.
- W3095825352 hasRelatedWork W2105783854 @default.
- W3095825352 hasRelatedWork W2296734119 @default.
- W3095825352 hasRelatedWork W2552134270 @default.
- W3095825352 hasRelatedWork W2739345135 @default.
- W3095825352 hasRelatedWork W2757417530 @default.
- W3095825352 hasRelatedWork W2761818636 @default.
- W3095825352 hasRelatedWork W2801438199 @default.
- W3095825352 hasRelatedWork W2802831009 @default.
- W3095825352 hasRelatedWork W28915144 @default.
- W3095825352 hasRelatedWork W2906932812 @default.
- W3095825352 hasRelatedWork W2912649667 @default.
- W3095825352 hasRelatedWork W2951649450 @default.
- W3095825352 hasRelatedWork W2963730940 @default.
- W3095825352 hasRelatedWork W3003575917 @default.
- W3095825352 hasRelatedWork W3025008187 @default.
- W3095825352 hasRelatedWork W3112347159 @default.
- W3095825352 hasRelatedWork W3137947126 @default.
- W3095825352 hasRelatedWork W3210999774 @default.
- W3095825352 hasRelatedWork W166293029 @default.
- W3095825352 isParatext "false" @default.
- W3095825352 isRetracted "false" @default.
- W3095825352 magId "3095825352" @default.
- W3095825352 workType "article" @default.