Why Robots Need Maps

DOI10.1007/978-3-540-72951-8_5zbMath1201.68146OpenAlexW1588736092MaRDI QIDQ5425959

Jakub Łopuszański, Miroslaw Dynia, Christian Schindelhauer

Publication date: 15 November 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-72951-8_5

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Related Items (20)

An improved lower bound for competitive graph exploration ⋮ Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots ⋮ Collaborative Exploration by Energy-Constrained Mobile Robots ⋮ Lower and upper competitive bounds for online directed graph exploration ⋮ Online graph exploration: New results on old and new algorithms ⋮ Efficient live exploration of a dynamic ring with mobile robots ⋮ Strategies for parallel unaware cleaners ⋮ Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next ⋮ Collaborative delivery on a fixed path with homogeneous energy-constrained agents ⋮ Online Graph Exploration: New Results on Old and New Algorithms ⋮ Online graph exploration algorithms for cycles and trees by multiple searchers ⋮ Gossiping by energy-constrained mobile agents in tree networks ⋮ Collaborative exploration of trees by energy-constrained mobile robots ⋮ A general lower bound for collaborative tree exploration ⋮ Collaborative delivery with energy-constrained mobile robots ⋮ An improved upper bound for the online graph exploration problem on unicyclic graphs ⋮ Energy constrained depth first search ⋮ Near-gathering of energy-constrained mobile agents ⋮ Fast collaborative graph exploration ⋮ Graph exploration by energy-sharing mobile agents

This page was built for publication: Why Robots Need Maps