The beachcombers' problem: walking and searching with mobile robots (Q896140): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Online algorithms: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of search games and rendezvous. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-target ray searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On utilizing speed in networks of mobile agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Exploration by Silent and Oblivious Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Beachcombers’ Problem: Walking and Searching with Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds / 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: Map construction of unknown graphs by multiple agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online searching with turn cost / 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: Exploring an unknown graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast collaborative graph exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collaborative search on the plane without communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Algorithms for Layered Graph Traversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Online Approximation of the Optimal Search Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on guaranteed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online graph exploration algorithms for cycles and trees by multiple searchers / 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: Fence patrolling by mobile agents with distinct speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3833854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths without a map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of optimal search / rank
 
Normal rank

Latest revision as of 04:33, 11 July 2024

scientific article
Language Label Description Also known as
English
The beachcombers' problem: walking and searching with mobile robots
scientific article

    Statements

    The beachcombers' problem: walking and searching with mobile robots (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 December 2015
    0 references
    mobile robots
    0 references
    offline algorithm
    0 references
    online algorithm
    0 references
    schedule
    0 references
    searching
    0 references
    two-speed robots
    0 references
    0 references
    0 references

    Identifiers

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