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

Martin Soika

dblp:90/4623 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2003
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-authorSystems, architecture and hardware · 3 · 2 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
2 papers
Robot navigation and mapping · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping
SLAM
0.012003
An atlas framework for scalable mapping · ICRA 2003
Robotics › Robot navigation and mapping › robot mapping
topological mapping
0.012003
An atlas framework for scalable mapping · ICRA 2003
Robotics › Robot navigation and mapping › SLAM
graph-based SLAM
0.012003
An atlas framework for scalable mapping · ICRA 2003

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

map matching · 0.0dijkstra's shortest path · 0.0consistency measure · 0.0
YearPublicationVenuePosition
2003 An atlas framework for scalable mapping
abstract
This paper describes Atlas, a hybrid metrical/topological approach to SLAM that achieves efficient mapping of large-scale environments. The representation is a graph of coordinate frames, with each vertex in the graph representing a local frame, and each edge representing the transformation between adjacent frames. In each frame, we build a map that captures the local environment and the current robot pose along with the uncertainties of each. Each map's uncertainties are modeled with respect to its own frame. Probabilities of entities with respect to arbitrary frames are generated by following a path formed by the edges between adjacent frames, computed via Dijkstra's shortest path algorithm. Loop closing is achieved via an efficient map matching algorithm. We demonstrate the technique running in real-time in a large indoor structured environment (2.2 km path length) with multiple nested loops using laser or ultrasonic ranging sensors.
Michael Bosse, Paul Newman 0001, John J. Leonard, Martin Soika, Wendelin Feiten, Seth J. Teller
ICRA4
1997 Grid based fault detection and calibration of sensors on mobile robots
abstract
This paper presents a concept for fault detection and calibration of external sensors on mobile robots, based on a grid representation of the environment. For every grid cell consistency measures are derived by evaluating the information stored in them. The measures are then used to deliberate about the condition of the involved sensors. Thereby a mobile robot is equipped with the capability of detecting faulty sensors during its operation. The approach is suitable for unknown environments and is flexible in terms of failure and sensor types. Furthermore, it allows sensor calibration in unknown environments without any reference objects. The approach was verified by several experiments with the autonomous mobile robot ROAMER using ultrasonic sensors.
Martin Soika
ICRA1
1997 A sensor failure detection framework for autonomous mobile robots
abstract
This paper presents a failure detection framework for external sensors on autonomous mobile robots. Each sensor's measurements make statements about the robot's environment. Whereas correctly functioning sensors' statements are consistent, the readings of faulty sensors will lead to inconsistencies within the robot's model of the environment. A probabilistic formulation of both the sensor model and the statements about the environment allows for a quantitative examination of these inconsistencies. The obtained consistency measure describes how well a statement, corresponding to a reading of a single sensor matches with the statements generated by the measurements of all other sensors. By combining a sensor's consistency measures over several statements, the robot is able to deliberate about the condition of this sensor. The approach provides a mechanism, which is suitable for any unknown environment and is flexible in terms of failure and sensor types. It was verified by several experiments with the autonomous mobile robot ROAMER, using sonar readings integrated into a probabilistic occupancy grid representation.
Martin Soika
IROS1