On the two-dimensional cow search problem

DOI10.1016/J.IPL.2009.01.020MaRDI QIDQ987818zbMATH OpenOpenAlexFDO

Authors 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

on-line algorithmssearch problemsuncertainty

Mathematics Subject Classification ID

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

Recommendations

• A nearly tight lower bound for the d-dimensional cow-path problem
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• scientific article; zbMATH DE number 437569
• Searching for an axis-parallel shoreline
• Online searching with turn cost

Cites work

• Competitive Algorithms for Layered Graph Traversal
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Search games
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Shortest paths without a map

Cited in

(21)

• 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
• scientific article; zbMATH DE number 437569 (Why is no real title available?)
• Evacuating an equilateral triangle in the face-to-face model
• Searching for an axis-parallel shoreline
• scientific article; zbMATH DE number 7561402 (Why is no real title available?)
• Exploration of High-Dimensional Grids by Finite Automata
• 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
• A nearly tight lower bound for the d-dimensional cow-path problem
• Algorithms for \(p\)-Faulty Search on a half-line
• Exploration of High-Dimensional Grids by Finite State Machines
• Almost-optimal deterministic treasure hunt in arbitrary graphs
• An improved online evacuation strategy from a convex region on grid networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987818)