Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kai M. Wurm

dblp:26/3325 · DBLP profile ↗
← Back
12ranked-venue papers
4as first author
0since 2021 · last 2019
—ORCID · none

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

Artificial intelligence and machine learning · 12 · 4 first-authorSystems, architecture and hardware · 12 · 4 first-author

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
6 papers
Motion planning and robot control · 50% Robot navigation and mapping · 20% 3D vision · 12%

Topics — the 18 heaviest of 20, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › motion planning
manipulation planning
0.722019
Modeling and Planning Manipulation in Dynamic Environments · ICRA 2019
Optimal, sampling-based manipulation planning · ICRA 2017
Robotics › Motion planning and robot control › robot control
constraint-based control
0.412019
Modeling and Planning Manipulation in Dynamic Environments · ICRA 2019
Robotics › Motion planning and robot control › motion planning
kinodynamic planning
0.412019
Modeling and Planning Manipulation in Dynamic Environments · ICRA 2019
Robotics › Motion planning and robot control
robot control
0.412019
Modeling and Planning Manipulation in Dynamic Environments · ICRA 2019
Robotics › Motion planning and robot control › motion planning › optimal motion planning
asymptotically optimal motion planning
0.312017
Optimal, sampling-based manipulation planning · ICRA 2017
Robotics › Motion planning and robot control › motion planning
sampling-based motion planning
0.312017
Optimal, sampling-based manipulation planning · ICRA 2017
Robotics › Robot navigation and mapping
SLAM
0.322012
Fully distributed scalable smoothing and mapping with robust multi-robot data association · ICRA 2012
Consistent mapping of multistory buildings by introducing global constraints to graph-based SLAM · ICRA 2010
Computer vision › 3D vision
3d reconstruction
0.212016
Probabilistic multi-sensor fusion based on signed distance functions · ICRA 2016
Robotics › Robot navigation and mapping
sensor fusion
0.212016
Probabilistic multi-sensor fusion based on signed distance functions · ICRA 2016
Computer vision › 3D vision › 3d reconstruction
surface reconstruction
0.212016
Probabilistic multi-sensor fusion based on signed distance functions · ICRA 2016
Machine learning › Trustworthy machine learning
uncertainty estimation
0.212016
Probabilistic multi-sensor fusion based on signed distance functions · ICRA 2016
Computer vision › Segmentation and scene understanding
scene graph generation
0.212014
Using rule-based context knowledge to model table-top scenes · ICRA 2014
Computer vision › Segmentation and scene understanding
scene understanding
0.212014
Using rule-based context knowledge to model table-top scenes · ICRA 2014
Robotics › Robot navigation and mapping › SLAM › multi-robot SLAM
distributed SLAM
0.112012
Fully distributed scalable smoothing and mapping with robust multi-robot data association · ICRA 2012
Robotics › Robot navigation and mapping › SLAM
multi-robot SLAM
0.112012
Fully distributed scalable smoothing and mapping with robust multi-robot data association · ICRA 2012
Robotics › Robot navigation and mapping › SLAM
graph-based SLAM
0.112010
Consistent mapping of multistory buildings by introducing global constraints to graph-based SLAM · ICRA 2010
Computer vision › 3D vision › 3d scene understanding
depth and scene understanding
0.112016
Probabilistic multi-sensor fusion based on signed distance functions · ICRA 2016
Computer vision › Video understanding and tracking › multi-object tracking
data association
0.012012
Fully distributed scalable smoothing and mapping with robust multi-robot data association · ICRA 2012

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

