EDBT 2026 Demo / reviewers in the wild / expert
Joachim Müller 0003
dblp:14/2850-3
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1
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 |
Reinforcement learning · 87% Robot navigation and mapping · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › exploration › multi-robot exploration
decentralized exploration |
0.2 | 1 | 2016 | Decentralized multi-agent exploration with online-learning of Gaussian processes · ICRA 2016 |
Machine learning › Reinforcement learning › multi-agent reinforcement learning
multi-agent exploration |
0.2 | 1 | 2016 | Decentralized multi-agent exploration with online-learning of Gaussian processes · ICRA 2016 |
Robotics › Robot navigation and mapping › robot mapping › uncertainty-aware mapping
gaussian process mapping |
0.1 | 1 | 2016 | Decentralized multi-agent exploration with online-learning of Gaussian processes · ICRA 2016 |
Methods — techniques the papers use, named apart from their topics
online learning · 0.2gaussian process · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Decentralized multi-agent exploration with online-learning of Gaussian processesabstractExploration is a crucial problem in safety of life applications, such as search and rescue missions. Gaussian processes constitute an interesting underlying data model that leverages the spatial correlations of the process to be explored to reduce the required sampling of data. Furthermore, multi-agent approaches offer well known advantages for exploration. Previous decentralized multi-agent exploration algorithms that use Gaussian processes as underlying data model, have only been validated through simulations. However, the implementation of an exploration algorithm brings difficulties that were not tackle yet. In this work, we propose an exploration algorithm that deals with the following challenges: (i) which information to transmit to achieve multi-agent coordination; (ii) how to implement a light-weight collision avoidance; (iii) how to learn the data's model without prior information. We validate our algorithm with two experiments employing real robots. First, we explore the magnetic field intensity with a ground-based robot. Second, two quadcopters equipped with an ultrasound sensor explore a terrain profile. We show that our algorithm outperforms a meander and a random trajectory, as well as we are able to learn the data's model online while exploring. Alberto Viseras Ruiz, Thomas Wiedemann 0002, Christoph Manss, Lukas Magel, Joachim Müller 0003, Dmitriy Shutin, Luis Merino |
ICRA | 5 |