Competitive searching over terrains

DOI10.1007/978-3-031-55598-5_17MaRDI QIDQ6547937zbMATH OpenFDO

Authors Sarita de Berg, Nathan van Beusekom, Kevin Verbeek, Jules Wulms

Publication date 31 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-55598-5_17

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A competitive analysis of algorithms for searching unknown scenes
• An Optimal Competitive Strategy for Walking in Streets
• Competitive exploration of rectilinear polygons
• Competitive online routing in geometric graphs
• Competitive online routing on Delaunay triangulations
• Competitive Searching for a Line on a Line Arrangement.
• Competitive searching in polygons—Beyond generalised streets
• Generalized streets revisited
• How to find a point on a line within a fixed distance
• How to learn an unknown environment. I
• scientific article; zbMATH DE number 1003229 (Why is no real title available?)
• scientific article; zbMATH DE number 1006218 (Why is no real title available?)
• Navigating in Unfamiliar Geometric Terrain
• Online algorithms for searching and exploration in the plane
• Online searching with turn cost
• Parallel searching in the plane
• Searching and on-line recognition of star-shaped polygons.
• Searching in the plane
• Searching on a line: a complete characterization of the optimal solution
• The polygon exploration problem
• Walking an unknown street with bounded detour
• Yet more on the linear search problem

Cited in

(1)

• Compact representation of semilinear and terrain-like graphs

This page was built for publication: Competitive searching over terrains

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