How to learn an unknown environment. I
From MaRDI portal
Publication:3841650
DOI10.1145/274787.274788zbMath0904.68115MaRDI QIDQ3841650
Xiaotie Deng, Christos H. Papadimitriou, Tiko Kameda
Publication date: 11 January 1999
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1998-45/
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W10: Parallel algorithms in computer science
Related Items
Memory Efficient Anonymous Graph Exploration, Optimal graph exploration without good maps, Performance bounds for planning in unknown terrain, Tree exploration with advice, Constructing competitive tours from local information, Piecemeal graph exploration by a mobile robot., The power of a pebble: Exploring and mapping directed graphs, Competitive distributed decision-making, Competitive exploration of rectilinear polygons, Broadcast in the rendezvous model, Graph exploration by a finite automaton