Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil Vadhan  Home/Search
Context Related
| sunysb.edu/~bender/pub...pebblefull.ps 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: sunysb.edu/~bender/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Exploring and mapping an unknown environment is a fundamental problem that is studied in a variety of contexts. Many works have focused on finding efficient solutions to restricted versions of the problem. In this paper, we consider a model that makes very limited assumptions about the environment and solve the mapping problem in this general setting. (Update)
Cited by: More
Collective Tree Exploration - Fraigniaud, Gasieniec, Kowalski, Pelc (Correct)
Data Streams: Algorithms and Applications - Muthukrishnan (2003) (Correct)
Planning Algorithms - LaValle (2004) (Correct)
Similar documents (at the sentence level):
46.5%: The Power of a Pebble: Exploring and Mapping Directed.. - Bender.. (1998) (Correct)
Active bibliography (related documents): More All
0.4: Randomized Robot Navigation Algorithms - Berman, Blum, Fiat, Karloff.. (1996) (Correct)
0.4: Optimal Robot Localization in Trees - Fleischer, Romanik, Schuierer.. (2002) (Correct)
0.4: Learning Algorithms with Applications to Robot Navigation and.. - Singh (1995) (Correct)
Similar documents based on text: More All
0.2: The Power of Team Exploration: Two Robots Can Learn Unlabeled .. - Bender, Slonim (1994) (Correct)
0.1: Scheduling Cilk Multithreaded Parallel Programs on Processors.. - Bender, Rabin (2000) (Correct)
0.1: An Analysis of Bennett's Pebble Game - Knill (1995) (Correct)
Related documents from co-citation: More All
10: Exploring unknown environments - Albers, Henzinger - 1997
10: Exploring an unknown graph (context) - Deng, Papadimitriou - 1990
9: The power of team exploration: Two robots can learn unlabeled directed graphs - Bender, Slonim - 1994
BibTeX entry: (Update)
M. A. Bender, A. Fernandez, D. Ron A. Sahai, and S. Vadhan. The power of a pebble: Exploring and mapping directed graphs. In Proc. Annual Symposium on Foundations of Computer Science, 1998. http://citeseer.ist.psu.edu/article/bender98power.html More
@inproceedings{ bender98power,
author = "Michael A. Bender and Antonio Fern{\'a}ndez and Dana Ron and Amit Sahai and Salil Vadhan",
title = "The power of a pebble: exploring and mapping directed graphs",
pages = "269--278",
year = "1998",
url = "citeseer.ist.psu.edu/article/bender98power.html" }
Citations (may not include all citations):273 A review of current routing protocols for ad hoc mobile wire.. - Royer, Toh - 1999
244 Learning regular sets from queries and counterexamples (context) - Angluin - 1987
144 Switching and Finite Automata Theory (context) - Kohavi - 1978
109 Inference of finite automata using homing sequences (context) - Rivest, Schapire - 1993
83 Navigating in unfamiliar geometric terrain - Blum, Raghavan et al. - 1997
74 Robotic exploration as graph construction (context) - Dudek, Jenkin et al. - 1991
65 Exploring an unknown graph (context) - Deng, Papadimitriou - 1990
53 Theoretical Computer Science (context) - Papadimitriou, Yannakakis et al. - 1991
53 Diversity-based inference of finite automata - Rivest, Schapire - 1994
46 Inferring finite automata with stochastic output functions a.. - Dean, Angluin et al. - 1995
46 How to learn an unknown environment I: The rectilinear case - Deng, Kameda et al. - 1998
45 Piecemeal learning of an unknown environment - Betke, Rivest et al. - 1995
36 Efficient learning of typical finite automata from random wa.. - Freund, Kearns et al. - 1997
31 The power of team exploration: Two robots can learn unlabele.. - Bender, Slonim - 1994
31 Information and Computation (context) - Baeza-Yates, Culberson et al. - 1993
30 Exploring unknown environments - Albers, Henzinger - 1997
27 Randomized robot navigation algorithms - Berman, Blum et al. - 1996
26 The power of a pebble: Exploring and mapping directed graphs - Bender, Fern'andez et al. - 1998
26 line algorithm for improving performance in navigation - Blum, Chalasani - 1993
25 why mazes are easier to search than graphs (context) - Blum, Kozen et al. - 1978
20 Competitive robot mapping with homogeneous markers - Deng, Mirzaian - 1996
19 Uncertainty in graph-based map learning (context) - Dean, Basye et al. - 1992
18 A competitive strategy for learning a polygon (context) - Hoffman, Icking et al. - 1997
17 Exploring unknown undirected graphs (context) - Panaite, Pelc - 1998
16 Piecemeal graph exploration by a mobile robot - Awerbuch, Betke et al. - 1995
15 Efficient algorithms for learning to play repeated games aga.. - Freund, Kearns et al. - 1995
14 the capability of finite automata in 2 and 3 dimensional spa.. (context) - Blum, Sakoda - 1977
11 Robot navigation with range queries (context) - Angluin, Westbrook et al. - 1996
10 Map validation and robot self-location in a graph-like world - Dudek, Jenkin et al. - 1997
5 Computer Graphics and Image Processing (context) - Shah, on - 1974
4 Maze threading automata (context) - Rabin - 1967
4 Exactly learning automata of small cover time - Ron, Rubinfeld - 1997
4 Mathematical Institute of the Academy of Sciences (context) - Anjan, PhD - 1987
4 the behavior of automata in labyrinths (context) - Kudryavtsev, Ushchumlich et al. - 1993
4 A survey of the problem of learning an unknown environment (context) - Zhang - 1994
4 Traversal problems for certain types of deterministic and no.. (context) - Reyzin - 1992
3 Online navigation in a room (context) - Bar-Eli, Berman et al. - 1994
3 Robot map verification of a graph world - Deng, Milios et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.sunysb.edu/~bender/): More
Performance Guarantees for the TSP with a Parameterized.. - Bender, Chekuri (1999) (Correct)
New Algorithms for the Disk Scheduling Problem - Andrews, al. (1998) (Correct)
The Lazy Bureaucrat Scheduling Problem - Arkin, Bender, Mitchell, Skiena (1999) (Correct)
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