umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Behavior recognition for learning from demonstration
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2010 (English)In: Proceedings of IEEE International Conference on Robotics and Automation / [ed] Nancy M. Amato et. al, 2010, 866-872 p.Conference paper, Published paper (Refereed)
Abstract [en]

Two methods for behavior recognition are presented and evaluated. Both methods are based on the dynamic temporal difference algorithm Predictive Sequence Learning (PSL) which has previously been proposed as a learning algorithm for robot control. One strength of the proposed recognition methods is that the model PSL builds to recognize behaviors is identical to that used for control, implying that the controller (inverse model) and the recognition algorithm (forward model) can be implemented as two aspects of the same model. The two proposed methods, PSLE-Comparison and PSLH-Comparison, are evaluated in a Learning from Demonstration setting, where each algorithm should recognize a known skill in a demonstration performed via teleoperation. PSLH-Comparison produced the smallest recognition error. The results indicate that PSLH-Comparison could be a suitable algorithm for integration in a hierarchical control system consistent with recent models of human perception and motor control.

Place, publisher, year, edition, pages
2010. 866-872 p.
Keyword [en]
learning and adaptive systems, neurorobotics, autonomous agents
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-32375ISBN: 978-1-4244-5040-4 (print)OAI: oai:DiVA.org:umu-32375DiVA: diva2:303023
Conference
ICRA 2010 IEEE International conference on robotics and automationce, Anchorage, Alaska, May 3-8, 2010
Available from: 2010-07-05 Created: 2010-03-10 Last updated: 2012-01-04Bibliographically approved
In thesis
1. Cognition reversed: Robot learning from demonstration
Open this publication in new window or tab >>Cognition reversed: Robot learning from demonstration
2009 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

The work presented in this thesis investigates techniques for learning from demonstration (LFD). LFD is a well established approach to robot learning, where a teacher demonstrates a behavior to a robot pupil. This thesis focuses on LFD where a human teacher demonstrates a behavior by controlling the robot via teleoperation. The robot should after demonstration be able to execute the demonstrated behavior under varying conditions.

Several views on representation, recognition and learning of robot behavior are presented and discussed from a cognitive and computational perspective. LFD-related concepts such as behavior, goal, demonstration, and repetition are defined and analyzed, with focus on how bias is introduced by the use of behavior primitives. This analysis results in a formalism where LFD is described as transitions between information spaces. Assuming that the behavior recognition problem is partly solved, ways to deal with remaining ambiguities in the interpretation of a demonstration are proposed.

A total of five algorithms for behavior recognition are proposed and evaluated, including the dynamic temporal difference algorithm Predictive Sequence Learning (PSL). PSL is model-free in the sense that it makes few assumptions of what is to be learned. One strength of PSL is that it can be used for both robot control and recognition of behavior. While many methods for behavior recognition are concerned with identifying invariants within a set of demonstrations, PSL takes a different approach by using purely predictive measures. This may be one way to reduce the need for bias in learning. PSL is, in its current form, subjected to combinatorial explosion as the input space grows, which makes it necessary to introduce some higher level coordination for learning of complex behaviors in real-world robots.

The thesis also gives a broad introduction to computational models of the human brain, where a tight coupling between perception and action plays a central role. With the focus on generation of bias, typical features of existing attempts to explain humans' and other animals' ability to learn are presented and analyzed, from both a neurological and an information theoretic perspective. Based on this analysis, four requirements for implementing general learning ability in robots are proposed. These requirements provide guidance to how a coordinating structure around PSL and similar algorithms should be implemented in a model-free way.

Abstract [sv]

Arbetet som presenteras i den här avhandlingen undersöker tekniker för att lära robotar från demonstrationer (LFD). LFD är en väl etablerad teknik där en lärare visar roboten hur den ska göra. Den här avhandlingen fokuserar på LFD där en människa fjärrstyr roboten, som i sin tur tolkar demonstrationen så att den kan repetera beteendet vid ett senare tillfälle, även då omgivningen förändrats. Flera perspektiv på representation, igenkänning och inlärning av beteende presenteras och diskuteras från ett kognitionsvetenskaplig och datavetenskapligt perspektiv. LFD-relaterade koncept så som beteende, mål, demonstration och repetition definieras och analyseras, med fokus på hur förkunskap kan implementeras genom beteendeprimitiv. Analysen resulterar i en formalism där LFD beskrivs som övergångar mellan informationsrymder. I termer av formalismen föreslås även sätt att hantera tvetydigheter efter att en demonstration tolkats genom igenkänning av beteendeprimitiv.

Fem algoritmer för igenkänning av beteende presenteras och utvärderas, däribland algoritmen Predictive Sequence Learning (PSL). PSL är modellfri i bemärkelsen att den introducerar få antaganden om inlärningssituationen. PSL kan fungera som en algoritm för både kontroll och igenkänning av beteende. Till skillnad från flertalet tekniker för igenkänning av beteende använder PSL inte likheter i beteende mellan demonstrationer. PSL utnyttjar i stället prediktiva mått som kan minska behovet av domänkunskap vid inlärning. Ett problem med algoritmen är dock att den drabbas av kombinatorisk explosion då inputrymden växer vilket gör att någon form av högre koordination behövs för inlärning av komplexa beteenden.

