Strategies for parallel unaware cleaners

DOI10.1016/j.tcs.2015.09.026zbMath1332.68260OpenAlexW2172569513MaRDI QIDQ896136

Christian Ortolf, Christian Schindelhauer

Publication date: 11 December 2015

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

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

zbMATH Keywords

competitive analysismobile agentmulti-robot graph explorationvisit time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)

Related Items (1)

A general lower bound for collaborative tree exploration

Cites Work

• Unnamed Item
• Unnamed Item
• Searching in the plane
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
• The Euclidean traveling salesman problem is NP-complete
• Online graph exploration algorithms for cycles and trees by multiple searchers
• The Double Dixie Cup Problem
• Collective tree exploration
• Reducibility Among Combinatorial Problems
• Fast Collaborative Graph Exploration
• Why Robots Need Maps
• Smart Robot Teams Exploring Sparse Trees
• A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: Strategies for parallel unaware cleaners