On the two-dimensional cow search problem

DOI10.1016/j.ipl.2009.01.020zbMath1215.68276MaRDI QIDQ987818

Jakub Łopuszański, Artur Jeż

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.020

zbMATH Keywords

uncertainty; on-line algorithms; search problems

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68W27: Online algorithms; streaming algorithms

Related Items

Unnamed Item, Improved Lower Bounds for Shoreline Search, Exploration of High-Dimensional Grids by Finite Automata, Fast two-robot disk evacuation with wireless communication, Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs, Algorithms for \(p\)-Faulty Search on a half-line, Searching for an axis-parallel shoreline, An improved online evacuation strategy from a convex region on grid networks, Linear search by a pair of distinct-speed robots, Reaching a target in the plane with no information, Advice complexity of treasure hunt in geometric terrains, Weighted group search on a line \& implications to the priority evacuation problem, Pebble guided near optimal treasure hunt in anonymous graphs, Deterministic treasure hunt in the plane with angular hints, Evacuating equilateral triangles and squares in the face-to-face model, Pebble guided optimal treasure hunt in anonymous graphs, Evacuating an Equilateral Triangle in the Face-to-Face Model

Cites Work

• Unnamed Item
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Shortest paths without a map
• Search games
• Competitive Algorithms for Layered Graph Traversal