Exploring unknown environments with obstacles

DOI10.1007/s00453-001-0067-xzbMath1052.68127OpenAlexW3138253756MaRDI QIDQ5956837

Klaus Kursawe, Sven Schuierer, Susanne Albers

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 analysisonline algorithmsrobot explorationgeometric scenesgrid graphs

Mathematics Subject Classification ID

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

Related Items (13)

Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) ⋮ Worst-case optimal exploration of terrains with obstacles ⋮ Optimality and competitiveness of exploring polygons by mobile robots ⋮ Evacuating two robots from multiple unknown exits in a circle ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model ⋮ Search on a Line by Byzantine Robots ⋮ Better Upper Bounds for Searching on a Line with Byzantine Robots ⋮ Search on a line with faulty robots ⋮ Advice complexity of treasure hunt in geometric terrains ⋮ Efficient exploration of unknown indoor environments using a team of mobile robots ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Polygon exploration with time-discrete vision ⋮ Graph exploration by energy-sharing mobile agents

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