TOP
Suche auf der Schloss Dagstuhl Webseite
Sie suchen nach Informationen auf den Webseiten der einzelnen Seminare? - Dann:
Nicht fündig geworden? - Einige unserer Dienste laufen auf separaten Webseiten mit jeweils eigener Suche. Bitte beachten Sie folgende Liste:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminare
Innerhalb dieser Seite:
Externe Seiten:
  • DOOR (zum Registrieren eines Dagstuhl Aufenthaltes)
  • DOSA (zum Beantragen künftiger Dagstuhl Seminare oder Dagstuhl Perspektiven Workshops)
Publishing
Innerhalb dieser Seite:
Externe Seiten:
dblp
Innerhalb dieser Seite:
Externe Seiten:
  • die Informatik-Bibliographiedatenbank dblp


Dagstuhl-Seminar 11131

Exploration and Curiosity in Robot Learning and Inference

( 27. Mar – 01. Apr, 2011 )

(zum Vergrößern in der Bildmitte klicken)

Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite: https://www.dagstuhl.de/11131

Organisatoren

Kontakt


Programm

Summary

This seminar was concerned with answering the question: how should a robot choose its actions and experiences so as to maximise the effectiveness of its learning?.

This seminar was predicated on the assumption that to make significant progress in autonomous robotics, systems level theories of how robots should operate will be required. In recent years methods from machine learning have been employed with great success in robotics, in fields as diverse as visual processing, map building, motor control and manipulation. The machine learning algorithms applied to these problems have included statistical machine learning approaches, such as EM algorithms and density estimation, as well as dimensionality reduction, reinforcement learning, inductive logic programming, and other supervised learning approaches such as locally weighted regression. Most of these robot learning solutions currently require a good deal of supervised learning, or structuring of the learning data for a specific task. As robots become more autonomous these learning algorithms will have to be embedded in algorithms which choose the robot's next learning experience. The problems become particularly challenging in the context of robotics, and even worse for a robot that is faced with many learning opportunities. A robot that can perform both manipulation, language use, visual learning, and mapping may have several quite different learning opportunities facing it at any one time. How should a robot control its curiosity in a principled way in the face of such a variety of choices? How should it choose data on the basis of how much it knows, or on how surprising it finds certain observations? What rational basis should robot designers choose to guide the robot's choice of experiences to learn from? There has been initial progress in several fields, including machine learning, robotics and also in computational neuroscience. In this seminar we brought together these three communities to shed light on the problem of how a robot should select data to learn from, how it should explore its environment, and how it should control curiosity when faced with many learning opportunities.


Teilnehmer
  • Peter Auer (Montan-Universität Leoben, AT) [dblp]
  • Andrew Barto (University of Massachusetts - Amherst, US)
  • Anthony Cohn (University of Leeds, GB) [dblp]
  • Peter Dayan (University College London, GB)
  • Richard W. Dearden (University of Birmingham, GB) [dblp]
  • Yiannis Demiris (Imperial College London, GB) [dblp]
  • Stefan Elfwing (Okinawa Institute of Science and Technology, JP)
  • Charles Fox (University of Sheffield, GB)
  • Martin A. Giese (Universitätsklinikum Tübingen, DE)
  • Marc Hanheide (University of Birmingham, GB) [dblp]
  • Mark D. Humphries (ENS - Paris, FR)
  • Kristian Kersting (Fraunhofer IAIS - St. Augustin, DE) [dblp]
  • Andreas Krause (ETH Zürich, CH) [dblp]
  • Ales Leonardis (University of Birmingham, GB) [dblp]
  • Manuel Lopes (INRIA - Bordeaux, FR) [dblp]
  • Ruben Martinez-Cantin (CUD - Zaragoza, ES)
  • Leo Pape (IDSIA - Manno, CH)
  • Jan Peters (TU Darmstadt, DE) [dblp]
  • Daniel Polani (University of Hertfordshire, GB) [dblp]
  • Jürgen Schmidhuber (IDSIA - Manno, CH) [dblp]
  • Frank Sehnke (ZSW- Stuttgart, DE)
  • Danijel Skocaj (University of Ljubljana, SI)
  • Aaron Sloman (University of Birmingham, GB) [dblp]
  • Janusz Starzyk (Ohio University, US)
  • Naftali Tishby (The Hebrew University of Jerusalem, IL) [dblp]
  • John K. Tsotsos (York University - Toronto, CA) [dblp]
  • Eiji Uchibe (Okinawa Institute of Science and Technology, JP)
  • Ales Ude (Jozef Stefan Institute - Ljubljana, SI) [dblp]
  • Patrick van der Smagt (DLR - Oberpfaffenhofen, DE)
  • Markus Vincze (TU Wien, AT) [dblp]
  • Jeremy L. Wyatt (University of Birmingham, GB) [dblp]
  • Jure Zabkar (University of Ljubljana, SI) [dblp]

Klassifikation
  • data structures / algorithms / complexity

Schlagworte
  • Exploration control
  • dual control
  • optimal control
  • active learning
  • curiosity
  • robot learning
  • exploration