eth-janishutz/eth-summaries
1
0
Fork 0
mirror of https://github.com/janishutz/eth-summaries.git synced 2026-09-10 13:05:24 +02:00
Code Issues Packages Projects Releases Wiki Activity

[AMR] Add abbreviation to ICP

Browse Source
This commit is contained in:
janishutz
2026-08-10 08:50:02 +02:00
parent 320f512fad
commit 204dc0bdf2
2 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
electives/amr/autonomous-mobile-robots-cheatsheet.pdf
BIN
View File
Binary file not shown.
electives/amr/parts/04_vision/03_mapping.tex
+1 -1
View File
@@ -33,7 +33,7 @@ $\displaystyle s_k = \frac{w_{k - 1} s_{k - 1} + \tilde{s}_k}{w_{k - 1} + 1}$ wi
\bi{Implementation} Using Hash maps or octree (dense grid inefficient) \bi{Implementation} Using Hash maps or octree (dense grid inefficient)
\subsubsection{Iterative Closest Point} \subsubsection{Iterative Closest Point (ICP)}
Build \textit{correspondences}: associate all live scan points $l_i$ to closest map points $m_i$. Error term: Build \textit{correspondences}: associate all live scan points $l_i$ to closest map points $m_i$. Error term:
$\vec{e} = \vec{T}_{W L_l} {_{L_l}}m_i - {_W}\vec{l}_i$. $\vec{e} = \vec{T}_{W L_l} {_{L_l}}m_i - {_W}\vec{l}_i$.
Minimize this via Gauss-Newton, then re-associate, iterate. Minimize this via Gauss-Newton, then re-associate, iterate.