Why Robots Need Maps

DOI10.1007/978-3-540-72951-8_5MaRDI QIDQ5425959zbMATH OpenOpenAlexFDO

Authors Miroslaw Dynia, Jakub Łopuszański, 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

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

Recommendations

• scientific article; zbMATH DE number 1947407
• LATIN 2004: Theoretical Informatics
• Collective tree exploration
• scientific article; zbMATH DE number 1559557
• Smart Robot Teams Exploring Sparse Trees

Cited in

(28)

• Optimal robot localization in trees
• An improved lower bound for competitive graph exploration
• A general lower bound for collaborative tree exploration
• Online Graph Exploration: New Results on Old and New Algorithms
• Map construction of unknown graphs by multiple agents
• Graph exploration by energy-sharing mobile agents
• Gossiping by energy-constrained mobile agents in tree networks
• Collaborative exploration of trees by energy-constrained mobile robots
• Optimal graph exploration without good maps
• Online graph exploration algorithms for cycles and trees by multiple searchers
• scientific article; zbMATH DE number 1947407 (Why is no real title available?)
• Online graph exploration: New results on old and new algorithms
• Exploring and triangulating a region by a swarm of robots
• Collaborative delivery on a fixed path with homogeneous energy-constrained agents
• Near-gathering of energy-constrained mobile agents
• Efficient live exploration of a dynamic ring with mobile robots
• An improved upper bound for the online graph exploration problem on unicyclic graphs
• Strategies for parallel unaware cleaners
• A recursive approach to multi-robot exploration of trees
• Robot map verification of a graph world
• Lower and upper competitive bounds for online directed graph exploration
• Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next
• Fast collaborative graph exploration
• Energy constrained depth first search
• Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
• Collective tree exploration via potential function method
• Graph exploration with robot swarms
• Collaborative Exploration by Energy-Constrained Mobile Robots

This page was built for publication: Why Robots Need Maps

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