How to learn an unknown environment. I
From MaRDI portal
Publication:3841650
DOI10.1145/274787.274788zbMath0904.68115OpenAlexW2050037634WikidataQ127332543 ScholiaQ127332543MaRDI QIDQ3841650
Tiko Kameda, Christos H. Papadimitriou, Xiaotie Deng
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/
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items (43)
Online makespan minimization with parallel schedules ⋮ Constructing competitive tours from local information ⋮ An alternative proof for the equivalence of searcher and 2-searcher ⋮ Constructing competitive tours from local information ⋮ Competitive exploration of rectilinear polygons ⋮ Walking streets faster ⋮ Moving an angle around a region ⋮ Querying with Uncertainty ⋮ Going home through an unknown street ⋮ Memory Efficient Anonymous Graph Exploration ⋮ Inspecting a Set of Strips Optimally ⋮ An Improved On-line Strategy for Exploring Unknown Polygons ⋮ Competitive distributed decision-making ⋮ Fibonacci helps to evacuate from a convex region in a grid network ⋮ Worst-case optimal exploration of terrains with obstacles ⋮ Improved exploration of unknown polygons ⋮ Optimality and competitiveness of exploring polygons by mobile robots ⋮ The beachcombers' problem: walking and searching with mobile robots ⋮ Search on a Line by Byzantine Robots ⋮ Exploration of Faulty Hamiltonian Graphs ⋮ Operations research in the space industry ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ The \(k\)-server problem ⋮ Online algorithms for searching and exploration in the plane ⋮ Online Strategies for Evacuating from a Convex Region in the Plane ⋮ Communication and location discovery in geometric ring networks ⋮ GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST ⋮ Tree exploration with advice ⋮ LEAVING AN UNKNOWN MAZE USING AN ERROR-PRONE COMPASS ⋮ Search on a line with faulty robots ⋮ Optimal graph exploration without good maps ⋮ Broadcast in the rendezvous model ⋮ The simple grid polygon exploration problem ⋮ Weighted nearest neighbor algorithms for the graph exploration problem on cycles ⋮ 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 a finite automaton ⋮ Piecemeal graph exploration by a mobile robot. ⋮ The power of a pebble: Exploring and mapping directed graphs ⋮ Performance bounds for planning in unknown terrain ⋮ Graph exploration by energy-sharing mobile agents
This page was built for publication: How to learn an unknown environment. I
