---
title: 'LMKF SLAM: Linear Reformulation of SLAM'
url: https://www.emergentmind.com/topics/lmkf-slam
type: topic
---

# LMKF SLAM: Linear Reformulation of SLAM

Searching arXiv for the specified paper and closely related SLAM work.
Searching arXiv for LMKF SLAM and related EKF/KF SLAM formulations.
LMKF SLAM is a simultaneous localization and mapping formulation introduced by transforming a nonlinear SLAM state-space model into a linear model and then applying the original Kalman filter rather than an extended Kalman filter. The method is motivated by a central failure mode of EKF-based SLAM: divergence induced by the nonlinearity of the motion and observation models and by linearization error. In the reported formulation, a simple compass provides a direct noisy measurement of the heading, which allows the heading to be treated as a measured input rather than a state variable; combined with an effective transformation of range-bearing observations into Cartesian relative coordinates, this yields a linear-Gaussian model for planar SLAM with static point landmarks [2606.28475].

## 1. Problem setting and motivation

The work is situated in the standard mobile-robot SLAM setting in which the robot must estimate its own pose while simultaneously estimating landmark positions. The paper identifies EKF-based SLAM as a major and common class of algorithms for this task, and it states that one of their main problems is divergence when the robot’s motion and/or observation models are strongly nonlinear [2606.28475].

The mechanism of divergence is specified in terms of repeated local linearization. Every EKF update requires linearizing the true nonlinear models around the current estimate. According to the reported analysis, linearization errors accumulate, inflate the Kalman gain, and lead to over-confidence, described as covariance collapse, and eventually to wrong state updates. The paper further emphasizes that bearing-only measurements and heading estimation errors introduce extra degrees of unobservability, making the filter inconsistent unless very small angular uncertainties are assumed.

Against this background, LMKF SLAM is framed as a linear-model alternative. A fully linear state-space model avoids any Taylor-series approximations in the filter equations. The claimed consequences are exact optimality of the Kalman filter with no linearization bias, provable convergence of landmark and robot estimates under standard detectability and observability assumptions, and reduced computational cost because no Jacobian of the state equations is required at each time step. This suggests that the method is not merely a numerical modification of EKF-SLAM, but a reformulation designed to remove the specific source of EKF inconsistency.

## 2. Nonlinear SLAM model from which LMKF is derived

The starting point is a nonlinear planar vehicle model. Let the robot pose at time $k$ be
$$
x_k^r = [x_k,\; y_k,\; \theta_k]^T.
$$
The robot measures instantaneous forward speed $v_k$ and steering angle $G_k$, and it observes $I_k$ landmarks whose true positions are $(x_k^i, y_k^i)$. The standard continuous-time discretized motion model is given as
$$
\begin{bmatrix}
x_{k+1}\\
y_{k+1}\\
\theta_{k+1}
\end{bmatrix}
=
\begin{bmatrix}
x_k + v_k d_t \cos(\theta_k + G_k)\\
y_k + v_k d_t \sin(\theta_k + G_k)\\
\theta_k + \dfrac{v_k d_t \sin(G_k)}{D}
\end{bmatrix}
+ w_k,
$$
where $d_t$ is the sampling interval, $D$ the wheelbase, and $w_k$ zero-mean process noise [2606.28475].

The landmark observation model is the standard nonlinear range-bearing form:
$$
z_k^i
=
\begin{bmatrix}
r_k^i\\
\phi_k^i
\end{bmatrix}
=
\begin{bmatrix}
\sqrt{(x_k^i - x_k)^2+(y_k^i - y_k)^2}\\
\operatorname{atan2}(y_k^i - y_k,\;x_k^i - x_k)-\theta_k
\end{bmatrix}
+ n_k^i.
$$
Within this formulation, the robot heading $\theta_k$ is both dynamically evolved and embedded in the bearing observation, which is precisely the coupling that makes the overall state-space model nonlinear.

This nonlinear structure is the baseline against which LMKF SLAM is defined. A plausible implication is that the method is best understood as a model transformation strategy: it preserves the original SLAM objective while altering the representation so that linear Kalman filtering becomes admissible.

## 3. Effective transformation and the linear state-space model

