Biangular Circle Formation by Asynchronous Mobile Robots

2005 ◽  
pp. 185-199 ◽  
Author(s):  
Branislav Katreniak
Keyword(s):  
Mobile Robots ◽  
Circle Formation

scholarly journals Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity

2008 ◽  
Vol 396 (1-3) ◽  
pp. 97-112 ◽  
Author(s):  
Xavier Défago ◽  
Samia Souissi
Keyword(s):  
Mobile Robots ◽  
Circle Formation ◽  
Uniform Circle Formation

scholarly journals Circle formation of weak mobile robots

2008 ◽  
Vol 3 (4) ◽  
pp. 1-20 ◽  
Author(s):  
Yoann Dieudonné ◽  
Ouiddad Labbani-Igbida ◽  
Franck Petit
Keyword(s):  
Mobile Robots ◽  
Circle Formation

Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem

2014 ◽  
pp. 217-232 ◽  
Author(s):  
Paola Flocchini ◽  
Giuseppe Prencipe ◽  
Nicola Santoro ◽  
Giovanni Viglietta
Keyword(s):  
Distributed Computing ◽  
Mobile Robots ◽  
Formation Problem ◽  
Circle Formation ◽  
Uniform Circle Formation

scholarly journals Circle formation for anonymous mobile robots with order preservation

2012 ◽  
Author(s):  
Chen Wang ◽  
Guangming Xie ◽  
Ming Cao ◽  
Long Wang
Keyword(s):  
Mobile Robots ◽  
Order Preservation ◽  
Circle Formation

Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds

2021 ◽  
Vol 31 (01) ◽  
pp. 2150002
Author(s):  
Adam Heriban ◽  
Sébastien Tixeuil
Keyword(s):  
Mobile Robot ◽  
Mobile Robots ◽  
Lower Bounds ◽  
Leader Election ◽  
Limit Formula ◽  
Empty Subset ◽  
Circle Formation ◽  
The Impact ◽  
Uniform Circle Formation ◽  
Limited Visibility

We consider mobile robotic entities that have to cooperate to solve assigned tasks. In the literature, two models have been used to model their visibility sensors: the full visibility model, where all robots can see all other robots, and the limited visibility model, where there exists a limit [Formula: see text] such that all robots closer than [Formula: see text] are seen and all robots further than [Formula: see text] are not seen. We introduce the uncertain visibility model, which generalizes both models by considering that a subset of the robots further than [Formula: see text] cannot be seen. An empty subset corresponds to the full visibility model, and a subset containing every such robot corresponds to the limited visibility model. Then, we explore the impact of this new visibility model on the feasibility of benchmarking tasks in mobile robots computing: gathering, uniform circle formation, luminous rendezvous, and leader election. For each task, we determine the weakest visibility adversary that prevents task solvability, and the strongest adversary that allows task solvability. Our work sheds new light on the impact of visibility sensors in the context of mobile robot computing, and paves the way for more realistic algorithms that can cope with uncertain visibility sensors.

Sign in / Sign up

Export Citation Format

Share Document