EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN (Q2929616): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Exploring Unknown Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for a Black Hole in Synchronous Tree Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map construction of unknown graphs by multiple agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring an unknown graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal graph exploration without good maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network exploration by a single agent with Byzantine tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree exploration with little memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remembering without memory: tree exploration by asynchronous oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing without communicating: ring exploration by asynchronous oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective tree exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition for memoryless periodic exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed algorithms in unlabeled tori and chordal rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Undirected Graphs / rank
 
Normal rank

Revision as of 06:44, 9 July 2024

scientific article
Language Label Description Also known as
English
EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN
scientific article

    Statements

    EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN (English)
    0 references
    0 references
    0 references
    14 November 2014
    0 references
    algorithm
    0 references
    exploration
    0 references
    mobile agent
    0 references
    grid
    0 references
    stationary token
    0 references

    Identifiers