online collision avoidance · 0.4constraint-based controller synthesis · 0.4probabilistic roadmap · 0.3asymptotic optimality proof · 0.3truncated signed distance function · 0.2random variable surface modeling · 0.2GPU implementation · 0.2probabilistic sensor model · 0.2markov logic networks · 0.2MCMC · 0.2
YearPublicationVenuePosition
2019 Modeling and Planning Manipulation in Dynamic Environments
abstract
In this paper we propose a new model for sequential manipulation tasks that also considers robot dynamics and time-variant environments. From this model we automatically derive constraint-based controllers and use them as steering functions in a kinodynamic manipulation planner. The resulting plan is not a trajectory but a sequence of controllers that react online to disturbances. We validated our approach in simulation and on a real robot. In the experiments our approach plans and executes dual-robot manipulation tasks with online collision avoidance and reactions to estimates of object poses.
Philipp S. Schmitt, Florian Wirnshofer, Kai M. Wurm, Georg von Wichert, Wolfram Burgard
ICRA3
2019 Planning Reactive Manipulation in Dynamic Environments
abstract
When robots perform manipulation tasks, they need to determine their own movement, as well as how to make and break contact with objects in their environment. Reasoning about the motions of robots and objects simultaneously leads to a constrained planning problem in a high-dimensional state-space. Additionally, when environments change dynamically motions must be computed in real-time. To this end, we propose a feedback planner for manipulation. We model manipulation as constrained motion and use this model to automatically derive a set of constraint-based controllers. These controllers are used in a switching-control scheme, where the active controller is chosen by a reinforcement learning agent. Our approach is capable of addressing tasks with second-order dynamics, closed kinematic chains, and time-variant environments. We validated our approach in simulation and on a real, dual-arm robot. Extensive simulation of three distinct robots and tasks show a significant increase in robustness compared to a previous approach.
Philipp S. Schmitt, Florian Wirnshofer, Kai M. Wurm, Georg von Wichert, Wolfram Burgard
IROS3
2017 Optimal, sampling-based manipulation planning
abstract
When robots perform manipulation tasks, they need to determine their own movement, as well as how to grasp and release an object. Reasoning about the motion of the robot and the object simultaneously leads to a multi-modal planning problem in a high-dimensional configuration space. In this paper we propose an asymptotically optimal manipulation planner. Our approach extends optimal sampling-based roadmap planners to efficiently explore the configuration space of the robot and the object. We prove probabilistic completeness and global, asymptotic optimality. Extensive simulations of a typical pick-and-place scenario show that our approach significantly outperforms a (nonoptimal) state-of-the-art approach. We implemented our planner on a real manipulator and were able to compute high quality solutions in less than a second.
Philipp S. Schmitt, Werner Neubauer, Wendelin Feiten, Kai M. Wurm, Georg von Wichert, Wolfram Burgard
ICRA4
2016 Probabilistic multi-sensor fusion based on signed distance functions
abstract
In this paper, we present an approach for the probabilistic fusion of 3D sensor measurements. Our fusion algorithm is based on truncated signed distance functions. It explicitly considers the measurement noise by modeling the surface using random variables. Furthermore, our proposed surface model provides an explicit estimation of the spatial uncertainty. The approach can be implemented on a GPU to achieve a high update performance and enable online updates of the model. The approach was evaluated in simulation and using real sensor data. In our experiments, we confirmed that it accurately estimates surfaces from noisy sensor data and that it provides a corresponding estimate of the uncertainty. We could also show that the approach is able to fuse measurements from sensors with different noise characteristics.
Vincent Dietrich, Dong Chen 0011, Kai M. Wurm, Georg von Wichert, Philipp Ennen
ICRA3
2014 Using rule-based context knowledge to model table-top scenes
abstract
In this paper, we propose a probabilistic method to generate abstract scene graphs for table-top scenes from 6D object pose estimates. We explicitly make use of task-specific context knowledge by encoding this knowledge as descriptive rules in Markov logic networks. Our approach to generate scene graphs is probabilistic: Uncertainty in the object poses is addressed by a probabilistic sensor model that is embedded in a data driven MCMC process. We apply Markov logic inference to reason about hidden objects and to detect false estimates of object poses. The effectiveness of our approach is demonstrated and evaluated in real world experiments.
Dong Chen 0011, Kai M. Wurm, Georg von Wichert
ICRA3
2012 Fully distributed scalable smoothing and mapping with robust multi-robot data association
abstract
In this paper we focus on the multi-robot perception problem, and present an experimentally validated end-to-end multi-robot mapping framework, enabling individual robots in a team to see beyond their individual sensor horizons. The inference part of our system is the DDF-SAM algorithm [1], which provides a decentralized communication and inference scheme, but did not address the crucial issue of data association. One key contribution is a novel, RANSAC-based, approach for performing the between-robot data associations and initialization of relative frames of reference. We demonstrate this system with both data collected from real robot experiments, as well as in a large scale simulated experiment demonstrating the scalability of the proposed approach.
Alexander Cunningham, Kai M. Wurm, Wolfram Burgard, Frank Dellaert
ICRA2
2011 Hierarchies of octrees for efficient 3D mapping
abstract
The on-chip fabrication and manipulation of microstructures are expected to be applied for single cell analysis system such as cell manipulation and measurement tools. In this paper, we previously present a methodology for fabricating and assembling microstructures inside a microfluidic channel. By the illumination of patterned UV-ray through the mask under a microscope, microstructures with arbitrary shape are made of the photo-crosslinkable resin inside microfluidic device. The microstructures are fabricated at the desired place inside microfluidic channel and manipulated by optical tweezers. Based on the technique which can manipulate multiple points simultaneously by high-speed scanning of a single laser with galvanometer mirror, a rotational microstructure made of a microgear and a rotation axis is assembled and rotated. We also report two methods of solution replacement inside microfluidic channel which reduces viscosity of solvent in order to improve manipulation performance. By adjusting the concentration of photo-crosslinkable resin and replacing solution components, the viscosity of solvent inside channel can be changed. The manipulation speed of the rotational microstructure increases when the viscosity of solvent decreases, because the viscosity resistance for the movement of microstructure is weaker inside lower viscosity solvent. We fabricate rotational microstructures inside lower viscosity solvent and evaluate the movement efficiency compared with microstructures inside former high viscosity solvent.
Kai M. Wurm, Daniel Hennes, Dirk Holz, Radu Bogdan Rusu, Cyrill Stachniss, Kurt Konolige, Wolfram Burgard
IROS1
2010 Consistent mapping of multistory buildings by introducing global constraints to graph-based SLAM
abstract
In the past, there has been a tremendous advance in the area of simultaneous localization and mapping (SLAM). However, there are relatively few approaches for incorporating prior information or knowledge about structural similarities into the mapping process. Consider, for example, office buildings in which most of the offices have an identical geometric layout. The same typically holds for the individual stories of buildings. In this paper, we propose an approach for generating alignment constraints between different floors of the same building in the context of graph-based SLAM. This is done under the assumption that the individual floors of a building share at least some structural properties. To identify such areas, we apply a particle filter-based localization approach using maps and observations from different floors. We evaluate our system using several real datasets as well as in simulation. The results demonstrate that our approach is able to correctly align multiple floors and allows the robot to generate consistent models of multi-story buildings.
Michael Karg, Kai M. Wurm, Cyrill Stachniss, Klaus Dietmayer, Wolfram Burgard
ICRA2
2010 Humanoid robot localization in complex indoor environments
abstract
In this paper, we present a localization method for humanoid robots navigating in arbitrary complex indoor environments using only onboard sensing. Reliable and accurate localization for humanoid robots operating in such environments is a challenging task. First, humanoids typically execute motion commands rather inaccurately and odometry can be estimated only very roughly. Second, the observations of the small and lightweight sensors of most humanoids are seriously affected by noise. Third, since most humanoids walk with a swaying motion and can freely move in the environment, e.g., they are not forced to walk on flat ground only, a 6D torso pose has to be estimated. We apply Monte Carlo localization to globally determine and track a humanoid's 6D pose in a 3D world model, which may contain multiple levels connected by staircases. To achieve a robust localization while walking and climbing stairs, we intergrate 2D laser range measurements as well as attitude data and information from the joint encoders. We present simulated as well as real-word experiments with our humanoid and thoroughly evaluate our approach. As the experiments illustrate, the robot is able to globally localize itself and accurately track its 6D pose over time.
Armin Hornung, Kai M. Wurm, Maren Bennewitz
IROS2
2010 Coordinated exploration with marsupial teams of robots using temporal symbolic planning
abstract
The problem of autonomously exploring an environment with a team of robots received considerable attention in the past. However, there are relatively few approaches to coordinate teams of robots that are able to deploy and retrieve other robots. Efficiently coordinating the exploration with such marsupial robots requires advanced planning mechanisms that are able to consider symbolic deployment and retrieval actions. In this paper, we propose a novel approach for coordinating the exploration with marsupial robot teams. Our method integrates a temporal symbolic planner that explicitly considers deployment and retrieval actions with a traditional cost-based assignment procedure. Our approach has been implemented and evaluated in several simulated environments and with varying team sizes. The results demonstrate that our proposed method is able to coordinate marsupial teams of robots to efficiently explore unknown environments.
Kai M. Wurm, Christian Dornhege, Patrick Eyerich, Cyrill Stachniss, Bernhard Nebel, Wolfram Burgard
IROS1
2009 Improving robot navigation in structured outdoor environments by identifying vegetation from laser data
abstract
This paper addresses the problem of vegetation detection from laser measurements. The ability to detect vegetation is important for robots operating outdoors, since it enables a robot to navigate more efficiently and safely in such environments. In this paper, we propose a novel approach for detecting low, grass-like vegetation using laser remission values. In our algorithm, the laser remission is modeled as a function of distance, incidence angle, and material. We classify surface terrain based on 3D scans of the surroundings of the robot. The model is learned in a self-supervised way using vibration-based terrain classification. In all real world experiments we carried out, our approach yields a classification accuracy of over 99%. We furthermore illustrate how the learned classifier can improve the autonomous navigation capabilities of mobile robots.
Kai M. Wurm, Rainer Kümmerle, Cyrill Stachniss, Wolfram Burgard
IROS1
2008 Coordinated multi-robot exploration using a segmentation of the environment
abstract
This paper addresses the problem of exploring an unknown environment with a team of mobile robots. The key issue in coordinated multi-robot exploration is how to assign target locations to the individual robots such that the overall mission time is minimized. In this paper, we propose a novel approach to distribute the robots over the environment that takes into account the structure of the environment. To achieve this, it partitions the space into segments, for example, corresponding to individual rooms. Instead of only considering frontiers between unknown and explored areas as target locations, we send the robots to the individual segments with the task to explore the corresponding area. Our approach has been implemented and tested in simulation as well as in real world experiments. The experiments demonstrate that the overall exploration time can be significantly reduced by considering our segmentation method.
Kai M. Wurm, Cyrill Stachniss, Wolfram Burgard
IROS1