Over the last couple of years, research on indoor environments has gained a fresh impetus; more specifically applications that support navigation and wayfinding have become one of the booming industries. Indoor navigation research currently covers the technological aspect of indoor positioning and the modelling of indoor space. The algorithmic development to support navigation has so far been left mostly untouched, as most applications mainly rely on adapting Dijkstra's shortest path algorithm to an indoor network. However, alternative algorithms for outdoor navigation have been proposed adding a more cognitive notion to the calculated paths and as such adhering to the natural wayfinding behaviour (e.g. simplest paths, least risk paths). These algorithms are currently restricted to outdoor applications. 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.). As such, the clarity and easiness of route instructions is of paramount importance when distributing indoor routes. A shortest or fastest path indoors not necessarily aligns with the cognitive mapping of the building. 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-storey building. The results of several least risk path calculations are compared to the shortest paths in indoor environments in terms of total length, improvement in route description complexity and number of turns. Several scenarios are tested in this comparison: paths covering a single floor, paths crossing several building wings and/or floors. Adjustments to the algorithm are proposed to be more aligned to the specific structure of indoor environments (e.g. no ...


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Calculating least risk paths in 3D indoor space


    Beteiligte:

    Erscheinungsdatum :

    2013-01-01


    Anmerkungen:

    ISPRS 8TH 3D GEOINFO CONFERENCE & WG II/2 WORKSHOP ; ISSN: 1682-1750



    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    629




    Assigning Traffic Over Essentially-Least-Cost Paths

    Hunt, David / Kornhauser, Alain | Transportation Research Record | 1996


    Assigning Traffic over Essentially-Least-Cost Paths

    Hunt, David T. / Kornhauser, Alain L. | Transportation Research Record | 1996


    Assigning Traffic Over Essentially-Least-Cost Paths

    Hunt, D. T. / Kornhauser, A. L. / National Research Council; Transportation Research Board | British Library Conference Proceedings | 1996


    Assigning Traffic Over Essentially-Least-Cost Paths

    Hunt, David T. | Online Contents | 1996