Integrating global position estimation and position tracking for mobile robots: the dynamic Markov localization approach

@article{Burgard1998IntegratingGP,
  title={Integrating global position estimation and position tracking for mobile robots: the dynamic Markov localization approach},
  author={Wolfram Burgard and Andrcas Derr and Dieter Fox and Armin B. Cremers},
  journal={Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190)},
  year={1998},
  volume={2},
  pages={730-735 vol.2}
}
  • W. Burgard, Andrcas Derr, A. Cremers
  • Published 13 October 1998
  • Computer Science
  • Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190)
Localization is one of the fundamental problems of mobile robots. In order to efficiently perform useful tasks such as office delivery, mobile robots must know their position in their environment. Existing approaches can be distinguished according to the type of localization problem they are designed to solve. Tracking techniques aim at monitoring the robot's position. They assume that the position is initially known and cannot recover from situations in which they lost track of the robot's… 

Figures from this paper

Markov Localization for Reliable Robot Navigation and People Detection

TLDR
This paper presents Markov localization as a technique for estimating the position of a mobile robot based on a fine-grained, metric discretization of the state space, which is able to incorporate raw sensor readings and does not require predefined landmarks.

Markov Localization for Mobile Robots in Dynamic Environments

TLDR
A version of Markov localization which provides accurate position estimates and which is tailored towards dynamic environments, and includes a filtering technique which allows a mobile robot to reliably estimate its position even in densely populated environments in which crowds of people block the robot's sensors for extended periods of time.

Mobile Robot Global Localization using Imperialist Competitive Algorithm

TLDR
This paper proposes a method using an evolutionary algorithm for mobile robots' global localization using Imperialist Competitive Algorithm (ICA) to achieve the goal and shows that the algorithm works very accurate in all of the positions that the authors located the robot for their tests with acceptable number of iterations.

Probabilistic state estimation of dynamic objects with a moving mobile robot

Monte Carlo localization for mobile robots

TLDR
The Monte Carlo localization method is introduced, where the probability density is represented by maintaining a set of samples that are randomly drawn from it, and it is shown that the resulting method is able to efficiently localize a mobile robot without knowledge of its starting location.

Mobile robot global localization using differential evolution and particle swarm optimization

TLDR
Two recent sample-based evolutionary methods for globally localizing the position of a mobile robot are proposed, a modified version of genetic algorithm called Differential Evolution (DE) and Particle Swarm Optimization (PSO) which is based on bird flocking.

Probabilistic self-localization for mobile robots

  • C. Olson
  • Computer Science
    IEEE Trans. Robotics Autom.
  • 2000
TLDR
Probabilistic self-localization techniques for mobile robots that are based on the principle of maximum-likelihood estimation are described, which performs an efficient global search of the pose space that guarantees that the best position is found according to the probabilistic map agreement measure in a discretized pose space.

Using the CONDENSATION algorithm for robust, vision-based mobile robot localization

TLDR
This paper presents a novel, vision-based localization method based on the CONDENSATION algorithm, a Bayesian filtering method that uses a sampling-based density representation to track the position of the camera platform rather than tracking an object in the scene.

Robot localization in symmetric environment

TLDR
This work presents an extension to the MCL algorithm when localizing in highly symmetrical environments; a situation where MCL is often unable to correctly track equally probable poses for the robot.

Autonomous mobile robot localization in large-scale environments using only a camera

TLDR
A single camera is used for use in multiple types of large-scale environments: indoors, outdoors, and in polar camp sites in Greenland and Antarctica, using an appearance-based approach for recognizing the different locations of the camp sites.
...

References

SHOWING 1-10 OF 42 REFERENCES

Estimating the Absolute Position of a Mobile Robot Using Position Probability Grids

TLDR
The position probability grid approach to estimating the robot's absolute position and orientation in a metric model of the environment is described, designed to work with standard sensors and is independent of any knowledge about the starting point.

Fast Grid-Based Position TRacking for Mobile Robots

TLDR
An application of position probability grids to position tracking and, in contrast to many other approaches, is not restricted to a fixed set of predefined features such as doors, openings or corridor junction types.

Position Estimation for Mobile Robots in Dynamic Environments

TLDR
Extensions to Markov localization algorithms enabling them to localize mobile robots even in densely populated environments are proposed and implemented, demonstrating that this approach is able to accurately estimate the robot's position in more than 98% of the cases even in such highly dynamic environments.

Probabilistic Robot Navigation in Partially Observable Environments

TLDR
First results are reported on first results of a research program that uses par tially observable Markov models to robustly track a robots location in office environments and to direct its goal-oriented actions.

Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans

  • F. LuE. Milios
  • Computer Science
    1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition
  • 1994
TLDR
Two new iterative algorithms to register a range scan to a previous scan so as to compute relative robot positions in an unknown environment, that avoid the above problems.

AMOS: comparison of scan matching approaches for self-localization in indoor environments

  • J.-S. GutmannC. Schlegel
  • Computer Science
    Proceedings of the First Euromicro Workshop on Advanced Mobile Robots (EUROBOT '96)
  • 1996
TLDR
This paper describes results from evaluating different self-localization approaches in indoor environments for mobile robots based on 2D laser scans and an odometry position estimate and shows that the position error can be kept small enough to perform navigation tasks.

Hybrid, high-precision localisation for the mail distributing mobile robot system MOPS

  • K. ArrasS. J. Vestli
  • Computer Science
    Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146)
  • 1998
TLDR
The new localisation algorithms under implementation for the mail distributing mobile robot, MOPS, of the Institute of Robotics, Swiss Federal Institute of Technology Zurich, employ consistent probabilistic feature extraction, clustering, matching and estimation of the vehicle position and orientation.

A comparison of position estimation techniques using occupancy grids

  • B. SchieleJ. Crowley
  • Engineering
    Proceedings of the 1994 IEEE International Conference on Robotics and Automation
  • 1994
TLDR
Experimental results show that matching of segments extracted from the both the local and global occupancy grids gives results which are superior to a direct matching of grids, or to a mixed match of segments to grids.

Navigating Mobile Robots: Systems and Techniques

This is a survey of the state-of-the-art in sensors, systems, methods and technologies utilized by a mobile robot to determine its position in the environment. The many potential "solutions" are

Acting under uncertainty: discrete Bayesian models for mobile-robot navigation

TLDR
The optimal solution to the problem of how actions should be chosen is presented, formulated as a partially observable Markov decision process, which goes on to explore a variety of heuristic control strategies.