An Online Algorithm for Improving Performance in Navigation

DOI10.1137/S0097539795290593zbMATH Open0953.68061arXivmath/9409224OpenAlexW2132529817MaRDI QIDQ4507331FDOQ4507331

Avrim Blum, Prasad Chalasani

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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, $kleqn$, is $O(ootnbyk)$ 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/} $ileqn$, the robot's $i$th trip length is $O(ootnbyi)$ 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.

Full work available at URL: https://arxiv.org/abs/math/9409224

zbMATH Keywords

learningonline algorithmsnavigationlower boundscompetitive analysisrobot path planningexploration vs.\ exploitationunfamiliar terrain

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (3)

• COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS
• Online makespan minimization with parallel schedules
• Online algorithms for searching and exploration in the plane

This page was built for publication: An Online Algorithm for Improving Performance in Navigation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507331)