Indoor Routing on Logical Network Using Space Semantics
An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces....
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Liu Liu [verfasserIn] Sisi Zlatanova [verfasserIn] Bofeng Li [verfasserIn] Peter van Oosterom [verfasserIn] Hua Liu [verfasserIn] Jack Barton [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2019 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
In: ISPRS International Journal of Geo-Information - MDPI AG, 2012, 8(2019), 3, p 126 |
|---|---|
| Übergeordnetes Werk: |
volume:8 ; year:2019 ; number:3, p 126 |
| Links: |
|---|
| DOI / URN: |
10.3390/ijgi8030126 |
|---|
| Katalog-ID: |
DOAJ031682472 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | DOAJ031682472 | ||
| 003 | DE-627 | ||
| 005 | 20230307162317.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 230226s2019 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.3390/ijgi8030126 |2 doi | |
| 035 | |a (DE-627)DOAJ031682472 | ||
| 035 | |a (DE-599)DOAJcf6c68454f6d429ea8210cce4c9e1a52 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 050 | 0 | |a G1-922 | |
| 100 | 0 | |a Liu Liu |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Indoor Routing on Logical Network Using Space Semantics |
| 264 | 1 | |c 2019 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building’s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision. | ||
| 650 | 4 | |a indoor navigation | |
| 650 | 4 | |a indoor routing | |
| 650 | 4 | |a logical network | |
| 650 | 4 | |a indoor space semantics | |
| 653 | 0 | |a Geography (General) | |
| 700 | 0 | |a Sisi Zlatanova |e verfasserin |4 aut | |
| 700 | 0 | |a Bofeng Li |e verfasserin |4 aut | |
| 700 | 0 | |a Peter van Oosterom |e verfasserin |4 aut | |
| 700 | 0 | |a Hua Liu |e verfasserin |4 aut | |
| 700 | 0 | |a Jack Barton |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i In |t ISPRS International Journal of Geo-Information |d MDPI AG, 2012 |g 8(2019), 3, p 126 |w (DE-627)689130961 |w (DE-600)2655790-3 |x 22209964 |7 nnns |
| 773 | 1 | 8 | |g volume:8 |g year:2019 |g number:3, p 126 |
| 856 | 4 | 0 | |u https://doi.org/10.3390/ijgi8030126 |z kostenfrei |
| 856 | 4 | 0 | |u https://doaj.org/article/cf6c68454f6d429ea8210cce4c9e1a52 |z kostenfrei |
| 856 | 4 | 0 | |u http://www.mdpi.com/2220-9964/8/3/126 |z kostenfrei |
| 856 | 4 | 2 | |u https://doaj.org/toc/2220-9964 |y Journal toc |z kostenfrei |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_DOAJ | ||
| 912 | |a GBV_ILN_11 | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_23 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_39 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_60 | ||
| 912 | |a GBV_ILN_62 | ||
| 912 | |a GBV_ILN_63 | ||
| 912 | |a GBV_ILN_65 | ||
| 912 | |a GBV_ILN_69 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_73 | ||
| 912 | |a GBV_ILN_95 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_110 | ||
| 912 | |a GBV_ILN_151 | ||
| 912 | |a GBV_ILN_161 | ||
| 912 | |a GBV_ILN_170 | ||
| 912 | |a GBV_ILN_213 | ||
| 912 | |a GBV_ILN_230 | ||
| 912 | |a GBV_ILN_285 | ||
| 912 | |a GBV_ILN_293 | ||
| 912 | |a GBV_ILN_370 | ||
| 912 | |a GBV_ILN_602 | ||
| 912 | |a GBV_ILN_2014 | ||
| 912 | |a GBV_ILN_4012 | ||
| 912 | |a GBV_ILN_4037 | ||
| 912 | |a GBV_ILN_4112 | ||
| 912 | |a GBV_ILN_4125 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4249 | ||
| 912 | |a GBV_ILN_4305 | ||
| 912 | |a GBV_ILN_4306 | ||
| 912 | |a GBV_ILN_4307 | ||
| 912 | |a GBV_ILN_4313 | ||
| 912 | |a GBV_ILN_4322 | ||
| 912 | |a GBV_ILN_4323 | ||
| 912 | |a GBV_ILN_4324 | ||
| 912 | |a GBV_ILN_4325 | ||
| 912 | |a GBV_ILN_4335 | ||
| 912 | |a GBV_ILN_4338 | ||
| 912 | |a GBV_ILN_4367 | ||
| 912 | |a GBV_ILN_4392 | ||
| 912 | |a GBV_ILN_4700 | ||
| 951 | |a AR | ||
| 952 | |d 8 |j 2019 |e 3, p 126 | ||
| author_variant |
l l ll s z sz b l bl p v o pvo h l hl j b jb |
|---|---|
| matchkey_str |
article:22209964:2019----::norotnolgclewruigp |
| hierarchy_sort_str |
2019 |
| callnumber-subject-code |
G |
| publishDate |
2019 |
| allfields |
10.3390/ijgi8030126 doi (DE-627)DOAJ031682472 (DE-599)DOAJcf6c68454f6d429ea8210cce4c9e1a52 DE-627 ger DE-627 rakwb eng G1-922 Liu Liu verfasserin aut Indoor Routing on Logical Network Using Space Semantics 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building’s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision. indoor navigation indoor routing logical network indoor space semantics Geography (General) Sisi Zlatanova verfasserin aut Bofeng Li verfasserin aut Peter van Oosterom verfasserin aut Hua Liu verfasserin aut Jack Barton verfasserin aut In ISPRS International Journal of Geo-Information MDPI AG, 2012 8(2019), 3, p 126 (DE-627)689130961 (DE-600)2655790-3 22209964 nnns volume:8 year:2019 number:3, p 126 https://doi.org/10.3390/ijgi8030126 kostenfrei https://doaj.org/article/cf6c68454f6d429ea8210cce4c9e1a52 kostenfrei http://www.mdpi.com/2220-9964/8/3/126 kostenfrei https://doaj.org/toc/2220-9964 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4392 GBV_ILN_4700 AR 8 2019 3, p 126 |
| spelling |
10.3390/ijgi8030126 doi (DE-627)DOAJ031682472 (DE-599)DOAJcf6c68454f6d429ea8210cce4c9e1a52 DE-627 ger DE-627 rakwb eng G1-922 Liu Liu verfasserin aut Indoor Routing on Logical Network Using Space Semantics 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building’s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision. indoor navigation indoor routing logical network indoor space semantics Geography (General) Sisi Zlatanova verfasserin aut Bofeng Li verfasserin aut Peter van Oosterom verfasserin aut Hua Liu verfasserin aut Jack Barton verfasserin aut In ISPRS International Journal of Geo-Information MDPI AG, 2012 8(2019), 3, p 126 (DE-627)689130961 (DE-600)2655790-3 22209964 nnns volume:8 year:2019 number:3, p 126 https://doi.org/10.3390/ijgi8030126 kostenfrei https://doaj.org/article/cf6c68454f6d429ea8210cce4c9e1a52 kostenfrei http://www.mdpi.com/2220-9964/8/3/126 kostenfrei https://doaj.org/toc/2220-9964 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4392 GBV_ILN_4700 AR 8 2019 3, p 126 |
| allfields_unstemmed |
10.3390/ijgi8030126 doi (DE-627)DOAJ031682472 (DE-599)DOAJcf6c68454f6d429ea8210cce4c9e1a52 DE-627 ger DE-627 rakwb eng G1-922 Liu Liu verfasserin aut Indoor Routing on Logical Network Using Space Semantics 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building’s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision. indoor navigation indoor routing logical network indoor space semantics Geography (General) Sisi Zlatanova verfasserin aut Bofeng Li verfasserin aut Peter van Oosterom verfasserin aut Hua Liu verfasserin aut Jack Barton verfasserin aut In ISPRS International Journal of Geo-Information MDPI AG, 2012 8(2019), 3, p 126 (DE-627)689130961 (DE-600)2655790-3 22209964 nnns volume:8 year:2019 number:3, p 126 https://doi.org/10.3390/ijgi8030126 kostenfrei https://doaj.org/article/cf6c68454f6d429ea8210cce4c9e1a52 kostenfrei http://www.mdpi.com/2220-9964/8/3/126 kostenfrei https://doaj.org/toc/2220-9964 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4392 GBV_ILN_4700 AR 8 2019 3, p 126 |
| allfieldsGer |
10.3390/ijgi8030126 doi (DE-627)DOAJ031682472 (DE-599)DOAJcf6c68454f6d429ea8210cce4c9e1a52 DE-627 ger DE-627 rakwb eng G1-922 Liu Liu verfasserin aut Indoor Routing on Logical Network Using Space Semantics 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building’s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision. indoor navigation indoor routing logical network indoor space semantics Geography (General) Sisi Zlatanova verfasserin aut Bofeng Li verfasserin aut Peter van Oosterom verfasserin aut Hua Liu verfasserin aut Jack Barton verfasserin aut In ISPRS International Journal of Geo-Information MDPI AG, 2012 8(2019), 3, p 126 (DE-627)689130961 (DE-600)2655790-3 22209964 nnns volume:8 year:2019 number:3, p 126 https://doi.org/10.3390/ijgi8030126 kostenfrei https://doaj.org/article/cf6c68454f6d429ea8210cce4c9e1a52 kostenfrei http://www.mdpi.com/2220-9964/8/3/126 kostenfrei https://doaj.org/toc/2220-9964 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4392 GBV_ILN_4700 AR 8 2019 3, p 126 |
| allfieldsSound |
10.3390/ijgi8030126 doi (DE-627)DOAJ031682472 (DE-599)DOAJcf6c68454f6d429ea8210cce4c9e1a52 DE-627 ger DE-627 rakwb eng G1-922 Liu Liu verfasserin aut Indoor Routing on Logical Network Using Space Semantics 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building’s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision. indoor navigation indoor routing logical network indoor space semantics Geography (General) Sisi Zlatanova verfasserin aut Bofeng Li verfasserin aut Peter van Oosterom verfasserin aut Hua Liu verfasserin aut Jack Barton verfasserin aut In ISPRS International Journal of Geo-Information MDPI AG, 2012 8(2019), 3, p 126 (DE-627)689130961 (DE-600)2655790-3 22209964 nnns volume:8 year:2019 number:3, p 126 https://doi.org/10.3390/ijgi8030126 kostenfrei https://doaj.org/article/cf6c68454f6d429ea8210cce4c9e1a52 kostenfrei http://www.mdpi.com/2220-9964/8/3/126 kostenfrei https://doaj.org/toc/2220-9964 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4392 GBV_ILN_4700 AR 8 2019 3, p 126 |
| language |
English |
| source |
In ISPRS International Journal of Geo-Information 8(2019), 3, p 126 volume:8 year:2019 number:3, p 126 |
| sourceStr |
In ISPRS International Journal of Geo-Information 8(2019), 3, p 126 volume:8 year:2019 number:3, p 126 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
indoor navigation indoor routing logical network indoor space semantics Geography (General) |
| isfreeaccess_bool |
true |
| container_title |
ISPRS International Journal of Geo-Information |
| authorswithroles_txt_mv |
Liu Liu @@aut@@ Sisi Zlatanova @@aut@@ Bofeng Li @@aut@@ Peter van Oosterom @@aut@@ Hua Liu @@aut@@ Jack Barton @@aut@@ |
| publishDateDaySort_date |
2019-01-01T00:00:00Z |
| hierarchy_top_id |
689130961 |
| id |
DOAJ031682472 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ031682472</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230307162317.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/ijgi8030126</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ031682472</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJcf6c68454f6d429ea8210cce4c9e1a52</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">G1-922</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Liu Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Indoor Routing on Logical Network Using Space Semantics</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building&rsquo;s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">indoor navigation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">indoor routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">logical network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">indoor space semantics</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Geography (General)</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Sisi Zlatanova</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Bofeng Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Peter van Oosterom</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Hua Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jack Barton</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">ISPRS International Journal of Geo-Information</subfield><subfield code="d">MDPI AG, 2012</subfield><subfield code="g">8(2019), 3, p 126</subfield><subfield code="w">(DE-627)689130961</subfield><subfield code="w">(DE-600)2655790-3</subfield><subfield code="x">22209964</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:3, p 126</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/ijgi8030126</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/cf6c68454f6d429ea8210cce4c9e1a52</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.mdpi.com/2220-9964/8/3/126</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2220-9964</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4392</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2019</subfield><subfield code="e">3, p 126</subfield></datafield></record></collection>
|
| callnumber-first |
G - Geography, Anthropology, Recreation |
| author |
Liu Liu |
| spellingShingle |
Liu Liu misc G1-922 misc indoor navigation misc indoor routing misc logical network misc indoor space semantics misc Geography (General) Indoor Routing on Logical Network Using Space Semantics |
| authorStr |
Liu Liu |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)689130961 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut aut |
| collection |
DOAJ |
| remote_str |
true |
| callnumber-label |
G1-922 |
| illustrated |
Not Illustrated |
| issn |
22209964 |
| topic_title |
G1-922 Indoor Routing on Logical Network Using Space Semantics indoor navigation indoor routing logical network indoor space semantics |
| topic |
misc G1-922 misc indoor navigation misc indoor routing misc logical network misc indoor space semantics misc Geography (General) |
| topic_unstemmed |
misc G1-922 misc indoor navigation misc indoor routing misc logical network misc indoor space semantics misc Geography (General) |
| topic_browse |
misc G1-922 misc indoor navigation misc indoor routing misc logical network misc indoor space semantics misc Geography (General) |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
ISPRS International Journal of Geo-Information |
| hierarchy_parent_id |
689130961 |
| hierarchy_top_title |
ISPRS International Journal of Geo-Information |
| isfreeaccess_txt |
true |
| familylinks_str_mv |
(DE-627)689130961 (DE-600)2655790-3 |
| title |
Indoor Routing on Logical Network Using Space Semantics |
| ctrlnum |
(DE-627)DOAJ031682472 (DE-599)DOAJcf6c68454f6d429ea8210cce4c9e1a52 |
| title_full |
Indoor Routing on Logical Network Using Space Semantics |
| author_sort |
Liu Liu |
| journal |
ISPRS International Journal of Geo-Information |
| journalStr |
ISPRS International Journal of Geo-Information |
| callnumber-first-code |
G |
| lang_code |
eng |
| isOA_bool |
true |
| recordtype |
marc |
| publishDateSort |
2019 |
| contenttype_str_mv |
txt |
| author_browse |
Liu Liu Sisi Zlatanova Bofeng Li Peter van Oosterom Hua Liu Jack Barton |
| container_volume |
8 |
| class |
G1-922 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Liu Liu |
| doi_str_mv |
10.3390/ijgi8030126 |
| author2-role |
verfasserin |
| title_sort |
indoor routing on logical network using space semantics |
| callnumber |
G1-922 |
| title_auth |
Indoor Routing on Logical Network Using Space Semantics |
| abstract |
An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building’s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision. |
| abstractGer |
An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building’s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision. |
| abstract_unstemmed |
An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building’s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4392 GBV_ILN_4700 |
| container_issue |
3, p 126 |
| title_short |
Indoor Routing on Logical Network Using Space Semantics |
| url |
https://doi.org/10.3390/ijgi8030126 https://doaj.org/article/cf6c68454f6d429ea8210cce4c9e1a52 http://www.mdpi.com/2220-9964/8/3/126 https://doaj.org/toc/2220-9964 |
| remote_bool |
true |
| author2 |
Sisi Zlatanova Bofeng Li Peter van Oosterom Hua Liu Jack Barton |
| author2Str |
Sisi Zlatanova Bofeng Li Peter van Oosterom Hua Liu Jack Barton |
| ppnlink |
689130961 |
| callnumber-subject |
G - General Geography |
| mediatype_str_mv |
c |
| isOA_txt |
true |
| hochschulschrift_bool |
false |
| doi_str |
10.3390/ijgi8030126 |
| callnumber-a |
G1-922 |
| up_date |
2024-07-03T21:55:19.088Z |
| _version_ |
1803596562787467264 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ031682472</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230307162317.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/ijgi8030126</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ031682472</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJcf6c68454f6d429ea8210cce4c9e1a52</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">G1-922</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Liu Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Indoor Routing on Logical Network Using Space Semantics</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building&rsquo;s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">indoor navigation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">indoor routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">logical network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">indoor space semantics</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Geography (General)</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Sisi Zlatanova</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Bofeng Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Peter van Oosterom</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Hua Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jack Barton</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">ISPRS International Journal of Geo-Information</subfield><subfield code="d">MDPI AG, 2012</subfield><subfield code="g">8(2019), 3, p 126</subfield><subfield code="w">(DE-627)689130961</subfield><subfield code="w">(DE-600)2655790-3</subfield><subfield code="x">22209964</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:3, p 126</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/ijgi8030126</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/cf6c68454f6d429ea8210cce4c9e1a52</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.mdpi.com/2220-9964/8/3/126</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2220-9964</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4392</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2019</subfield><subfield code="e">3, p 126</subfield></datafield></record></collection>
|
| score |
7.4008837 |