Probabilistic robotics

@article{Thrun2002ProbabilisticR,
  title={Probabilistic robotics},
  author={Sebastian Thrun},
  journal={Commun. ACM},
  year={2002},
  volume={45},
  pages={52-57}
}
  • S. Thrun
  • Published 2002
  • Computer Science
  • Commun. ACM
Planning and navigation algorithms exploit statistics gleaned from uncertain, imperfect real-world environments to guide robots toward their goals and around obstacles. 

Figures from this paper

Learning to Make Safe Real-Time Decisions Under Uncertainty for Autonomous Robots
TLDR
The next generation of autonomous robots will go beyond controlled environments in laboratories and factories, to act autonomously in real-world workplaces and public spaces, according to a report from 451 Research.
Exploration in information distribution maps
Presentado al Robotics: Science and Systems: Workshop on Robotic Exploration, Monitoring, and Information Collection celebrado en Berlin del 24 al 28 de junio de 2013.
Enhancing geometric maps through environmental interactions
The deployment of rescue robots in real operations is becoming increasingly commonthanks to recent advances in AI technologies and high performance hardware. Rescue robots can now operate for exten
Exploration and mapping with autonomous robot teams
The MAGIC 2010 robot competition showed how well multi-robot teams can work with human teams in urban search.
Exploiting Locality in SLAM by Nested Dissection
Presented at the 2006 Robotics: Science and Systems Conference II (RSS), 16-19 August 2006, Philadelphia, PA.
Using a Physics Engine to Improve Probabilistic Object Localization
TLDR
Each robot that is meant to handle objects must identify and localize the designated objects prior to any manipulation attempt, assuming full mutual probabilistic independence between them.
Exploiting domain knowledge in planning for uncertain robot systems modeled as POMDPs
We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as partially observable Markov decision
A Comparison of Motion Priors for EKF-SLAM in Autonomous Race Cars
Simultaneous Localization and Mapping (SLAM) is one of the fundamental problems to solve for any autonomous vehicle or robot. The SLAM problem is for an agent to incrementally build a map of its su
Probabilistic Localization and Mapping for Mobile Robots
TLDR
It is essential to combine several sensors to reduce the errors and also compensate for the shortcomings of individual sensors by means of multi-sensor fusion and simultaneous localization and mapping (SLAM).
Cooperative anchoring : sharing information about objects in multi-robot systems
In order to perform most tasks, robots must perceive or interact with physicalobjects in their environment; often, they must also communicate and reasonabout objects and their properties. Informati
...
...

References

SHOWING 1-10 OF 23 REFERENCES
Towards terrain-aided navigation for underwater robotics
TLDR
Development of low-speed platform models for vehicle control and the theoretical and practical details of mapping and position estimation using sonar are provided and an implementation of these techniques on a small submersible vehicle 'Oberon'.
Coastal Navigation with Mobile Robots
TLDR
This paper explicitly models the uncertainty of the robot's position as a state variable, and generates trajectories through the augmented pose-uncertainty space, and demonstrates experimentally that coastal navigation reduces the uncertainty at the goal, especially with degraded localization.
Coordination for Multi-Robot Exploration and Mapping
This paper addresses the problem of exploration and mapping of an unknown environment by multiple robots. The mapping algorithm is an on-line approach to likelihood maximization that uses hill
Probabilistic Algorithms and the Interactive Museum Tour-Guide Robot Minerva
This paper describes Minerva, an interactive tour-guide robot that was successfully deployed in a Smithsonian museum. Minerva’s software is pervasively probabilistic, relying on explicit
Using EM to Learn 3D Models of Indoor Environments with Mobile Robots
TLDR
An algorithm for generating compact 3D models of indoor environments with mobile robots using the expectation maximization algorithm to fit a lowcomplexity planar model to 3D data collected by range finders and a panoramic camera is described.
An Autonomous Guided Vehicle for Cargo Handling Applications
TLDR
The need to develop and build reliability in the context of autonomous systems is seen as crucial, and this requires a careful re-think of the way in which techniques and systems are implemented and the development of quantifiable measures of performance and reliability.
The optimal control of par-tially observable Markov processes
TLDR
A fluorescence spectrophotometer having a beam splitter placed between an exit slit of an excitation monochromator and a specimen and a reference photomultiplier provided for receiving fluorescence from said first light quantum meter.
The EM algorithm and extensions
TLDR
The EM Algorithm and Extensions describes the formulation of the EM algorithm, details its methodology, discusses its implementation, and illustrates applications in many statistical contexts, opening the door to the tremendous potential of this remarkably versatile statistical tool.
Sequential Monte Carlo Methods in Practice
Marchenko, A. A., and Pastur, L. A. (1967), “Distribution of Eigenvalues for Some Sets of Random Matrices,” Mathematics of the USSR-Sbornik, 1, 457– 483. Mardia, K. V., Kent, J. T., and Bibby, J. M.
...
...