Stand up indulgent gathering (Q5918567): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by the same user not shown)
Property / cites work
 
Property / cites work: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronous gathering without multiplicity detection: a certified algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stand up indulgent gathering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-Free Gathering Without Chirality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of gathering, a certification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autonomous mobile robots with lights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant and Self-stabilizing Mobile Robots Gathering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing gathering of mobile robots under crash or Byzantine faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of gathering by a set of autonomous mobile robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stand Up Indulgent Rendezvous / rank
 
Normal rank

Latest revision as of 12:37, 4 December 2024

scientific article; zbMATH DE number 7619396
Language Label Description Also known as
English
Stand up indulgent gathering
scientific article; zbMATH DE number 7619396

    Statements

    Stand up indulgent gathering (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2022
    0 references
    The authors answer positively to the feasibility of SUIG (stand up indulgent gathering) in mobile robotic swarms. The approach is constructive, as an explicit algorithm is given to solve the SUIG in the FSYNC (fully synchronous) execution model, using only oblivious robots with arbitrary local coordinate systems (there is no agreement on any direction, chirality, or unit distance), without relying on multiplicity detection (robots are unaware of the number of robots, or approximation of it, on any occupied location). Furthermore, no assumptions are made about the initial positions of the robots. The solution is self-stabilizing (the initial configuration may include multiplicity points, and even be bivalent), does not rely on extra assumptions such as multiplicity detection capacity, a common direction, orientation, or chirality etc., and its running time is proportional to the maximum initial distance between robots.
    0 references
    mobile robots
    0 references
    gathering
    0 references
    fault tolerance
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references