Competitive searching in a generalized street

DOI10.1016/S0925-7721(99)00015-2MaRDI QIDQ1807650zbMATH OpenOpenAlexFDO

Authors Amitava Datta, Christian Icking

Publication date 23 November 1999

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0925-7721(99)00015-2

zbMATH Keywords

doublingstreet

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Competitive searching in polygons—Beyond generalised streets
• Generalized streets revisited
• LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS
• scientific article; zbMATH DE number 2185606
• Going home through an unknown street

Cited in

(14)

• Searching and on-line recognition of star-shaped polygons.
• scientific article; zbMATH DE number 2185606 (Why is no real title available?)
• scientific article; zbMATH DE number 176578 (Why is no real title available?)
• Generalized streets revisited
• An Optimal Competitive Strategy for Walking in Streets
• Online algorithms for searching and exploration in the plane
• LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS
• The tourist in the shopping arcade
• Position-independent near optimal searching and on-line recognition in star polygons
• The ultimate strategy to search on \(m\) rays?
• Parallel searching on m rays
• Competitive searching in polygons—Beyond generalised streets
• A new competitive algorithm for agent searching in unknown streets
• On-line path planning in an unknown polygonal environment

This page was built for publication: Competitive searching in a generalized street

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