# SLAM Algorithms (SLAM Algorithms)

(Redirected from Family:SLAM Algorithms)

Jump to navigation
Jump to search
## Description

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 agent's location within it.

## Parameters

No parameters found.

## Table of Algorithms

Name | Year | Time | Space | Approximation Factor | Model | Reference |
---|---|---|---|---|---|---|

EKF SLAM | 1998 | $O(n^{3})$ | $O(n^{2})$? | Deterministic | Time | |

UKF | 2000 | $O(n^{3})$ | $O(n^{2})$? | Deterministic | Time | |

Compressed Extended KF | 2002 | $O(n^{3})$ | $O(n^{2})$? | Deterministic | Time | |

Rao-Blackwellized Particle Filtering SLAM | 2001 | $O(n^{2})$ | $O(n)$? | Deterministic | Time | |

FastSlam | 2003 | $O(m*\log n)$ per iteration | $O(mn)$? | Deterministic | Time | |

srba | 2002 | $O(n^{2})$ | $O(n^{2})$? | Deterministic | Time |