Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Research Note Utility-based On-Line Exploration
 

Summary: Research Note
Utility-based On-Line Exploration
for Repeated Navigation in an Embedded Graph
Shlomo (Sean) Argamon-Engelson1 Sarit Kraus1;2 Sigalit Sina1
1 Dept. Mathematics and Computer Science
Bar-Ilan University
52900 Ramat Gan, Israel
Tel: +972-3-531-8407
Email: fargamon,sarit,sinag@cs.biu.ac.il
2Institute for Advanced Computer Studies
University of Maryland
College Park, MD 20742
Abstract
In this paper, we address the tradeo between exploration and exploitation for
agents which need to learn more about the structure of their environment in order to
perform more e ectively. For example, a robot may need to learn the most e cient
routes between important sites in its environment. We compare on-line and o -line ex-
ploration 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

  

Source: Argamon, Shlomo - Department of Computer Science, Illinois Institute of Technology

 

Collections: Computer Technologies and Information Sciences