SwePub
Sök i LIBRIS databas

  Extended search

WFRF:(Ögren Petter)
 

Search: WFRF:(Ögren Petter) > Improving the Perfo...

  • Kartasev, MartKTH,Robotik, perception och lärande, RPL (author)

Improving the Performance of Backward Chained Behavior Trees that use Reinforcement Learning

  • Article/chapterEnglish2023

Publisher, publication year, extent ...

  • Institute of Electrical and Electronics Engineers (IEEE),2023
  • printrdacarrier

Numbers

  • LIBRIS-ID:oai:DiVA.org:kth-342643
  • https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-342643URI
  • https://doi.org/10.1109/IROS55552.2023.10342319DOI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:kon swepub-publicationtype

Notes

  • Part of ISBN 978-1-6654-9190-7QC 20240130
  • In this paper we show how to improve the performance of backward chained behavior trees (BTs) that include policies trained with reinforcement learning (RL). BTs represent a hierarchical and modular way of combining control policies into higher level control policies. Backward chaining is a design principle for the construction of BTs that combines reactivity with goal directed actions in a structured way. The backward chained structure has also enabled convergence proofs for BTs, identifying a set of local conditions to be satisfied for the convergence of all trajectories to a set of desired goal states. The key idea of this paper is to improve performance of backward chained BTs by using the conditions identified in a theoretical convergence proof to configure the RL problems for individual controllers. Specifically, previous analysis identified so-called active constraint conditions (ACCs), that should not be violated in order to avoid having to return to work on previously achieved subgoals. We propose a way to set up the RL problems, such that they do not only achieve each immediate subgoal, but also avoid violating the identified ACCs. The resulting performance improvement depends on how often ACC violations occurred before the change, and how much effort, in terms of execution time, was needed to re-achieve them. The proposed approach is illustrated in a dynamic simulation environment.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Salér, JustinKTH,Robotik, perception och lärande, RPL(Swepub:kth)u1puhfk3 (author)
  • Ögren, Petter,1974-KTH,Optimeringslära och systemteori,Robotik, perception och lärande, RPL(Swepub:kth)u1izkr9z (author)
  • KTHRobotik, perception och lärande, RPL (creator_code:org_t)

Related titles

  • In:2023 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2023: Institute of Electrical and Electronics Engineers (IEEE), s. 1572-1579

Internet link

To the university's database

Find more in SwePub

By the author/editor
Kartasev, Mart
Salér, Justin
Ögren, Petter, 1 ...
About the subject
ENGINEERING AND TECHNOLOGY
ENGINEERING AND ...
and Electrical Engin ...
and Robotics
NATURAL SCIENCES
NATURAL SCIENCES
and Computer and Inf ...
and Computer Science ...
Articles in the publication
By the university
Royal Institute of Technology

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view