Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Gathering Despite Mischief / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed algorithm for gathering many fat mobile robots in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stigmergic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous Search: A Personal Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic degree of geometric optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of a pebble: Exploring and mapping directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous of Mobile Agents without Agreement on Local Orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for black hole search with scattered agents in synchronous rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous of Mobile Agents in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous in networks in spite of delay faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leader election and gathering for asynchronous fat robots without common chirality / rank
 
Normal rank
Property / cites work
 
Property / cites work: MinMax-Distance Gathering on Given Meeting Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous embedded pattern formation without orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing by Mobile Robots: Gathering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Constructibility in Graph-Minimization Problems / 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: Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evacuating two robots from multiple unknown exits in a circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering few fat mobile robots in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet when you forget: log-space rendezvous in arbitrary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time versus space trade-offs for rendezvous in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet asynchronously (almost) everywhere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of robots on anonymous grids and trees without multiplicity detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering on rings under the look-compute-move model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing on rings by oblivious robots: a unified approach for different tasks / 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: Gathering asynchronous oblivious agents with local vision in regular bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explore and repair graphs with black holes using mobile entities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous with constant memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic rendezvous in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Gathering of Oblivious Robots in Anonymous Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leader Election Problem versus Pattern Formation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Rendezvous in Restricted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of asynchronous robots with limited visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Rendezvous in Trees with Little Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Formation by Oblivious Asynchronous Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering fat mobile robots with slim omnidirectional cameras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gathering Problem for Two Oblivious Robots with Unreliable Compasses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering asynchronous oblivious mobile robots in a ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronous black hole search in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile Agent Rendezvous in a Synchronous Torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: n-Ellipses and the Minimum Distance Sum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous of two robots with visible bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the point for which the sum of the distances to \(n\) given points is minimum / rank
 
Normal rank

Revision as of 04:56, 15 July 2024

scientific article
Language Label Description Also known as
English
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
scientific article

    Statements

    Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2018
    0 references
    distributed computing
    0 references
    autonomous mobile robots
    0 references
    obliviousness
    0 references
    asynchronous system
    0 references
    unlimited visibility
    0 references
    gathering
    0 references
    optimization problems
    0 references
    Weber-point
    0 references
    0 references
    0 references

    Identifiers