Exploring unknown environments with obstacles

DOI10.1007/S00453-001-0067-XMaRDI QIDQ5956837zbMATH OpenOpenAlexFDO

Authors Susanne Albers, Klaus Kursawe, Sven Schuierer

Publication date 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0067-x

zbMATH Keywords

competitive analysisgeometric scenesgrid graphsonline algorithmsrobot exploration

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Artificial intelligence for robotics (68T40) Nonnumerical algorithms (68W05)

Recommendations

• How to learn an unknown environment. I
• An improved strategy for exploring a grid polygon
• scientific article; zbMATH DE number 1559557
• Computing and Combinatorics
• scientific article; zbMATH DE number 1809601

Cited in

(21)

• Efficient exploration of unknown indoor environments using a team of mobile robots
• Polygon exploration with time-discrete vision
• Evacuating two robots from multiple unknown exits in a circle
• Search on a line with faulty robots
• Advice complexity of treasure hunt in geometric terrains
• Graph exploration by energy-sharing mobile agents
• Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract)
• Rendezvous in planar environments with obstacles and unknown initial distance
• Evacuating from \(\ell_p\) unit disks in the wireless model
• Better upper bounds for searching on a line with Byzantine robots
• Constructing optimal cyclic tours for planar exploration and obstacle avoidance : A graph theory approach
• Optimal Exploration of Terrains with Obstacles
• How to learn an unknown environment. I
• Worst-case optimal exploration of terrains with obstacles
• Exploring Unknown Environments
• Navigating an Infinite Space with Unreliable Movements
• Computing and Combinatorics
• Search on a Line by Byzantine Robots
• Optimality and competitiveness of exploring polygons by mobile robots
• Exploration of convex terrains by a deterministic automaton with pebbles
• On-line exploration of an unbounded region with one obstacle

This page was built for publication: Exploring unknown environments with obstacles

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