English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Gathering is a fundamental coordination problem in cooperative mobilerobotics. In short, given a set of robots with arbitrary initial locations andno initial agreement on a global coordinate system, gathering requires that allrobots, following their algorithm, reach the exact same but not predeterminedlocation. Gathering is particularly challenging in networks where robots areoblivious (i.e., stateless) and direct communication is replaced byobservations on their respective locations. Interestingly any algorithm thatsolves gathering with oblivious robots is inherently self-stabilizing if nospecific assumption is made on the initial distribution of the robots. In thispaper, we significantly extend the studies of de-terministic gatheringfeasibility under different assumptions This manuscript considerably extendspreliminary results presented as an extended abstract at the DISC 2006conference [7]. The current version is under review at Distributed ComputingJournal since February 2012 (in a previous form) and since 2014 in the currentform. The most important results have been also presented in MAC 2010 organizedin Ottawa from August 15th to 17th 2010 related to synchrony and faults (crashand Byzantine). Unlike prior work, we consider a larger set of schedulingstrategies, such as bounded schedulers. In addition, we extend our study to thefeasibility of probabilistic self-stabilizing gathering in both fault-free andfault-prone environments.

Fault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering - Feasibility Study -