A Recursive Approach to Multi-robot Exploration of Trees

DOI10.1007/978-3-319-09620-9_26zbMath1416.68193OpenAlexW404046798MaRDI QIDQ5496169

Christian Schindelhauer, Christian Ortolf

Publication date: 7 August 2014

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09620-9_26

zbMATH Keywords

competitive analysisrobotcollective graph exploration

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Related Items (5)

An improved lower bound for competitive graph exploration ⋮ Unnamed Item ⋮ Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next ⋮ Balanced parallel exploration of orthogonal regions ⋮ A general lower bound for collaborative tree exploration

This page was built for publication: A Recursive Approach to Multi-robot Exploration of Trees