The key idea is to equip the robot with a compass giving a direct noisy measurement of the heading $\theta_k$, so that $\theta_k$ can be treated as a measured input rather than a state variable. The transformed inputs are defined as
$$
\bar \theta_k = \theta_k + n_k^\theta,\qquad
\bar v_k = v_k + n_k^v,\qquad
\bar G_k = G_k + n_k^G.
$$
Using these quantities, the planar motion is rewritten purely in the $(x,y)$ subspace and linearized in the sensor noises:
$$
\begin{bmatrix}
x_{k+1}\\
y_{k+1}
\end{bmatrix}
=
\begin{bmatrix}
x_k\\
y_k
\end{bmatrix}
+ u_k + G_k^u w_k^n,
$$
where
$$
u_k = d_t \bar v_k
\begin{bmatrix}
\cos(\bar \theta_k + \bar G_k)\\
\sin(\bar \theta_k + \bar G_k)
\end{bmatrix},
\qquad
w_k^n = [n_k^v,\; n_k^\psi]^T,\quad
n_k^\psi = n_k^\theta + n_k^G.
$$

Because landmarks are static, the augmented state becomes
$$
x_k = [x_k,\; y_k,\; x_k^1,\; y_k^1,\dots,x_k^n,\; y_k^n]^T.
$$
The observation transformation is defined by the nonlinear mapping $h:(r,\phi,\theta)\mapsto \zeta$:
$$
\zeta_k^i
=
h(\bar r_k^i,\bar \phi_k^i,\bar \theta_k)
=
\begin{bmatrix}
\bar r_k^i \cos(\bar \theta_k + \bar \phi_k^i)\\
\bar r_k^i \sin(\bar \theta_k + \bar \phi_k^i)
\end{bmatrix}.
$$
Linearizing in the measurement noises yields
$$
\zeta_k^i
\simeq
\begin{bmatrix}
x_k^i - x_k\\
y_k^i - y_k
\end{bmatrix}
+ S_k^i \nu_k^i
=
H_k^i x_k + S_k^i \nu_k^i,
$$
where $\nu_k^i$ are zero-mean Gaussian, $S_k^i$ the Jacobians, and $H_k^i$ picks out the robot and $i$-th landmark coordinates [2606.28475].

In full state form, the transformed model is
$$
x_{k+1} = A x_k + B u_k + w_k,
\qquad
A = I_{2+2n},\;
B=
\begin{bmatrix}
I_2\\
0_{2n\times2}
\end{bmatrix},
$$
with
$$
w_k = [G_k^u w_k^n;0].
$$
For all visible landmarks,
$$
z_k =
\begin{bmatrix}
\zeta_k^{i_1}\\
\vdots\\
\zeta_k^{i_I}
\end{bmatrix}
=
H_k x_k + v_k,
\qquad
H_k=
\begin{bmatrix}
H_k^{i_1}\\
\vdots\\
H_k^{i_I}
\end{bmatrix}.
$$
The paper characterizes this transformed model as exactly linear-Gaussian. In context, the central significance of LMKF SLAM lies here: the state-transition and observation operators used by the filter are linear in the augmented state, so the estimator no longer relies on the EKF’s repeated local Jacobian linearizations of the original nonlinear state equations.

## 4. Kalman filtering procedure

Once the transformed model is obtained, LMKF SLAM applies the standard discrete-time Kalman filter. The prediction equations are
$$
\hat x_{k+1|k} = A \hat x_{k|k} + B u_k,\qquad
P_{k+1|k} = A P_{k|k} A^T + Q_k,
$$
with
$$
Q_k = \mathrm{blkdiag}(G_k^u Q^n G_k^{uT},\;0_{2n\times2n}).
$$
The update equations are
$$
K_k = P_{k|k-1}H_k^T\bigl(H_k P_{k|k-1} H_k^T + R_k\bigr)^{-1},
$$
$$
\hat x_{k|k} = \hat x_{k|k-1} + K_k\bigl(z_k - H_k \hat x_{k|k-1}\bigr),
\qquad
P_{k|k} = (I - K_k H_k)P_{k|k-1}.
$$

