<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "https://jats.nlm.nih.gov/nlm-dtd/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="3.0" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">ISPRS-Annals</journal-id>
<journal-title-group>
<journal-title>ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences</journal-title>
<abbrev-journal-title abbrev-type="publisher">ISPRS-Annals</abbrev-journal-title>
<abbrev-journal-title abbrev-type="nlm-ta">ISPRS Ann. Photogramm. Remote Sens. Spatial Inf. Sci.</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2194-9050</issn>
<publisher><publisher-name>Copernicus Publications</publisher-name>
<publisher-loc>Göttingen, Germany</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.5194/isprsannals-II-4-W1-19-2013</article-id>
<title-group>
<article-title>Analyzing the applicability of the least risk path algorithm in indoor space</article-title>
</title-group>
<contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Vanclooster</surname>
<given-names>A.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Viaene</surname>
<given-names>P.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Van de Weghe</surname>
<given-names>N.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Fack</surname>
<given-names>V.</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>De Maeyer</surname>
<given-names>Ph.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
</contrib-group><aff id="aff1">
<label>1</label>
<addr-line>Dept. of Geography, Ghent University, Ghent, Belgium</addr-line>
</aff>
<aff id="aff2">
<label>2</label>
<addr-line>Dept. of Applied Mathematics and Computer Science, Ghent University, Ghent, Belgium</addr-line>
</aff>
<pub-date pub-type="epub">
<day>26</day>
<month>11</month>
<year>2013</year>
</pub-date>
<volume>II-4/W1</volume>
<fpage>19</fpage>
<lpage>26</lpage>
<permissions>
<copyright-statement>Copyright: &#x000a9; 2013 A. Vanclooster et al.</copyright-statement>
<copyright-year>2013</copyright-year>
<license license-type="open-access">
<license-p>This work is licensed under the Creative Commons Attribution 3.0 Unported License. To view a copy of this licence, visit <ext-link ext-link-type="uri"  xlink:href="https://creativecommons.org/licenses/by/3.0/">https://creativecommons.org/licenses/by/3.0/</ext-link></license-p>
</license>
</permissions>
<self-uri xlink:href="https://isprs-annals.copernicus.org/articles/II-4-W1/19/2013/isprs-annals-II-4-W1-19-2013.html">This article is available from https://isprs-annals.copernicus.org/articles/II-4-W1/19/2013/isprs-annals-II-4-W1-19-2013.html</self-uri>
<self-uri xlink:href="https://isprs-annals.copernicus.org/articles/II-4-W1/19/2013/isprs-annals-II-4-W1-19-2013.pdf">The full text article is available as a PDF file from https://isprs-annals.copernicus.org/articles/II-4-W1/19/2013/isprs-annals-II-4-W1-19-2013.pdf</self-uri>
<abstract>
<p>Over the last couple of years, applications that support navigation and wayfinding in indoor environments have become one of the
booming industries. However, the algorithmic support for indoor navigation has so far been left mostly untouched, as most
applications mainly rely on adapting Dijkstra&apos;s shortest path algorithm to an indoor network. In outdoor space, several alternative
algorithms have been proposed adding a more cognitive notion to the calculated paths and as such adhering to the natural wayfinding
behavior (e.g. simplest paths, least risk paths). The need for indoor cognitive algorithms is highlighted by a more challenged
navigation and orientation due to the specific indoor structure (e.g. fragmentation, less visibility, confined areas…). Therefore, the
aim of this research is to extend those richer cognitive algorithms to three-dimensional indoor environments. More specifically for
this paper, we will focus on the application of the least risk path algorithm of Grum (2005) to an indoor space. The algorithm as
proposed by Grum (2005) is duplicated and tested in a complex multi-story building. Several analyses compare shortest and least risk
paths in indoor and in outdoor space. The results of these analyses indicate that the current outdoor least risk path algorithm does not
calculate less risky paths compared to its shortest paths. In some cases, worse routes have been suggested. Adjustments to the
original algorithm are proposed to be more aligned to the specific structure of indoor environments. In a later stage, other cognitive
algorithms will be implemented and tested in both an indoor and combined indoor-outdoor setting, in an effort to improve the overall
user experience during navigation in indoor environments.</p>
</abstract>
<counts><page-count count="8"/></counts>
</article-meta>
</front>
<body/>
<back>
</back>
</article>