Strategies for parallel unaware cleaners

DOI10.1016/J.TCS.2015.09.026MaRDI QIDQ896136zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Why Robots Need Maps
• LATIN 2004: Theoretical Informatics
• Collective tree exploration
• A recursive approach to multi-robot exploration of trees
• scientific article; zbMATH DE number 1947407

Cites work

• scientific article; zbMATH DE number 3526435 (Why is no real title available?)
• scientific article; zbMATH DE number 878897 (Why is no real title available?)
• A tight bound on approximating arbitrary metrics by tree metrics
• Collective tree exploration
• Fast collaborative graph exploration
• Online graph exploration algorithms for cycles and trees by multiple searchers
• Reducibility among combinatorial problems
• Searching in the plane
• Smart Robot Teams Exploring Sparse Trees
• The Double Dixie Cup Problem
• The Euclidean traveling salesman problem is NP-complete
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
• Why Robots Need Maps

Cited in

(1)

• A general lower bound for collaborative tree exploration

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

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