Susanne Albers, Monika Rauch Henzinger  Home/Search
Context Related
| digital.com/pub/DE...SRC1997014.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dec.com/pub/DEC...srctn1997014 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connected graph. The robot's task is to visit all nodes and edges of the graph using the minimum number R of edge traversals. Koutsoupias [16] gave a lower bound for R of #(d 2 m), and Deng and Papadimitriou [12] showed an upper bound of d O(d) m, where m is the number edges in the graph and d is the minimum number... (Update)
Cited by: More
Collective Tree Exploration - Fraigniaud, Gasieniec, Kowalski, Pelc (Correct)
Coordinated Multi-Robot Exploration - Burgard, Moors, Stachniss, Schneider (2005) (Correct)
Tree Exploration with Little Memory - Krzysztof Diks Pierre (2002) (Correct)
Similar documents (at the sentence level):
49.3%: Exploring Unknown Environments - Albers, Henzinger (1997) (Correct)
Active bibliography (related documents): More All
0.3: Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
0.3: A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
0.3: Tight Lower Bounds for st-Connectivity on the NNJAG Model - Edmonds, Poon, Achlioptas (1999) (Correct)
Similar documents based on text: More All
0.1: On a Simple Depth-First Search Strategy for Exploring Unknown Graphs - Kwek (1997) (Correct)
0.1: Tight Bounds for Worst-Case Equilibria - Czumaj, Vöcking (2002) (Correct)
0.1: Exploring Unknown Environments with Obstacles - Albers, Kursawe, Schuierer (1998) (Correct)
Related documents from co-citation: More All
19: Exploring an unknown graph (context) - Deng, Papadimitriou - 1990
17: Theoretical Computer Science (context) - Papadimitriou, Yannakakis et al. - 1991
16: Exploring unknown undirected graphs (context) - Panaite, Pelc - 1998
BibTeX entry: (Update)
S. Albers and M. Henzinger. Exploring unknown environments. In Proc. 29th Annu. ACM Sympos. Theory Comput., pages 416--425, 1997. http://citeseer.ist.psu.edu/albers97exploring.html More
@inproceedings{ albers97exploring,
author = "Susanne Albers and Monika R. Henzinger",
title = "Exploring unknown environments",
pages = "416--425",
year = "1997",
url = "citeseer.ist.psu.edu/albers97exploring.html" }
Citations (may not include all citations):83 Navigating in unfamiliar geometric terrain - Blum, Raghavan et al. - 1991
65 Exploring an unknown graph (context) - Deng, Papadimitriou
53 Theoretical Computer Science (context) - Papadimitriou, Yannakakis et al. - 1991
45 Piecemeal learning of an unknown environment - Betke, Rivest et al. - 1993
45 How to learn an unknown environment (context) - Deng, Kameda et al. - 1991
28 line navigation in a room (context) - Bar-Eli, Berman et al. - 1992
27 Space lower bounds for maze threadability on restricted mach.. (context) - Cook, Rackoff - 1980
27 Randomized robot navigation algorithms - Berman, Blum et al. - 1996
26 line algorithm for improving performance in navigation - Blum, Chalasani - 1994
18 A competitive strategy for learning a polygon (context) - Hoffmann, Icking et al. - 1997
14 Piecemeal Graph Learning by a Mobile Robot (context) - Awerbuch, Betke et al. - 1995
12 polynomial time algorithms for directed s--t connectivity (context) - Barnes, Buss et al. - 1992
11 A nearly optimal time-space lower bound for directed st-conn.. (context) - Edmonds, Poon - 1995
11 Time-space lower bounds for directed s--t connectivity on JA.. - Barnes, Edmonds - 1993
7 on Foundations of Computer Science (context) - Deng, Papadimitriou et al. - 1990
6 a simple depth-first search strategy for exploring unknown g.. - Kwek - 1997
3 Result reported (context) - Koutsoupias
3 Problem formulation cited (context) - Rivest
2 The power of teach exploration: two robots can learn unlabel.. (context) - Bender, Slonim - 1994
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC