FHWS/Fusion2016
Archived
3
0
Fork 0
Code Issues 1 Pull Requests Releases Wiki Activity

related work and intro first draft from toni

Browse Source
This commit is contained in:
toni
2016-02-09 18:01:59 +01:00
parent bf41f5f97d
commit 2f838df6e9
5 changed files with 96 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
tex/chapters/introduction.tex
View File

@@ -60,7 +60,9 @@ Walking through a door has a lower probability than remaining on the corridor, s
This can be tackled by making such areas more likely.
Therefore, a novel approach for detecting doors using again the inverted graph and the principal component analysis (PCA) \cite{Hotelling1933} is presented within this work.
Finally, it is now possible to calculate more natural and realistic paths using the weighted graph. We introduce two different methods which make use of the given destination and thereby provide a targeted movement.
Finally, it is now possible to calculate more natural and realistic paths using the weighted graph.
We introduce two different methods which make use of the given destination and thereby provide a targeted movement.
To the best of our knowledge, our approach is the first one that uses prior navigation knowledge to increase the localisation results.