Thomas Wiedemann 0002

dblp:181/3914 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
4since 2021 · last 2025
0000-0002-1740-8841ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Systems, architecture and hardware · 2 · 1 since 2021Computer networks · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Databases, data management, data science and information retrieval · 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
3 papers
Robot navigation and mapping · 80% Reinforcement learning · 16% Motion planning and robot control · 4%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › source localization
odor source localization
0.912025
Deep Learning Based Topography Aware Gas Source Localization with Mobile Robot · ICRA 2025
Robotics › Robot navigation and mapping
SLAM
0.912025
Deep Learning Based Topography Aware Gas Source Localization with Mobile Robot · ICRA 2025
Robotics › Robot navigation and mapping › multi-robot navigation
swarm navigation
0.412020
Self-Aware Swarm Navigation in Autonomous Exploration Missions · Proc. IEEE 2020
Machine learning › Reinforcement learning › exploration › multi-robot exploration
decentralized exploration
0.212016
Decentralized multi-agent exploration with online-learning of Gaussian processes · ICRA 2016
Machine learning › Reinforcement learning › multi-agent reinforcement learning
multi-agent exploration
0.212016
Decentralized multi-agent exploration with online-learning of Gaussian processes · ICRA 2016
Robotics › Robot navigation and mapping › localization › multi-robot localization
cooperative localization
0.112020
Self-Aware Swarm Navigation in Autonomous Exploration Missions · Proc. IEEE 2020
Robotics › Robot navigation and mapping
localization
0.112020
Self-Aware Swarm Navigation in Autonomous Exploration Missions · Proc. IEEE 2020
Robotics › Robot navigation and mapping › robot mapping › uncertainty-aware mapping
gaussian process mapping
0.112016
Decentralized multi-agent exploration with online-learning of Gaussian processes · ICRA 2016

Methods — techniques the papers use, named apart from their topics

