Demo Data from EDBT 2026 / reviewers in the wild / expert
Stefan Bonhof
dblp:344/4992
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0001-9385-7457ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Planning, search and constraint satisfaction · 33% Robot manipulation · 33% Reinforcement learning · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Robot manipulation
mobile manipulation |
0.7 | 1 | 2023 | Active Inference and Behavior Trees for Reactive Action Planning and Execution in Robotics · IEEE Trans. Robotics 2023 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
reactive planning |
0.7 | 1 | 2023 | Active Inference and Behavior Trees for Reactive Action Planning and Execution in Robotics · IEEE Trans. Robotics 2023 |
Machine learning › Reinforcement learning
runtime adaptation |
0.7 | 1 | 2023 | Active Inference and Behavior Trees for Reactive Action Planning and Execution in Robotics · IEEE Trans. Robotics 2023 |
Methods — techniques the papers use, named apart from their topics
free energy minimization · 0.7behavior trees · 0.7active inference · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Active Inference and Behavior Trees for Reactive Action Planning and Execution in RoboticsabstractIn this article, we propose a hybrid combination of active inference and behavior trees (BTs) for reactive action planning and execution in dynamic environments, showing how robotic tasks can be formulated as a free-energy minimization problem. The proposed approach allows handling partially observable initial states and improves the robustness of classical BTs against unexpected contingencies while at the same time reducing the number of nodes in a tree. In this work, we specify the nominal behavior offline, through BTs. However, in contrast to previous approaches, we introduce a new type of leaf node to specify the desired state to be achieved rather than an action to execute. The decision of which action to execute to reach the desired state is performed online through active inference. This results in continual online planning and hierarchical deliberation. By doing so, an agent can follow a predefined offline plan while still keeping the ability to locally adapt and take autonomous decisions at runtime, respecting safety constraints. We provide proof of convergence and robustness analysis, and we validate our method in two different mobile manipulators performing similar tasks, both in a simulated and real retail environment. The results showed improved runtime adaptability with a fraction of the hand-coded nodes compared to classical BTs. Corrado Pezzato, Carlos Hernández Corbato, Stefan Bonhof, Martijn Wisse |
IEEE Trans. Robotics | 3 |