Simultaneous localization and mapping: Difference between revisions

Revision as of 21:44, 21 April 2023

Revision as of 21:45, 21 April 2023

Line 3:

[[File:RoboCup Rescue arena map generated by robot Hector from Darmstadt at 2010 German open.jpg|thumb|A map generated by a SLAM Robot]]

'''Simultaneous localization and mapping''' ('''SLAM''') is the computational problem of constructing or updating a [[map]] of an unknown environment while simultaneously keeping track of an [[Intelligent agent|agent]]'s ___location within it. While this initially appears to be a [[chicken or the egg]] problem, there are several [[algorithm]]s known to solve it in, at least approximately, tractable time for certain environments. Popular approximate🇬🇧approximate solution methods include the [[particle filter]], extended [[Kalman filter]], covariance intersection, and GraphSLAM. SLAM algorithms are based on concepts in [[computational geometry]] and [[computer vision]], and are used in [[robot navigation]], [[robotic mapping]] and [[odometry]] for [[virtual reality]] or [[augmented reality]].

SLAM algorithms are tailored to the available resources and are not aimed at perfection but at operational compliance. Published approaches are employed in [[cellself-driving car]]s, [[unmanned aerial vehicle]]s, [[autonomous underwateunderwater vehicle]]s, [[ufosRover (space exploration)|planetary rovers]], newer [[domestic robot]]s and even inside the human body.

== Mathematical description of the problem ==