A natural and well-studied problem in algorithmic graph theory and network optimization is
that of computing a\shortest path" between two nodes, s and t, in a graph whose edges …

A human observer can effortlessly identify visible portions of geometric objects present in the
environment. However, computations of visible portions of objects from a viewpoint involving …

Online algorithms for searching and exploration in the plane - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

We consider online routing strategies for routing between the vertices of embedded planar
straight line graphs. Our results include (1) two deterministic memoryless routing strategies …

We consider online routing algorithms for routing between the vertices of embedded planar
straight line graphs. Our results include (1) two deterministic memoryless routing algorithms …

We present a competitive strategy for walking into the kernel of an initially unknown star-
shaped polygon. From an arbitrary start point, s, within the polygon, our strategy finds a path …

We consider the problem of a robot which has to find a path in an unknown simple polygon
from one point s to another point t, based only on what it has seen so far. A Street is a …

A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving
any instance t of T does not exceed r times the cost of solving t optimally. The competitive …

A simple polygon P with two distinguished vertices, s and t, is called a street if the two
boundary chains from s to t are mutually weakly visible. We present an on-line strategy that …

We provide a competitive strategy for a mobile robot with vision, that has to explore an
unknown simple polygon starting from and returning to a given point on the boundary. Our …