Online Navigation in a Room

DOI10.1006/jagm.1994.1039zbMath1321.68430OpenAlexW1983655539MaRDI QIDQ4314494

P. Y. Yan, Eldad Bar-Eli, Piotr Berman, Amos Fiat

Publication date: 22 November 1995

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1994.1039

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Online algorithms; streaming algorithms (68W27)

Related Items (11)

Worst-case optimal exploration of terrains with obstacles ⋮ Exploration of Faulty Hamiltonian Graphs ⋮ Online algorithms for searching and exploration in the plane ⋮ Tree exploration with advice ⋮ COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS ⋮ Optimal graph exploration without good maps ⋮ Advice complexity of treasure hunt in geometric terrains ⋮ Graph exploration by a finite automaton ⋮ Piecemeal graph exploration by a mobile robot. ⋮ Optimal robot localization in trees ⋮ The power of a pebble: Exploring and mapping directed graphs

This page was built for publication: Online Navigation in a Room