Utility-based on-line exploration for repeated navigation in an embedded graph

  • Authors:

  • Shlomo Argamon-Engelson;Sarit Kraus;Sigalit Sina

  • Affiliations:

  • Department Mathematics and Computer Science, Bar-Ilan University, Ramat Gan 52900, Israel;Department Mathematics and Computer Science, Bar-Ilan University, Ramat Gan 52900, Israel and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA;Department Mathematics and Computer Science, Bar-Ilan University, Ramat Gan 52900, Israel

  • Venue:
  • Artificial Intelligence
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we address the tradeoff between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more effectively. For example, a robot may need to learn the most efficient routes between important sites in its environment. We compare on-line and off-line exploration for a repeated task, where the agent is given some particular task to perform some number of times. Tasks are modeled as navigation on a graph embedded in the plane. This paper describes a utility-based on-line exploration algorithm for repeated tasks, which takes into account both the costs and potential benefits (over future task repetitions) of different exploratory actions. Exploration is performed in a greedy fashion, with the locally optimal exploratory action performed on each task repetition. We experimentally evaluated our utility-based on-line algorithm against a heuristic search algorithm for off-line exploration as well as a randomized on-line exploration algorithm. We found that for a single repeated task, utility-based on-line exploration consistently outperforms the alternatives, unless the number of task repetitions is very high. In addition, we extended the algorithms for the case of multiple repeated tasks, where the agent has a different randomly-chosen task to perform each time. Here too, we found that utility-based on-line exploration is often preferred.