u-net · 0.9deep learning · 0.9fisher information · 0.4cramér-rao bound · 0.4bayesian information · 0.4online learning · 0.2gaussian process · 0.2
YearPublicationVenuePosition
2025 Deep Learning Based Topography Aware Gas Source Localization with Mobile Robot
abstract
Gas source localization in complex environments is critical for applications such as environmental monitoring, industrial safety, and disaster response. Traditional methods often struggle with the challenges posed by a lack of environmental topography integration, especially when interactions between wind and obstacles distort gas dispersion patterns. In this paper, we propose a deep learning-based approach, which leverages spatial context and environmental mapping to enhance gas source localization. By integrating Simultaneous Localization and Mapping (SLAM) with a U-Net-based model, our method predicts the likelihood of gas source locations by analyzing gas sensor data, wind flow, and topography of the environment represented by a 2D occupancy map. We demonstrate the efficacy of our approach using a wheeled robot equipped with a photoionization detector, a LIDAR, and an anemometer, in various scenarios with dynamic wind fields and multiple obstacles. The results show that our approach can robustly locate gas sources, even in challenging environments with fluctuating wind directions, outperforming conventional methods by utilizing topography contextual information. This study underscores the importance of topographical context in gas source localization and offers a flexible and robust solution for real-world applications. Data and code are publicly available.
Changhao Tian, Annan Wang, Han Fan, Thomas Wiedemann 0002, Le Yang 0007, Weisi Lin, Achim J. Lilienthal
ICRA4
2025 CoVOR-SLAM: Cooperative SLAM Using Visual Odometry and Ranges for Multi-Robot Systems
abstract
A swarm of robots offers significant advantages over a single robot, enabling faster exploration of larger areas and enhanced robustness against single-point failures. Accurate relative positioning is critical for executing collaborative missions without collisions. When Visual Simultaneous Localization and Mapping (VSLAM) is employed to estimate each robot’s poses, the inter-agent loop closing method is commonly used to improve relative positioning accuracy by refining pose estimates and merging local maps based on shared feature points. However, this approach demands considerable computational and communication resources. In this paper, we introduceCollaborativeSLAMusingVisualOdometry andRanges (CoVOR-SLAM) to address these challenges. CoVOR-SLAM significantly reduces both the amount of data transmitted between robots and their computational loads, as it requires only pose estimates, covariances, and range measurements instead of feature or map points for inter-agent loop detection. The necessary range measurements can be derived from pilot signals within the communication system, eliminating the need for complex additional infrastructure. We evaluated CoVOR-SLAM using real images and ultra-wideband range data collected from two rovers, as well as in a larger multi-agent setup utilizing public image datasets and realistic simulations. The results demonstrate that CoVOR-SLAM accurately estimates robot poses while requiring considerably less computational power and communication capacity than inter-agent loop closing techniques.
Young-Hee Lee, Chen Zhu 0002, Thomas Wiedemann 0002, Emanuel Staudinger, Christoph Günther 0001
IEEE Trans. Intell. Transp. Syst.3
2025 Mobile-to-Mobile Uncorrelated Scatter Channels
abstract
In this paper, we present a complete analytic probability based description of mobile-to-mobile uncorrelated scatter channels. We provide a theoretical proof that the proposed probability based description is equivalent to the correlation based description introduced by Bello and Matz. This equivalence is evaluated through a comparison of the hybrid characteristic probability density function with the correlation based description of a measured generic mobile-to-mobile channel, both of which can be obtained directly either from theory or from measurement data. The comparison confirms the similarity between the probability based and correlation based description qualitatively and quantitatively. Thus, the proposed probabilistic description complements the common correlation based description providing a comprehensive theoretical description of arbitrary uncorrelated scatter channels.
Michael Walter 0002, Martin Schmidhammer, Miguel A. Bellido-Manganell, Thomas Wiedemann 0002, Dmitriy Shutin
IEEE Trans. Wirel. Commun.4
2024 Self-Organized Sensor Eggs for Decentralized Localization and Sensing on Vulcano Island - A Glimpse into Future Space Exploration with Swarms
abstract
Robotic swarms or portable sensor networks are emerging technologies for sensing physical processes that are spatially distributed- and temporally dynamic, both on Earth and in future Moon/Mars exploration missions. We develop a portable network composed of a multitude of self-organized “sensor eggs”. These eggs are equipped with ultra-wideband (UWB) transceivers, providing precise time and position information without additional infrastructures like Global Navigation Satellite Systems (GNSSs). Each egg is additionally equipped with environmental sensors, for example, a Sulfur dioxide gas sensor to explore volcanic activity. We use a real time decentralized particle filter (DPF) to estimate the a-posteriori probability density functions (PDFs) of the egg positions. These PDFs are then used in a static state binary Bayes filter for estimating the gas sources with potentially complex structures such as cracks on the volcano surface. The proposed sensor network is verified with an in-field experiment at La Fossa volcano on the island of Vulcano, Italy, in 2023.
Fabio Broghammer, Thomas Wiedemann 0002, Armin Dammann, Christian Gentner, Petar M. Djuric
FUSION2
2020 Self-Aware Swarm Navigation in Autonomous Exploration Missions
abstract
A multitude of autonomous robotic platforms collectively organized as a swarm attracts increasing attention for remote sensing and exploration tasks. A navigation system is essential for the swarm to collectively localize itself as well as external sources. In this article, we propose a self-aware swarm navigation system that is conscious of the causality between its position and the localization uncertainty. This knowledge allows the swarm to move in a way to not only account for external mission objectives but also enhance position information. Position information for classical navigation systems has already been studied with the Fisher information (FI) and Bayesian information (BI) theories. We show how to extend these theories to a self-aware swarm navigation system, particularly emphasizing the collective performance. In this respect, fundamental limits and geometric interpretations of localization with generic observation models are discussed. We further propose a general concept of FI and BI based information seeking swarm control. The weighted position Cramér-Rao bound (CRB) and posterior CRB (PCRB) are employed flexibly as either a control cost function or constraints according to different mission criteria. As a result, the swarm actively adapts its position to enrich position information with different emerging collective behaviors. The proposed concept is illustrated by a case study of a swarm mission for gas exploration on Mars.
Robert Pöhlmann, Thomas Wiedemann 0002, Armin Dammann, Henk Wymeersch, Peter A. Hoeher
Proc. IEEE3
2019 Analysis of Non-Stationary 3D Air-to-Air Channels Using the Theory of Algebraic Curves
abstract
Non-stationary channel models play a crucial role in today's communication systems. Mobile-to-mobile channels are known to exhibit non-stationary behavior caused by the movement of transmitter and receiver. Non-stationarity can be addressed by introducing time-variant stochastic functions such as the time-variant instantaneous Doppler probability density function or time-variant instantaneous characteristic function. An algebraic analysis of the time-variant Doppler probability density function (pdf) in a classical Cartesian coordinate system is only numerically tractable due to trigonometric functions in the resulting expressions. In contrast, it has been shown that by using prolate spheroidal coordinates for 2D vehicle-to-vehicle channels the algebraic analysis becomes analytically tractable. In this paper, the analysis is extended to air-to-air channels. It is shown that the time-variant Doppler pdf can be represented without trigonometric functions. The description of the Doppler frequency in prolate spheroidal coordinates allows describing it as an algebraic curve. This permits the use of algebraic methods to analyze the Doppler frequency and derive the boundaries of the resulting Doppler pdf. Using the developed tools, we have investigated exemplary air-to-air scenarios. However, the methodology can be extended to any air-to-air configuration.
Michael Walter 0002, Dmitriy Shutin, David W. Matolak, Nicolas Schneckenburger, Thomas Wiedemann 0002, Armin Dammann
IEEE Trans. Wirel. Commun.5
2018 Multi-agent exploration of spatial dynamical processes under sparsity constraints
Thomas Wiedemann 0002, Christoph Manss, Dmitriy Shutin
Auton. Agents Multi Agent Syst.1
2016 Decentralized multi-agent exploration with online-learning of Gaussian processes
abstract
Exploration 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
ICRA2