On the two-dimensional cow search problem

DOI10.1016/j.ipl.2009.01.020zbMath1215.68276OpenAlexW2050661091MaRDI 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

uncertaintyon-line algorithmssearch problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Online algorithms; streaming algorithms (68W27)

Related Items (18)

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

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

This page was built for publication: On the two-dimensional cow search problem