The algorithm summary is explicit. Initialization uses $\hat x_{0|0}$ and $P_{0|0}$. At each time $k$, the robot reads the compass $\bar \theta_k$, odometry $\bar v_k$, and optionally $\bar G_k$; computes $u_k$, $G_k^u$, and $Q_k$; performs the prediction step; and then, for each observed landmark $i$, computes $\zeta_k^i = h(\cdot)$, the Jacobian $S_k^i$, and the observation matrix $H_k^i$. The update may be implemented sequentially:
$$
K_k^i = P H_k^{iT}(H_k^i P H_k^{iT}+S_k^i R_k^i S_k^{iT})^{-1},
$$
followed by
$$
\hat x \leftarrow \hat x + K_k^i(\zeta_k^i - H_k^i \hat x),
\qquad
P \leftarrow P - K_k^i H_k^i P.
$$
The output is $\hat x_{k|k}$ and $P_{k|k}$ [2606.28475].

The importance of this procedure is twofold. First, it uses the original Kalman filter rather than an extended variant. Second, the sequential update is reported to further accelerate execution, which aligns with the paper’s broader claim of lower computational complexity relative to EKF-based alternatives.

## 5. Reported empirical behavior

The reported comparative analysis states that LMKF SLAM is significantly superior to state-of-the-art methods, especially EKF-based SLAMs, in accuracy, convergence, and computational complexity [2606.28475]. The specific baselines named in the experiments are EKF, UnFS-SLAM, and ICKF.

The main quantitative results are summarized below.

| Setting | LMKF | Comparators |
|---|---|---|
| Simulated 200×200 m², closed-loop path (1.35 km, 139 landmarks) and open-loop path (0.58 km, 63 landmarks) | Robot RMSE $\approx 0.3$–$0.5$ m | EKF $1.5$ m, UnFS $1.2$ m, ICKF $0.9$ m |
| Same simulated setting | Landmark RMSE similarly halved | Relative to the compared methods |
| Victoria Park real dataset (2D LiDAR + GPS + odometry) | Vehicle RMSE $\approx 1.2$ m, MAE $\approx 3.5$ m | EKF RMSE $2.6$ m, MAE $4.4$ m |
| Victoria Park real dataset, 620 updates | Execution time $45$ s | EKF $53$ s, ICKF $71$ s, UnFS $93$ s |

In addition to point metrics, the comparative analysis emphasizes several qualitative properties. The convergence region is described as wider because exact linearity guarantees convergence under standard Kalman-filter assumptions, whereas EKF needs very small angular noise for consistency. The computational advantage is attributed to the absence of online Jacobians of the state equations, with approximately $20$–$30\%$ CPU savings versus EKF; the sequential update is reported to further accelerate execution. Stability under sensor uncertainty is also highlighted: the RMSE of LMKF is almost invariant to increases in speed uncertainty $\sigma_v$ or heading noise $\sigma_\theta$, while EKF/UnFS error explodes as $\sigma_G$ or $v$ grows.

These reported results are significant because they tie the model transformation directly to observable estimator behavior. In the paper’s presentation, the gains are not limited to nominal accuracy; they extend to convergence properties, runtime, and robustness to sensor uncertainty.

## 6. Scope, requirements, and implications

The formulation has explicit requirements. It requires a reliable heading sensor, stated as an electronic compass or IMU, to remove $\theta$ from the state. It also assumes static, point-landmarks and planar motion [2606.28475]. These are not peripheral engineering details; they define the regime in which the linear reformulation is available.

A common misunderstanding would be to read LMKF SLAM as a universal elimination of SLAM nonlinearity. The reported formulation is narrower: by “measuring” the robot heading with a simple compass and transforming range/bearing into Cartesian relative coordinates, one obtains an exactly linear state-space model. The linearity therefore depends on the sensing setup and on the geometric assumptions of the map representation. This suggests that the method is best matched to 2D platforms with dependable heading sensing and landmark-based perception.

The paper also identifies several potential extensions. These include 3D SLAM via analogous roll/pitch/yaw measurements and point-cloud transforms, integration with map-parametrized landmarks such as lines and planes using the same linearization principle, and fusion with batch graph-SLAM or smoothing for global consistency checks. These directions indicate that LMKF SLAM may be interpreted not only as a specific filter instance, but also as a design principle: restructure the estimation problem so that the dominant nonlinear coupling is absorbed into measured inputs and transformed observations, leaving a linear state-space model for inference.

Source: https://www.emergentmind.com/topics/lmkf-slam