A new competitive algorithm for agent searching in unknown streets

DOI10.1007/3-540-62034-6_45MaRDI QIDQ6567764zbMATH OpenFDO

Authors Pallab Dasgupta, P. P. Chakrabarti, S. De Sarkar

Publication date 5 July 2024

Full work available at URL https://doi.org/10.1007/3-540-62034-6_45

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)

Recommendations

• Competitive searching in a generalized street
• LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS
• Going home through an unknown street
• Competitive Online Approximation of the Optimal Search Ratio
• Competitive searching in polygons—Beyond generalised streets

Cites work

• Agent searching in a tree and the optimality of iterative deepening
• scientific article; zbMATH DE number 1003229 (Why is no real title available?)
• Searching in the plane
• Shortest paths without a map
• Walking an unknown street with bounded detour

This page was built for publication: A new competitive algorithm for agent searching in unknown streets

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