Demo Data from EDBT 2026 / reviewers in the wild / expert
Kevin Daun
dblp:162/3962
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 since 2021Systems, architecture and hardware · 2 · 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 |
Multi-agent systems · 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 › assembly
object assembly |
0.3 | 1 | 2018 | Learning Robust Policies for Object Manipulation with Robot Swarms · ICRA 2018 |
Machine learning › Reinforcement learning
policy search |
0.3 | 1 | 2018 | Learning Robust Policies for Object Manipulation with Robot Swarms · ICRA 2018 |
Knowledge, reasoning and agents › Multi-agent systems
swarm robotics |
0.3 | 1 | 2018 | Learning Robust Policies for Object Manipulation with Robot Swarms · ICRA 2018 |
Methods — techniques the papers use, named apart from their topics
simulation-to-real transfer · 0.3policy search · 0.3hilbert space embeddings of distributions · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Efficient Dynamic LiDAR Odometry for Mobile Robots with Structured Point CloudsabstractWe propose a real-time dynamic LiDAR odometry pipeline for mobile robots in Urban Search and Rescue (USAR) scenarios. Existing approaches to dynamic object detection often rely on pretrained learned networks or computationally expensive volumetric maps. To enhance efficiency on computationally limited robots, we reuse data between the odometry and detection module. Utilizing a range image segmentation technique and a novel residual-based heuristic, our method distinguishes dynamic from static objects before integrating them into the point cloud map. The approach demonstrates robust object tracking and improved map accuracy in environments with numerous dynamic objects. Even highly non-rigid objects, such as running humans, are accurately detected at point level without prior downsampling of the point cloud and hence, without loss of information. Evaluation on simulated and real-world data validates its computational efficiency. Compared to a stateof-the-art volumetric method, our approach shows comparable detection performance at a fraction of the processing time, adding only 14 ms to the odometry module for dynamic object detection and tracking. The implementation and a new realworld dataset are available as open-source for further research. Jonathan Lichtenfeld, Kevin Daun, Oskar von Stryk |
IROS | 2 |
| 2018 | Learning Robust Policies for Object Manipulation with Robot SwarmsabstractSwarm robotics investigates how a large population of robots with simple actuation and limited sensors can collectively solve complex tasks. One particular interesting application with robot swarms is autonomous object assembly. Such tasks have been solved successfully with robot swarms that are controlled by a human operator using a light source. In this paper, we present a method to solve such assembly tasks autonomously based on policy search methods. We split the assembly process in two subtasks: generating a high-level assembly plan and learning a low-level object movement policy. The assembly policy plans the trajectories for each object and the object movement policy controls the trajectory execution. Learning the object movement policy is challenging as it depends on the complex state of the swarm which consists of an individual state for each agent. To approach this problem, we introduce a representation of the swarm which is based on Hilbert space embeddings of distributions. This representation is invariant to the number of agents in the swarm as well as to the allocation of an agent to its position in the swarm. These invariances make the learned policy robust to changes in the swarm and also reduce the search space for the policy search method significantly. We show that the resulting system is able to solve assembly tasks with varying object shapes in multiple simulation scenarios and evaluate the robustness of our representation to changes in the swarm size. Furthermore, we demonstrate that the policies learned in simulation are robust enough to be transferred to real robots. Gregor H. W. Gebhardt, Kevin Daun, Marius Schnaubelt, Gerhard Neumann |
ICRA | 2 |
| 2014 | Towards Highly Reliable Autonomy for Urban Search and Rescue Robots
Stefan Kohlbrecher, Florian Kunz, Dorothea Koert, Christian Rose, Paul Manns, Kevin Daun, Johannes Schubert, Alexander Stumpf, Oskar von Stryk |
RoboCup | 6 |