Avhandlingen ger dessutom en introduktion till beräkningsmässiga modeller av hjärnan där en stark koppling mellan perception och handling spelar en central roll. Typiska egenskaper hos dessa modeller presenters och analyseras från ett neurologiskt och informationsteoretiskt perspektiv. Denna analys resulterar i fyra krav för att implementera generell inlärningsförmåga i robotar. Dessa krav ger vägledning till hur en koordinerande struktur för PSL och liknande algoritmer skulle kunna implementeras på ett modellfritt sätt.

Place, publisher, year, edition, pages
Umeå: Umeå universitet, Institutionen för datavetenskap, 2009. 138 p.
Series
Report / UMINF, ISSN 0348-0542 ; 09:20
National Category
Computer Science Human Computer Interaction
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-32494 (URN)978-91-7264-925-5 (ISBN)
Presentation
2009-12-16, Naturvetarhuset, N300, Umeå Universitet, Umeå, 13:00 (Swedish)
Opponent
Supervisors
Available from: 2010-03-15 Created: 2010-03-14 Last updated: 2010-03-15Bibliographically approved
2. Cognition Rehearsed: Recognition and Reproduction of Demonstrated Behavior
Open this publication in new window or tab >>Cognition Rehearsed: Recognition and Reproduction of Demonstrated Behavior
2012 (English)Doctoral thesis, comprehensive summary (Other academic)
Alternative title[sv]
Robotövningar : Igenkänning och återgivande av demonstrerat beteende
Abstract [en]

The work presented in this dissertation investigates techniques for robot Learning from Demonstration (LFD). LFD is a well established approach where the robot is to learn from a set of demonstrations. The dissertation focuses on LFD where a human teacher demonstrates a behavior by controlling the robot via teleoperation. After demonstration, the robot should be able to reproduce the demonstrated behavior under varying conditions. In particular, the dissertation investigates techniques where previous behavioral knowledge is used as bias for generalization of demonstrations.

The primary contribution of this work is the development and evaluation of a semi-reactive approach to LFD called Predictive Sequence Learning (PSL). PSL has many interesting properties applied as a learning algorithm for robots. Few assumptions are introduced and little task-specific configuration is needed. PSL can be seen as a variable-order Markov model that progressively builds up the ability to predict or simulate future sensory-motor events, given a history of past events. The knowledge base generated during learning can be used to control the robot, such that the demonstrated behavior is reproduced. The same knowledge base can also be used to recognize an on-going behavior by comparing predicted sensor states with actual observations. Behavior recognition is an important part of LFD, both as a way to communicate with the human user and as a technique that allows the robot to use previous knowledge as parts of new, more complex, controllers.

In addition to the work on PSL, this dissertation provides a broad discussion on representation, recognition, and learning of robot behavior. LFD-related concepts such as demonstration, repetition, goal, and behavior are defined and analyzed, with focus on how bias is introduced by the use of behavior primitives. This analysis results in a formalism where LFD is described as transitions between information spaces. Assuming that the behavior recognition problem is partly solved, ways to deal with remaining ambiguities in the interpretation of a demonstration are proposed.

The evaluation of PSL shows that the algorithm can efficiently learn and reproduce simple behaviors. The algorithm is able to generalize to previously unseen situations while maintaining the reactive properties of the system. As the complexity of the demonstrated behavior increases, knowledge of one part of the behavior sometimes interferes with knowledge of another parts. As a result, different situations with similar sensory-motor interactions are sometimes confused and the robot fails to reproduce the behavior.

One way to handle these issues is to introduce a context layer that can support PSL by providing bias for predictions. Parts of the knowledge base that appear to fit the present context are highlighted, while other parts are inhibited. Which context should be active is continually re-evaluated using behavior recognition. This technique takes inspiration from several neurocomputational models that describe parts of the human brain as a hierarchical prediction system. With behavior recognition active, continually selecting the most suitable context for the present situation, the problem of knowledge interference is significantly reduced and the robot can successfully reproduce also more complex behaviors.

Place, publisher, year, edition, pages
Umeå: Department of Computing Science, Umeå University, 2012. 30 p.
Series
Report / UMINF, ISSN 0348-0542 ; 11.16
Keyword
Behavior Recognition, Learning and Adaptive Systems, Learning from Demonstration, Neurocomputational Modeling, Robot Learning
National Category
Computer Vision and Robotics (Autonomous Systems)
Research subject
Computer and Information Science
Identifiers
urn:nbn:se:umu:diva-50980 (URN)978-91-7459-349-5 (ISBN)
Public defence
2012-01-26, S1031, Norra Beteendevetarhuset, Umeå Universitet, Umeå, 13:15 (English)
Opponent
Supervisors
Available from: 2012-01-04 Created: 2012-01-03 Last updated: 2012-01-04Bibliographically approved

Open Access in DiVA

fulltext(497 kB)496 downloads
File information
File name FULLTEXT01.pdfFile size 497 kBChecksum SHA-512
6239b5690c553cb1efe0e89af2c5f12ed9c8a65c3818ef4e58034b14dd1d7d501c094099b0858f7c49fe5135d09219e1d5833eb7d2441f386845ce66bfb4cd98
Type fulltextMimetype application/pdf

Authority records BETA

Billing, ErikHellström, ThomasJanlert, Lars Erik

Search in DiVA

By author/editor
Billing, ErikHellström, ThomasJanlert, Lars Erik
By organisation
Department of Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 496 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 1741 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf