Search arXiv⌕ Search

arXiv · math/9409224

An on-line algorithm for improving performance in navigation

Abstract

Recent papers have shown optimally-competitive on-line strategies for a robot traveling from a point $s$ to a point $t$ in certain unknown geometric environments. We consider the question: Having gained some partial information about the scene on its first trip from $s$ to $t$, can the robot improve its performance on subsequent trips it might make? This is a type of on-line problem where a strategy must exploit {\em partial information \/} about the future (e.g., about obstacles that lie ahead). For scenes with axis-parallel rectangular obstacles where the Euclidean distance between $s$ and $t$ is $n$, we present a deterministic algorithm whose {\em average\/} trip length after $k$ trips, $k \leq n$, is $O(\rootnbyk)$ times the length of the shortest $s$-$t$ path in the scene. We also show that this is the best a deterministic strategy can do. This algorithm can be thought of as performing an optimal tradeoff between search effort and the goodness of the path found. We improve this algorithm so that for {\em every\/} $i \leq n$, the robot's $i$th trip length is $O(\rootnbyi)$ times the shortest $s$-$t$ path length. A key idea of the paper is that a {\em tree\/} structure can be defined in the scene, where the nodes are portions of certain obstacles and the edges are ``short'' paths from a node to its children. The core of our algorithms is an on-line strategy for traversing this tree optimally.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Avrim Blum, Prasad Chalasani. 1994-09-21. An on-line algorithm for improving performance in navigation. https://arxiv.org/abs/math/9409224

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The finite volume method on Sierpiński simplices

In the sequel, we extend the Strichartz average approach for the Laplacian, which uses average values of a function over basic sets, rather than pointwise ones as classically done in the literature, and goes back to the seminal work of~S.~Kusuoka and~X.~Y.~Zhou, to Sierpiński Simplices. To our knowledge, the finite volume method had not been applied before to fractals themselves, with their intrinsic Laplacian. We build the finite volume scheme for the heat equation with Dirichlet boundary conditions, give its consistency error, a stability condition of Courant-Friedrichs-Lewy type, obtained by means of an inclusion between the spectrum of the finite volume matrix and the one of the graph Laplacian, and prove the convergence of the scheme. Numerical results are given in the case of the Sierpiński Gasket and Tetrahedron, and compared with the finite difference method.

math.CO↗

Absolute incidence theorems and tilings

We give a precise definition of incidence theorems in plane projective geometry and introduce the notion of absolute incidence theorems, which hold over any ring. Fomin and Pylyavskyy describe how to obtain incidence theorems from tilings of an orientable surface; they call this result the master theorem. Instances of the master theorem are always absolute incidence theorems. As most classically known incidence theorems are instances of the master theorem, they are absolute incidence theorems. We give an explicit example of an incidence theorem involving 13 points that is not an absolute incidence theorem, and therefore is not an instance of the master theorem.

math.CO↗

Cyclic sieving phenomena for trees and tree-rooted maps

We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees with a given degree distribution of the nodes. Moreover, we consider four different cyclic group actions: (1) the root is moved to the next corner along a tour of the tree; (2) only trees in which the root is at a leaf are considered, and the action moves the root to the next leaf; (3) only trees in which the root is at a non-leaf are considered, and the action moves the root to the next non-leaf corner; (4) only trees in which the root is at a node of degree $δ$ are considered, for a fixed $δ$, and the action moves the root to the next corner of this type. We prove a cyclic sieving phenomenon for each meaningful combination of these sets and actions. As a bonus, we also establish corresponding cyclic sieving phenomena for tree-rooted planar maps.

math.CO↗