Robotic Exploration, Brownian Motion and Electrical Resistance

Authors:
Israel A. Wagner;Michael Lindenbaum;Alfred M. Bruckstein
Affiliations:
-;-;-
Venue:
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Year:
1998

Citing 9
Cited 2

Optimum watchman routes

SCG '86 Proceedings of the second annual symposium on Computational geometry
Universal traversal sequences for paths and cycles

Journal of Algorithms
Bounds on universal sequences

SIAM Journal on Computing
The electrical resistance of a graph captures its commute and cover times

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Searching in the plane

Information and Computation
Trading Space for Time in Undirected $s-t$ Connectivity

SIAM Journal on Computing
Communication in reactive multiagent robotic systems

Autonomous Robots
Approximation algorithms for the geometric covering salesman problem

Discrete Applied Mathematics
Random walks, universal traversal sequences, and the complexity of maze problems

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science

January: a parallel algorithm for bug hunting based on insect behavior

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
On the cover time of random geometric graphs

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A random method for exploring a continuous unknown planar domain with almost no sensors is described. The expected cover time is shown to be proportional to the electrical resistance of the domain, thus extending an existing result for graphs [11]. An upper bound on the variance is also shown, and some open questions are suggested for further research.