Beachcombing on strips and islands

DOI10.1016/J.TCS.2019.04.001zbMATH Open1437.68179OpenAlexW2937994833WikidataQ128020494 ScholiaQ128020494MaRDI QIDQ2285133FDOQ2285133

Authors: Evangelos Bampas, David Ilcinkas, Ralf Klasing, Jurek Czyzowicz 

Publication date: 16 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.04.001

Recommendations

• The beachcombers' problem: walking and searching with mobile robots
• The beachcombers' problem: walking and searching with mobile robots
• The beachcombers' problem: walking and searching from an inner point of a line
• Linear search by a pair of distinct-speed robots
• Optimal distributed searching in the plane with and without uncertainty

zbMATH Keywords

mobile robotstwo-speed robotsgroup searchdomain searchoffline scheduleonline schedule

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Cites Work

• Searching in the plane
• Online algorithms. The state of the art
• The theory of search games and rendezvous.
• Collective tree exploration
• An annotated bibliography on guaranteed graph searching
• Online algorithms: a survey
• Map construction of unknown graphs by multiple agents
• Network exploration by silent and oblivious robots
• Competitive Online Approximation of the Optimal Search Ratio
• Exploring Unknown Environments
• Worst-case optimal exploration of terrains with obstacles
• On utilizing speed in networks of mobile agents
• Online searching with turn cost
• On the linear search problem
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• Fast collaborative graph exploration
• Online graph exploration algorithms for cycles and trees by multiple searchers
• The beachcombers' problem: walking and searching with mobile robots
• The beachcombers' problem: walking and searching from an inner point of a line

Cited In (3)

• The beachcombers' problem: walking and searching from an inner point of a line
• The beachcombers' problem: walking and searching with mobile robots
• The beachcombers' problem: walking and searching with mobile robots

This page was built for publication: Beachcombing on strips and islands

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