Petter Ögren

Petter Ögren

Auto-generated profile, based on publicly available information

Petter Ögren

KTH Royal Institute of Technology

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 April 2022 in Robotics and Autonomous Systems
Verified
Journal Article
Open access
MIMatteo Iovino
Matteo Iovino
ESEdvards Scukins
Edvards Scukins
JSJonathan Styrud
Jonathan Styrud
PÖPetter Ögren
Petter Ögren
CSChristian Smith
Christian Smith

21 July 2020 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
POPetter Ogren
Petter Ogren
A robot control system is often composed of a set of low level continuous controllers and a switching policy that decides which of those continuous controllers to apply at each time instant. The switching policy can be either a Finite State Machine (FSM), or a Behavior Tree (BT). In previous work we have shown how to create BTs using a backward chained approach that results in a reactive goal directed policy. This policy can be thought of as providing disturbance rejection at the task level in the sense that if a disturbance changes the state in such a way that the currently running continuous controller cannot handle it, the policy will switch to the appropriate continuous controller. In this paper we show how to provide convergence guarantees for such policies.

10 December 2021 in IEEE Control Systems Letters
Verified
Journal Article
Open access
CSChristopher Iliffe Sprague
Christopher Iliffe Sprague
POPetter Ogren
Petter Ogren
Behavior trees represent a hierarchical and modular way of combining several low-level control policies into a high-level task-switching policy. Hybrid dynamical systems can also be seen in terms of task switching between different policies, and therefore several comparisons between behavior trees and hybrid dynamical systems have been made, but only informally, and only in discrete time. A formal continuous-time formulation of behavior trees has been lacking. Additionally, convergence analyses of specific classes of behavior tree designs have been made, but not for general designs. In this letter, we provide the first continuous-time formulation of behavior trees, show that they can be seen as discontinuous dynamical systems (a subclass of hybrid dynamical systems), which enables the application of existence and uniqueness results to behavior trees, and finally, provide sufficient conditions under which such systems will converge to a desired region of the state space for general designs. With these results, a large body of results on continuous-time dynamical systems can be brought to use when designing behavior tree controllers.

19 June 2005
Verified
Conference Paper
Closed access
POPetter Ogren
Petter Ogren
MWMaja Winstrand
Maja Winstrand

27 November 2013 in Autonomous Robots
Verified
Journal Article
Closed access
PDF file
PÖPetter Ögren
Petter Ögren
PSPeter Svenmarck
Peter Svenmarck
PLPatrik Lif
Patrik Lif
MNMartin Norberg
Martin Norberg
NSNils Emil Söderbäck
Nils Emil Söderbäck