Smart Robot Teams Exploring Sparse Trees
From MaRDI portal
Publication:5756676
DOI10.1007/11821069_29zbMath1132.68814OpenAlexW1834556589MaRDI QIDQ5756676
Miroslaw Dynia, Jarosław Kutyłowski, Christian Schindelhauer, Friedhelm Meyer auf der Heide
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
Analysis of algorithms (68W40) 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)
Related Items
Online graph exploration: New results on old and new algorithms ⋮ Strategies for parallel unaware cleaners ⋮ Unnamed Item ⋮ Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next ⋮ Online Graph Exploration: New Results on Old and New Algorithms ⋮ Online graph exploration algorithms for cycles and trees by multiple searchers ⋮ Collaborative exploration of trees by energy-constrained mobile robots ⋮ Fast collaborative graph exploration
This page was built for publication: Smart Robot Teams Exploring Sparse Trees