A new competitive algorithm for agent searching in unknown streets

DOI10.1007/3-540-62034-6_45zbMATH Open1541.68386MaRDI QIDQ6567764FDOQ6567764

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

Publication date: 5 July 2024

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

Mathematics Subject Classification ID

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

Cites Work

• Searching in the plane
• Shortest paths without a map
• Walking an unknown street with bounded detour
• Title not available (Why is that?)
• Agent searching in a tree and the optimality of iterative deepening

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)