The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056)

From MaRDI portal
Revision as of 20:44, 13 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128745084, #quickstatements; #temporary_batch_1726256605485)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The topology of look-compute-move robot wait-free algorithms with hard termination
scientific article

    Statements

    The topology of look-compute-move robot wait-free algorithms with hard termination (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2019
    0 references
    mobile robots
    0 references
    decentralized algorithms for robots
    0 references
    gathering
    0 references
    rendezvous
    0 references
    fault tolerance
    0 references
    termination
    0 references
    wait-free computing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references