no code implementations • 15 Jul 2022 • Kyrill Schmid, Lenz Belzner, Robert Müller, Johannes Tochtermann, Claudia Linnhoff-Popien
Some of the most relevant future applications of multi-agent systems like autonomous driving or factories as a service display mixed-motive scenarios, where agents might have conflicting goals.
1 code implementation • NeurIPS 2021 • Thomy Phan, Fabian Ritz, Lenz Belzner, Philipp Altmann, Thomas Gabor, Claudia Linnhoff-Popien
We evaluate VAST in three multi-agent domains and show that VAST can significantly outperform state-of-the-art VFF, when the number of agents is sufficiently large.
1 code implementation • ALIFE 2021 • Fabian Ritz, Daniel Ratke, Thomy Phan, Lenz Belzner, Claudia Linnhoff-Popien
This paper considers sustainable and cooperative behavior in multi-agent systems.
Multi-agent Reinforcement Learning reinforcement-learning +1
no code implementations • 8 May 2020 • Lenz Belzner, Martin Wirsing
We propose to leverage epistemic uncertainty about constraint satisfaction of a reinforcement learner in safety critical domains.
no code implementations • 29 Apr 2020 • Thomas Gabor, Leo Sünkel, Fabian Ritz, Thomy Phan, Lenz Belzner, Christoph Roch, Sebastian Feld, Claudia Linnhoff-Popien
We discuss the synergetic connection between quantum computing and artificial intelligence.
no code implementations • 11 Apr 2020 • Sebastian Feld, Steffen Illium, Andreas Sedlmeier, Lenz Belzner
In the near future, more and more machines will perform tasks in the vicinity of human spaces or support them directly in their spatially bound activities.
no code implementations • 11 Apr 2020 • Sebastian Feld, Andreas Sedlmeier, Markus Friedrich, Jan Franz, Lenz Belzner
Agents of LBS, such as mobile robots or non-player characters in computer games, may use the context surprise to focus more on important regions of a map for a better use or understanding of the floor plan.
no code implementations • 31 Dec 2019 • Andreas Sedlmeier, Thomas Gabor, Thomy Phan, Lenz Belzner, Claudia Linnhoff-Popien
We further present a first viable solution for calculating a dynamic classification threshold, based on the uncertainty distribution of the training data.
1 code implementation • 10 May 2019 • Thomy Phan, Lenz Belzner, Marie Kiermeier, Markus Friedrich, Kyrill Schmid, Claudia Linnhoff-Popien
State-of-the-art approaches to partially observable planning like POMCP are based on stochastic tree search.
no code implementations • 10 May 2019 • Carsten Hahn, Thomy Phan, Thomas Gabor, Lenz Belzner, Claudia Linnhoff-Popien
In nature, flocking or swarm behavior is observed in many species as it has beneficial properties like reducing the probability of being caught by a predator.
Multi-agent Reinforcement Learning reinforcement-learning +1
no code implementations • 25 Jan 2019 • Thomy Phan, Kyrill Schmid, Lenz Belzner, Thomas Gabor, Sebastian Feld, Claudia Linnhoff-Popien
We experimentally evaluate STEP in two challenging and stochastic domains with large state and joint action spaces and show that STEP is able to learn stronger policies than standard multi-agent reinforcement learning algorithms, when combining multi-agent open-loop planning with centralized function approximation.
no code implementations • 8 Jan 2019 • Andreas Sedlmeier, Thomas Gabor, Thomy Phan, Lenz Belzner, Claudia Linnhoff-Popien
Although prior work has shown that dropout-based variational inference techniques and bootstrap-based approaches can be used to model epistemic uncertainty, the suitability for detecting OOD samples in deep reinforcement learning remains an open question.
no code implementations • 30 Oct 2018 • Thomas Gabor, Lenz Belzner, Claudia Linnhoff-Popien
Diversity is an important factor in evolutionary algorithms to prevent premature convergence towards a single local optimum.
no code implementations • 30 Oct 2018 • Thomas Gabor, Lenz Belzner, Thomy Phan, Kyrill Schmid
As automatic optimization techniques find their way into industrial applications, the behavior of many complex systems is determined by some form of planner picking the right actions to optimize a given objective function.
no code implementations • 27 Apr 2017 • Thomas Gabor, Lenz Belzner
The evolutionary edit distance between two individuals in a population, i. e., the amount of applications of any genetic operator it would take the evolutionary process to generate one individual starting from the other, seems like a promising estimate for the diversity between said individuals.
no code implementations • 7 Mar 2017 • Andre Ebert, Michael Till Beck, Andy Mattausch, Lenz Belzner, Claudia Linnhoff Popien
Smartphone applications designed to track human motion in combination with wearable sensors, e. g., during physical exercising, raised huge attention recently.
1 code implementation • 28 Feb 2017 • Lenz Belzner, Thomas Gabor
We propose such a definition of subjective satisfaction based on recently introduced satisfaction functions.
1 code implementation • 28 Feb 2017 • Lenz Belzner, Thomas Gabor
We introduce Stacked Thompson Bandits (STB) for efficiently generating plans that are likely to satisfy a given bounded temporal logic requirement.
no code implementations • 28 Feb 2017 • Lenz Belzner, Thomas Gabor
Motivated by runtime verification of QoS requirements in self-adaptive and self-organizing systems that are able to reconfigure their structure and behavior in response to runtime data, we propose a QoS-aware variant of Thompson sampling for multi-armed bandits.
no code implementations • 25 Feb 2017 • Lenz Belzner
This paper proposes Monte Carlo Action Programming, a programming language framework for autonomous systems that act in large probabilistic state spaces with high branching factors.