Smart Robot Teams Exploring Sparse Trees

DOI10.1007/11821069_29MaRDI QIDQ5756676zbMATH OpenOpenAlexFDO

Authors Miroslaw Dynia, Jarosław Kutyłowski, Friedhelm Meyer auf der Heide, Christian Schindelhauer

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_29

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15) Analysis of algorithms (68W40)

Recommendations

• LATIN 2004: Theoretical Informatics
• Collective tree exploration
• A recursive approach to multi-robot exploration of trees
• Collaborative exploration of trees by energy-constrained mobile robots
• Remembering without memory: tree exploration by asynchronous oblivious robots

Cited in

(15)

• Online graph exploration: New results on old and new algorithms
• On optimal coverage of a tree with multiple robots
• Online graph exploration algorithms for cycles and trees by multiple searchers
• Fast collaborative graph exploration
• Online Graph Exploration: New Results on Old and New Algorithms
• Collective tree exploration
• Brief announcement: Energy constrained depth first search
• Why Robots Need Maps
• A recursive approach to multi-robot exploration of trees
• LATIN 2004: Theoretical Informatics
• Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next
• Energy constrained depth first search
• Collective graph exploration parameterized by vertex cover
• Collaborative exploration of trees by energy-constrained mobile robots
• Strategies for parallel unaware cleaners

This page was built for publication: Smart Robot Teams Exploring Sparse Trees

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