Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Searching for targets who want to be found / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yet more on the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agent searching in a tree and the optimality of iterative deepening / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rendezvous Search Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous Search on the Line with Indistinguishable Players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note: Two rendezvous search problems on the line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Deterministic Rendezvous on the Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous Search on the Line with Distinguishable Players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous Search on the Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric Rendezvous on the Line Is a Double Linear Search Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous deterministic rendezvous in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic rendezvous in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet asynchronously (almost) everywhere / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet asynchronously at polynomial cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet in anonymous network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rendezvous problem on discrete locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous in Higher Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Dimensional Rendezvous Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tell Me Where I Am So I Can Meet You Sooner / 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: Gathering of asynchronous robots with limited visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Information and Communication Complexity / 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: Q5501371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic gathering with crash faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous of Two Robots with Constant Memory / 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: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to learn an unknown environment. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring unknown environments with obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive analysis of algorithms for searching unknown scenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning-tree based coverage of continuous areas by a mobile robot / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive on-line coverage of grid environments by a mobile robot / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon exploration with time-discrete vision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case optimal exploration of terrains with obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The giving tree: Constructing trees for efficient offline and online multi-robot coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank

Latest revision as of 07:07, 20 July 2024

scientific article
Language Label Description Also known as
English
Rendezvous in planar environments with obstacles and unknown initial distance
scientific article

    Statements

    Rendezvous in planar environments with obstacles and unknown initial distance (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2019
    0 references
    multi-robot systems
    0 references
    planning in complex environments
    0 references
    rendezvous search
    0 references
    coverage planning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers