1,459 research outputs found

    On the right track : comfort and confusion in indoor environments

    Get PDF
    Indoor navigation systems are not well adapted to the needs of their users. The route planning algorithms implemented in these systems are usually limited to shortest path calculations or derivatives, minimalizing Euclidian distance. Guiding people along routes that adhere better to their cognitive processes could ease wayfinding in indoor environments. This paper examines comfort and confusion perception during wayfinding by applying a mixed-method approach. The aforementioned method combined an exploratory focus group and a video-based online survey. From the discussions in the focus group, it could be concluded that indoor wayfinding must be considered at different levels: the local level and the global level. In the online survey, the focus was limited to the local level, i.e., local environmental characteristics. In this online study, the comfort and confusion ratings of multiple indoor navigation situations were analyzed. In general, the results indicate that open spaces and stairs need to be taken into account in the development of a more cognitively-sounding route planning algorithm. Implementing the results in a route planning algorithm could be a valuable improvement of indoor navigation support

    Indoor Semantic Modelling for Routing:

    Get PDF
    Humans perform many activities indoors and they show a growing need for indoor navigation, especially in unfamiliar buildings such as airports, museums and hospitals. Complexity of such buildings poses many challenges for building managers and visitors. Indoor navigation services play an important role in supporting these indoor activities. Indoor navigation covers extensive topics such as: 1) indoor positioning and localization; 2) indoor space representation for navigation model generation; 3) indoor routing computation; 4) human wayfinding behaviours; and 5) indoor guidance (e.g., textual directories). So far, a large number of studies of pedestrian indoor navigation have presented diverse navigation models and routing algorithms/methods. However, the major challenge is rarely referred to: how to represent the complex indoor environment for pedestrians and conduct routing according to the different roles and sizes of users. Such complex buildings contain irregular shapes, large open spaces, complicated obstacles and different types of passages. A navigation model can be very complicated if the indoors are accurately represented. Although most research demonstrates feasible indoor navigation models and related routing methods in regular buildings, the focus is still on a general navigation model for pedestrians who are simplified as circles. In fact, pedestrians represent different sizes, motion abilities and preferences (e.g., described in user profiles), which should be reflected in navigation models and be considered for indoor routing (e.g., relevant Spaces of Interest and Points of Interest). In order to address this challenge, this thesis proposes an innovative indoor modelling and routing approach – two-level routing. It specially targets the case of routing in complex buildings for distinct users. The conceptual (first) level uses general free indoor spaces: this is represented by the logical network whose nodes represent the spaces and edges stand for their connectivity; the detailed (second) level focuses on transition spaces such as openings and Spaces of Interest (SOI), and geometric networks are generated regarding these spaces. Nodes of a geometric network refers to locations of doors, windows and subspaces (SOIs) inside of the larger spaces; and the edges represent detailed paths among these geometric nodes. A combination of the two levels can represent complex buildings in specified spaces, which avoids maintaining a largescale complete network. User preferences on ordered SOIs are considered in routing on the logical network, and preferences on ordered Points of Interest (POI) are adopted in routing on geometric networks. In a geometric network, accessible obstacle-avoiding paths can be computed for users with different sizes. To facilitate automatic generation of the two types of network in any building, a new data model named Indoor Navigation Space Model (INSM) is proposed to store connectivity, semantics and geometry of indoor spaces for buildings. Abundant semantics of building components are designed in INSM based on navigational functionalities, such as VerticalUnit(VU) and HorizontalConnector(HC) as vertical and horizontal passages for pedestrians. The INSM supports different subdivision ways of a building in which indoor spaces can be assigned proper semantics. A logical and geometric network can be automatically derived from INSM, and they can be used individually or together for indoor routing. Thus, different routing options are designed. Paths can be provided by using either the logical network when some users are satisfied with a rough description of the path (e.g., the name of spaces), or a geometric path is automatically computed for a user who needs only a detailed path which shows how obstacles can be avoided. The two-level routing approach integrates both logical and geometric networks to obtain paths, when a user provides her/his preferences on SOIs and POIs. For example, routing results for the logical network can exclude unrelated spaces and then derive geometric paths more efficiently. In this thesis, two options are proposed for routing just on the logical network, three options are proposed for routing just on the geometric networks, and seven options for two-level routing. On the logical network, six routing criteria are proposed and three human wayfinding strategies are adopted to simulate human indoor behaviours. According to a specific criterion, space semantics of logical nodes is utilized to assign different weights to logical nodes and edges. Therefore, routing on the logical network can be accomplished by applying the Dijkstra algorithm. If multiple criteria are adopted, an order of criteria is applied for routing according to a specific user. In this way, logical paths can be computed as a sequence of indoor spaces with clear semantics. On geometric networks, this thesis proposes a new routing method to provide detailed paths avoiding indoor obstacles with respect to pedestrian sizes. This method allows geometric networks to be derived for individual users with different sizes for any specified spaces. To demonstrate the use of the two types of network, this thesis tests routing on one level (the logical or the geometric network). Four case studies about the logical network are presented in both simple and complex buildings. In the simple building, no multiple paths lie between spaces A and B, but in the complex buildings, multiple logical paths exist and the candidate paths can be reduced by applying these routing criteria in an order for a user. The relationships of these criteria to user profiles are assumed in this thesis. The proposed geometric routing regarding user sizes is tested with three case studies: 1) routing for pedestrians with two distinct sizes in one space; 2) routing for pedestrians with changed sizes in one space; and 3) a larger geometric network formed by the ones in a given sequence of spaces. The first case shows that a small increase of user size can largely change the accessible path; the second case shows different path segments for distinct sizes can be combined into one geometric path; the third case demonstrates a geometric network can be created ’on the fly’ for any specified spaces of a building. Therefore, the generation and routing of geometric networks are very flexible and fit to given users. To demonstrate the proposed two-level routing approach, this thesis designs five cases. The five cases are distinguished according to the method of model creation (pre-computed or ’on-the-fly’) and model storage (on the client or server). Two of them are realized in this thesis: 1) Case 1 just in the client pre-computes the logical network and derives geometric networks ’on the fly’; 2) Case 2 just in the client pre-computes and stores the logical and geometric networks for certain user sizes. Case 1 is implemented in a desktop application for building managers, and Case 2 is realized as a mobile mock-up for mobile users without an internet connection. As this thesis shows, two-level routing is powerful enough to effectively provide indicative logical paths and/or comprehensive geometric paths, according to different user requirements on path details. In the desktop application, three of the proposed routing options for two-level routing are tested for the simple OTB building and the complex Schiphol Airport building. These use cases demonstrate that the two-level routing approach includes the following merits: It supports routing in different abstraction forms of a building. The INSM model can describe different subdivision results of a building, and it allows two types of routing network to be derived – pure logical and geometric ones. The logical network contains the topology and semantics of indoor spaces, and the geometric network provides accurate geometry for paths. A consistent navigation model is formed with the two networks, i.e., the conceptual and detailed levels. On the conceptual level, it supports routing on a logical network and assists the derivation of a conceptual path (i.e., logical path) for a user in terms of space sequence. Routing criteria are designed based on the INSM semantics of spaces, which can generate logical paths similar to human wayfinding results such as minimizing VerticalUnit or HorizontalConnector. On the detailed level, it considers the size of users and results in obstacle-avoiding paths. By using this approach, geometric networks can be generated to avoid obstacles for the given users and accessible paths are flexibly provided for user demands. This approach can process changes of user size more efficiently, in contrast to routing on a complete geometric network. It supports routing on both the logical and the geometric networks, which can generate geometric paths based on user-specific logical paths, or re-compute logical paths when geometric paths are inaccessible. This computation method is very useful for complex buildings. The two-level routing approach can flexibly provide logical and geometric paths according to user preferences and sizes, and can adjust the generated paths in limited time. Based on the two-level routing approach, this thesis also provides a vision on possible cooperation with other methods. A potential direction is to design more routing options according to other indoor scenarios and user preferences. Extensions of the two-level routing approach, such as other types of semantics, multi-level networks and dynamic obstacles, will make it possible to deal with other routing cases. Last but not least, it is also promising to explore its relationships with indoor guidance, different building subdivisions and outdoor navigation

    Indoor Semantic Modelling for Routing: The Two-Level Routing Approach for Indoor Navigation

    Get PDF
    Humans perform many activities indoors and they show a growing need for indoor navigation, especially in unfamiliar buildings such as airports, museums and hospitals. Complexity of such buildings poses many challenges for building managers and visitors. Indoor navigation services play an important role in supporting these indoor activities. Indoor navigation covers extensive topics such as: 1) indoor positioning and localization; 2) indoor space representation for navigation model generation; 3) indoor routing computation; 4) human wayfinding behaviours; and 5) indoor guidance (e.g., textual directories). So far, a large number of studies of pedestrian indoor navigation have presented diverse navigation models and routing algorithms/methods. However, the major challenge is rarely referred to: how to represent the complex indoor environment for pedestrians and conduct routing according to the different roles and sizes of users. Such complex buildings contain irregular shapes, large open spaces, complicated obstacles and different types of passages. A navigation model can be very complicated if the indoors are accurately represented. Although most research demonstrates feasible indoor navigation models and related routing methods in regular buildings, the focus is still on a general navigation model for pedestrians who are simplified as circles. In fact, pedestrians represent different sizes, motion abilities and preferences (e.g., described in user profiles), which should be reflected in navigation models and be considered for indoor routing (e.g., relevant Spaces of Interest and Points of Interest). In order to address this challenge, this thesis proposes an innovative indoor modelling and routing approach – two-level routing. It specially targets the case of routing in complex buildings for distinct users. The conceptual (first) level uses general free indoor spaces: this is represented by the logical network whose nodes represent the spaces and edges stand for their connectivity; the detailed (second) level focuses on transition spaces such as openings and Spaces of Interest (SOI), and geometric networks are generated regarding these spaces. Nodes of a geometric network refers to locations of doors, windows and subspaces (SOIs) inside of the larger spaces; and the edges represent detailed paths among these geometric nodes. A combination of the two levels can represent complex buildings in specified spaces, which avoids maintaining a largescale complete network. User preferences on ordered SOIs are considered in routing on the logical network, and preferences on ordered Points of Interest (POI) are adopted in routing on geometric networks. In a geometric network, accessible obstacle-avoiding paths can be computed for users with different sizes. To facilitate automatic generation of the two types of network in any building, a new data model named Indoor Navigation Space Model (INSM) is proposed to store connectivity, semantics and geometry of indoor spaces for buildings. Abundant semantics of building components are designed in INSM based on navigational functionalities, such as VerticalUnit(VU) and HorizontalConnector(HC) as vertical and horizontal passages for pedestrians. The INSM supports different subdivision ways of a building in which indoor spaces can be assigned proper semantics. A logical and geometric network can be automatically derived from INSM, and they can be used individually or together for indoor routing. Thus, different routing options are designed. Paths can be provided by using either the logical network when some users are satisfied with a rough description of the path (e.g., the name of spaces), or a geometric path is automatically computed for a user who needs only a detailed path which shows how obstacles can be avoided. The two-level routing approach integrates both logical and geometric networks to obtain paths, when a user provides her/his preferences on SOIs and POIs. For example, routing results for the logical network can exclude unrelated spaces and then derive geometric paths more efficiently. In this thesis, two options are proposed for routing just on the logical network, three options are proposed for routing just on the geometric networks, and seven options for two-level routing. On the logical network, six routing criteria are proposed and three human wayfinding strategies are adopted to simulate human indoor behaviours. According to a specific criterion, space semantics of logical nodes is utilized to assign different weights to logical nodes and edges. Therefore, routing on the logical network can be accomplished by applying the Dijkstra algorithm. If multiple criteria are adopted, an order of criteria is applied for routing according to a specific user. In this way, logical paths can be computed as a sequence of indoor spaces with clear semantics. On geometric networks, this thesis proposes a new routing method to provide detailed paths avoiding indoor obstacles with respect to pedestrian sizes. This method allows geometric networks to be derived for individual users with different sizes for any specified spaces. To demonstrate the use of the two types of network, this thesis tests routing on one level (the logical or the geometric network). Four case studies about the logical network are presented in both simple and complex buildings. In the simple building, no multiple paths lie between spaces A and B, but in the complex buildings, multiple logical paths exist and the candidate paths can be reduced by applying these routing criteria in an order for a user. The relationships of these criteria to user profiles are assumed in this thesis. The proposed geometric routing regarding user sizes is tested with three case studies: 1) routing for pedestrians with two distinct sizes in one space; 2) routing for pedestrians with changed sizes in one space; and 3) a larger geometric network formed by the ones in a given sequence of spaces. The first case shows that a small increase of user size can largely change the accessible path; the second case shows different path segments for distinct sizes can be combined into one geometric path; the third case demonstrates a geometric network can be created ’on the fly’ for any specified spaces of a building. Therefore, the generation and routing of geometric networks are very flexible and fit to given users. To demonstrate the proposed two-level routing approach, this thesis designs five cases. The five cases are distinguished according to the method of model creation (pre-computed or ’on-the-fly’) and model storage (on the client or server). Two of them are realized in this thesis: 1) Case 1 just in the client pre-computes the logical network and derives geometric networks ’on the fly’; 2) Case 2 just in the client pre-computes and stores the logical and geometric networks for certain user sizes. Case 1 is implemented in a desktop application for building managers, and Case 2 is realized as a mobile mock-up for mobile users without an internet connection. As this thesis shows, two-level routing is powerful enough to effectively provide indicative logical paths and/or comprehensive geometric paths, according to different user requirements on path details. In the desktop application, three of the proposed routing options for two-level routing are tested for the simple OTB building and the complex Schiphol Airport building. These use cases demonstrate that the two-level routing approach includes the following merits: It supports routing in different abstraction forms of a building. The INSM model can describe different subdivision results of a building, and it allows two types of routing network to be derived – pure logical and geometric ones. The logical network contains the topology and semantics of indoor spaces, and the geometric network provides accurate geometry for paths. A consistent navigation model is formed with the two networks, i.e., the conceptual and detailed levels. On the conceptual level, it supports routing on a logical network and assists the derivation of a conceptual path (i.e., logical path) for a user in terms of space sequence. Routing criteria are designed based on the INSM semantics of spaces, which can generate logical paths similar to human wayfinding results such as minimizing VerticalUnit or HorizontalConnector. On the detailed level, it considers the size of users and results in obstacle-avoiding paths. By using this approach, geometric networks can be generated to avoid obstacles for the given users and accessible paths are flexibly provided for user demands. This approach can process changes of user size more efficiently, in contrast to routing on a complete geometric network. It supports routing on both the logical and the geometric networks, which can generate geometric paths based on user-specific logical paths, or re-compute logical paths when geometric paths are inaccessible. This computation method is very useful for complex buildings. The two-level routing approach can flexibly provide logical and geometric paths according to user preferences and sizes, and can adjust the generated paths in limited time. Based on the two-level routing approach, this thesis also provides a vision on possible cooperation with other methods. A potential direction is to design more routing options according to other indoor scenarios and user preferences. Extensions of the two-level routing approach, such as other types of semantics, multi-level networks and dynamic obstacles, will make it possible to deal with other routing cases. Last but not least, it is also promising to explore its relationships with indoor guidance, different building subdivisions and outdoor navigation. &nbsp

    Spatial Queries for Indoor Location-based Services

    Get PDF
    Indoor Location-based Services (LBS) facilitate people in indoor scenarios such as airports, train stations, shopping malls, and office buildings. Indoor spatial queries are the foundation to support indoor LBSs. However, the existing techniques for indoor spatial queries are limited to support more advanced queries that consider semantic information, temporal variations, and crowd influence. This work studies indoor spatial queries for indoor LBSs. Some typical proposals for indoor spatial queries are compared theoretically and experimentally. Then, it studies three advanced indoor spatial queries, a) Indoor Keyword-aware Routing Query. b) Indoor Temporal-variation aware Routing Query. c) Indoor Crowd-aware Routing Query. A series of techniques are proposed to solve these problems.</p

    μŠ€μΊ” 도면을 ν™œμš©ν•œ μ΄λ™μ•½μžμš© μ‹€λ‚΄ κ·Έλž˜ν”„ λ°μ΄ν„°λ² μ΄μŠ€ ꡬ좕

    Get PDF
    ν•™μœ„λ…Όλ¬Έ(박사) -- μ„œμšΈλŒ€ν•™κ΅λŒ€ν•™μ› : κ³΅κ³ΌλŒ€ν•™ κ±΄μ„€ν™˜κ²½κ³΅ν•™λΆ€, 2021.8. λ°•μŠ¬μ•„.μ‚¬λžŒλ“€μ˜ μ‹€λ‚΄ ν™œλ™μ΄ λ‹€μ–‘ν•΄μ§€λ©΄μ„œ 건물의 규λͺ¨κ°€ 컀지고 ꡬ쑰가 λ³΅μž‘ν•΄μ§€κ³  μžˆλ‹€. μ΄λŸ¬ν•œ μ‹€λ‚΄ ν™˜κ²½μ˜ λ³€ν™”λŠ” κ΅ν†΅μ•½μžμ˜ 이동성 보μž₯에 λŒ€ν•œ μ‚¬νšŒμ  관심을 μ¦κ°€μ‹œμΌ°μœΌλ©°, κ΅ν†΅μ•½μž λ§žμΆ€ν˜• μ‹€λ‚΄ λΌμš°νŒ… μ„œλΉ„μŠ€μ— λŒ€ν•œ μˆ˜μš” λ˜ν•œ μ¦κ°€μ‹œμΌ°λ‹€. 특히 λ§Žμ€ 이동 μ œμ•½μ„ κ°€μ§€λŠ” μ΄λ™μ•½μž λŒ€μƒ μ„œλΉ„μŠ€μ˜ κ²½μš°μ—λŠ”, 졜적 경둜λ₯Ό κ³„νšν•˜λŠ” κ³Όμ •μ—μ„œ 개인의 μ„ ν˜Έλ‚˜ κ²½ν—˜μ΄ 반영된 κ°œμΈν™”λœ μ„œλΉ„μŠ€λ‘œ λ²”μœ„κ°€ ν™•μž₯되고 μžˆλ‹€. μ΄λŸ¬ν•œ λ°°κ²½μ—μ„œ, μŠ€ν‚€λ§ˆκ°€ μœ μ—°ν•˜κ³  λ°μ΄ν„°μ˜ 가곡 및 μ²˜λ¦¬κ°€ 효율적인 λ°μ΄ν„°λ² μ΄μŠ€μ˜ ꡬ좕이 ν•„μš”ν•˜λ‹€. λ³Έ μ—°κ΅¬μ—μ„œλŠ” μŠ€μΊ”ν•œ 도면 이미지λ₯Ό ν™œμš©ν•œ μ΄λ™μ•½μžμš© μ‹€λ‚΄ κ·Έλž˜ν”„λ°μ΄ν„°λ² μ΄μŠ€ ꡬ좕 기법을 μ œμ•ˆν•˜μ˜€λ‹€. λ¨Όμ €, κ΅­λ‚΄μ™Έ μ‹€λ‚΄ 곡간 κ΄€λ ¨ ν‘œμ€€ 및 섀계 κΈ°μ€€λ“€μ˜ κ²€ν† λ₯Ό 톡해 μ΄λ™μ•½μžμ˜ 톡행과 κ΄€λ ¨λœ μ‹€λ‚΄ 곡간 및 객체, 영ν–₯ μš”μΈλ“€μ„ λ„μΆœν•˜μ—¬ κ°œλ…μ  데이터 λͺ¨λΈμ„ μ„€κ³„ν•˜μ˜€λ‹€. λ˜ν•œ, μ‹€λ‚΄μ˜ 각 곡간과 μ‹œμ„€λ¬Όμ˜ κΈ°ν•˜μ •λ³΄μ™€ μœ„μƒμ •λ³΄λ₯Ό 기반으둜 μ΄λ™μ•½μžμ˜ μ ‘κ·Όμ„± 및 톡행 κ°€λŠ₯성을 μ •λŸ‰ν™”ν•˜κΈ° μœ„ν•œ μ ‘κ·Όμ„± μ§€μˆ˜λ₯Ό μ„€κ³„ν•˜μ˜€λ‹€. λ‹€μŒμœΌλ‘œ, μŠ€μΊ” 도면을 μž…λ ₯ν•˜μ—¬ μ΄λ™μ•½μžμš© μ‹€λ‚΄ κ·Έλž˜ν”„ λ°μ΄ν„°λ² μ΄μŠ€ ꡬ좕을 μœ„ν•œ ν”„λ‘œμ„ΈμŠ€λ₯Ό μ œμ•ˆν•˜μ˜€λ‹€. μ œμ•ˆν•œ ν”„λ‘œμ„ΈμŠ€λŠ” μ „μ΄ν•™μŠ΅ 기반 μ ‘κ·Ό 방식을 톡해 μŠ€μΊ” λ„λ©΄μ—μ„œ κ³΅κ°„μ˜ ꡬ쑰 정보λ₯Ό μΆ”μΆœν•˜κ³ , ν† ν΄λ‘œμ§€ μΆ”μΆœ 및 μ ‘κ·Όμ„± 평가λ₯Ό 톡해 μ΄λ™μ•½μžμš© λ„€νŠΈμ›Œν¬ λͺ¨λΈμ„ μƒμ„±ν•˜λ©°, μƒμ„±ν•œ λ„€νŠΈμ›Œν¬ λͺ¨λΈμ„ κ·Έλž˜ν”„ λ°μ΄ν„°λ² μ΄μŠ€λ‘œ μžλ™ λ³€ν™˜ν•˜λŠ” 과정을 ν¬ν•¨ν•œλ‹€. ꡬ체적으둜, μ œμ•ˆ ν”„λ‘œμ„ΈμŠ€λŠ” μˆ˜μ •λœ ResNet 기반의 λͺ¨λΈμ„ μƒˆλ‘­κ²Œ λΌλ²¨λ§ν•œ λ„λ©΄μœΌλ‘œ λ―Έμ„Έ μ‘°μ •ν•˜μ—¬ μ‚¬μš©ν•¨μœΌλ‘œμ¨ μ‹€λ‚΄ ꡬ쑰맡을 μƒμ„±ν•œλ‹€. 이후 μΆ”μΆœλœ κ°μ²΄λ“€μ˜ 곡간 관계λ₯Ό 기반으둜 각 곡간을 λ…Έλ“œμ™€ 링크둜 ν‘œν˜„ν•œ μ‹€λ‚΄ λ„€νŠΈμ›Œν¬ λͺ¨λΈμ„ κ΅¬μΆ•ν•œλ‹€. 각 κ³΅κ°„μ˜ μ ‘κ·Όμ„± μ •λ³΄λŠ” μ œμ•ˆλœ μ ‘κ·Όμ„± μ§€μˆ˜μ™€ μž„κ³„κ°’μ„ μ‚¬μš©ν•˜μ—¬ μƒμ„±λœ ν›„ λ°μ΄ν„°λ² μ΄μŠ€μ— μ €μž₯λ˜μ–΄, μ΄λ™μ•½μžλ₯Ό μœ„ν•œ μ ‘κ·Ό κ°€λŠ₯ν•œ κ·Έλž˜ν”„ μΆ”μΆœμ— ν™œμš©λ  수 μžˆλ‹€. λ³Έ μ—°κ΅¬μ—μ„œλŠ” μ œμ•ˆν•œ 기법을 μ„œμšΈλŒ€ν•™κ΅ 도면 데이터 셋에 μ μš©ν•˜μ—¬ μ΄λ™μ•½μžμš© μ‹€λ‚΄ κ·Έλž˜ν”„ λ°μ΄ν„°λ² μ΄μŠ€λ₯Ό κ΅¬μΆ•ν•˜κ³  ν‰κ°€ν•˜μ˜€λ‹€. κ΅¬μΆ•ν•œ μ‹€λ‚΄ κ·Έλž˜ν”„ λ°μ΄ν„°λ² μ΄μŠ€λ₯Ό ν™œμš©ν•˜μ—¬ λ‹€μΈ΅ 경둜 κ³„νšκ³Ό μ‹€λ‚΄μ™Έ 연계 경둜 κ³„νšμ˜ 2가지 μ‹œλ‚˜λ¦¬μ˜€μ— 따라 졜적 경둜λ₯Ό λ„μΆœν•˜μ˜€λ‹€. κ·Έ κ²°κ³Ό, 일반 λ³΄ν–‰μžμ˜ 졜적 κ²½λ‘œμ™€ λΉ„κ΅ν•˜μ—¬ μ΄λ™μ•½μžμš© 졜적 κ²½λ‘œλŠ” κ°€κΉŒμš΄ 계단이 μ•„λ‹Œ μ—˜λ¦¬λ² μ΄ν„°λ₯Ό ν†΅ν•œ 수직 이동을 ν¬ν•¨ν•˜μ˜€μ„ 뿐만 μ•„λ‹ˆλΌ μ ‘κ·Ό λΆˆκ°€λŠ₯ν•œ 곡간을 νšŒν”Όν•˜λ„λ‘ λ„μΆœλ˜μ—ˆλ‹€. 즉, μ œμ•ˆν•œ 기법을 톡해 μ΄λ™μ•½μž μΈ‘λ©΄μ—μ„œ 톡행 μž₯μ•  정보λ₯Ό ν¬ν•¨ν•˜μ—¬ μ‹€λ‚΄ ν™˜κ²½μ„ μ μ ˆν•˜κ²Œ λ¬˜μ‚¬ν•˜λŠ” λ°μ΄ν„°λ² μ΄μŠ€μ˜ ꡬ좕이 κ°€λŠ₯함을 확인할 수 μžˆμ—ˆλ‹€. λ˜ν•œ, μΆœμž…λ‘œλ‘œ λͺ…λͺ…λœ 관계 μƒμ„±λ§ŒμœΌλ‘œ μŠ€μΌ€μΌμ΄λ‚˜ μ’Œν‘œ λ³€ν™˜ 없이 μ‹€λ‚΄μ™Έ 연계 경둜 κ³„νšμ΄ κ°€λŠ₯ν•˜μ˜€λŠ”λ°, μ΄λŠ” 독립적인 데이터 κ°„ 연계 μ‚¬μš©μ— μ ν•©ν•œ κ·Έλž˜ν”„ λ°μ΄ν„°λ² μ΄μŠ€μ˜ νŠΉμ„±μ„ λ°˜μ˜ν•œ 결과둜 νŒλ‹¨ν•  수 μžˆλ‹€. λ³Έ μ—°κ΅¬μ˜ μ£Όμš” κΈ°μ—¬λŠ” μŠ€μΊ”ν•œ 도면을 μ‚¬μš©ν•˜μ—¬ μ΄λ™μ•½μžμš© μ‹€λ‚΄ κ·Έλž˜ν”„ λ°μ΄ν„°λ² μ΄μŠ€λ₯Ό κ΅¬μΆ•ν•˜κΈ° μœ„ν•œ ν”„λ‘œμ„ΈμŠ€λ₯Ό κ°œλ°œν•œ 것이닀. ꡬ체적으둜, μ΄λ™μ•½μžμ˜ 이동에 μ΄ˆμ μ„ 두고 μ„€κ³„ν•œ 데이터 λͺ¨λΈμ„ 기반으둜 ν•œ λ°μ΄ν„°λ² μ΄μŠ€ ꡬ좕이 κ°€λŠ₯ν•˜λ―€λ‘œ μ΄λ™μ•½μžμš© μ‹€λ‚΄ κΈΈμ•ˆλ‚΄ μ„œλΉ„μŠ€μ— ν™œμš©λ  수 μžˆλ‹€. λ˜ν•œ, ν† ν΄λ‘œμ§€ ꡬ좕 및 κ·Έλž˜ν”„ λ°μ΄ν„°λ² μ΄μŠ€λ‘œμ˜ λ³€ν™˜μ„ μœ„ν•œ ν•˜μœ„ ν”„λ‘œμ‹œμ Έλ₯Ό κ°œλ°œν•˜μ˜€μœΌλ©°, μ œμ•ˆ ν”„λ‘œμ„ΈμŠ€λŠ” ν•΄λ‹Ή ν”„λ‘œμ‹œμ Έλ“€λ‘œ κ΅¬μ„±λ˜μ–΄ 도면 μž…λ ₯을 톡해 μ΄λ™μ•½μžμš© μ‹€λ‚΄ κ·Έλž˜ν”„ λ°μ΄ν„°λ² μ΄μŠ€ ꡬ좕을 κ°€λŠ₯ν•˜κ²Œ ν•œλ‹€. ν•΄λ‹Ή ν•˜μœ„ ν”„λ‘œμ‹œμ Έλ“€μ€ μžλ™μœΌλ‘œ μˆ˜ν–‰λ  수 μžˆμ–΄ λ°μ΄ν„°λ² μ΄μŠ€ ꡬ좕 μ‹œ μ†Œμš”λ˜λŠ” μ‹œκ°„κ³Ό λΉ„μš©μ„ μ ˆκ°ν•  수 μžˆλ‹€. λ˜ν•œ, λ‹€μ–‘ν•œ μ •ν˜• 및 λΉ„μ •ν˜• λ°μ΄ν„°μ˜ 연계에 μ ν•©ν•œ κ·Έλž˜ν”„ λ°μ΄ν„°λ² μ΄μŠ€μ˜ νŠΉμ§•μ— μ˜ν•΄, μ œμ•ˆν•œ ν”„λ‘œμ„ΈμŠ€λ₯Ό 톡해 κ΅¬μΆ•ν•œ μ‹€λ‚΄ λ°μ΄ν„°λ² μ΄μŠ€λŠ” κΈ°μ‘΄ 곡간 λͺ¨λΈμ˜ κΈ°λŠ₯을 ν¬ν•¨ν•˜λ©΄μ„œ λ‹€μ–‘ν•œ μœ ν˜•μ˜ κΈΈμ•ˆλ‚΄ μ„œλΉ„μŠ€μ— ν™œμš©λ  수 μžˆμ„ κ²ƒμœΌλ‘œ κΈ°λŒ€λœλ‹€.Changes to the indoor environment have increased social interest in ensuring the mobility of people with disabilities. Therefore, the demand for customized indoor routing services for people with mobility disabilities (PWMD), who have many travel restrictions, is increasing. These services have progressed from spatial routing to personalized routing, which reflects personal preferences and experiences in planning an optimal path. In this regard, it is necessary to generate a database for PWMD with a flexible schema suitable for the efficient manipulation and processing of data. This study aims to propose a technique of generating an indoor graph database for PWMD using scanned floor plans. First, a conceptual data model was developed by deriving relevant indoor features and influential factors, considering various international regulations on indoor environments. Also, the accessibility index was designed based on the data model to quantify the difficulties in accessing spaces based on each indoor spaces geometric characteristics. Next, a three-stage process was proposed: retrieving the structure of spaces from scanned floor plans through a transfer learning-based approach, retrieving topology and assessing accessibility for creating an indoor network model for PWMD, and converting the network model into a graph database. Specifically, an indoor structure map is created by fine-tuning the modified Resnet-based model with newly annotated floor plans for extracting structure information. Also, based on the spatial relationship of the extracted features, the indoor network model was created by abstracting indoor spaces with nodes and links. The accessibility of each space is determined by the proposed indices and thresholds; thereby, a feasible network for PWMD could be derived. Then, a process was developed for automatically converting an indoor network model, including accessibility property, into a graph database. The proposed technique was applied to the Seoul National University dataset to generate an indoor graph database for PWMD. Two scenario-based routing tests were conducted using the generated database to verify the utility of results: multi-floor routing and integrated indoor-outdoor routing. As a result, compared with the path for general pedestrians, the optimal path for PWMD was derived by avoiding inaccessible spaces, including vertical movement using elevators rather than the nearest stairs. In other words, applying the proposed technique, a database that adequately described an indoor environment in terms of PWMD with sufficient mobile constraint information could be constructed. Moreover, an integrated indoor-outdoor routing could be conducted by only creating an entrance-labeled relationship, without scale and coordinate transformation. This result reflects the usability of the generated graph database and its suitability regarding the incorporation of multiple individual data sources. The main contribution lies in the development of the process for generating an indoor graph database for PWMD using scanned floor plans. In particular, the database for PWMD routing can be generated based on the proposed data model with PWMD-related features and factors. Also, sub-procedures for topology retrieval and graph database conversion are developed to generate the indoor graph database by the end-to-end process. The developed sub-procedures are performed automatically, thereby reducing the required times and costs. It is expected that the target database of the proposed process can be generated considering utilization for various types of routing since the graph database is easily integrated with multiple types of information while covering the existing spatial models function.1. Introduction 1 1.1 Objectives and contributions 1 1.2 Related works 7 1.2.1 Indoor environment conceptualization 7 1.2.2 Indoor data construction 11 1.2.3 Accessibility assessment 19 1.3 Research scope and flow 22 2. Conceptual modeling 26 2.1 Relevant features and factors 28 2.2 Proposed data model 30 2.3 Space accessibility for PWMD 36 2.3.1 Influential factors within indoor environments 37 2.3.2 Accessibility index 41 3. Indoor graph database for PWMD from scanned floor plans 43 3.1 Retrieving structure of indoor spaces 43 3.1.1 Pre-trained model for detecting indoor geometry 45 3.1.2 Dataset with new annotation 47 3.1.3 Transfer learning-based approach 52 3.2 Generating the indoor network model for PWMD 56 3.2.1 Definition of nodes and links in the network model 60 3.2.2 The classification rule of space polygons 63 3.2.3 Connection between general spaces and doors 68 3.2.4 Node-link generation for horizontal transition spaces 71 3.2.5 Vertical link generation 75 3.2.6 Connectivity and accessibility information generation 79 3.3 Indoor graph database for PWMD 80 3.3.1 Graph representation of indoor environments 80 3.3.2 Conversion of network model into graph database 83 3.4 Entire process 87 4. Experiment and results 89 4.1 Experimental setup and test data 89 4.2 Evaluation for retrieved information 92 4.2.1 Results of structure retrieval 92 4.2.2 Results of topology retrieval 99 4.3 Generated indoor graph database for PWMD 128 4.3.1 Results of the indoor graph database for PWMD 128 4.3.2 Query-based routing 136 5. Conclusion 147 References 150 Appendix 166 ꡭ문초둝 178λ°•

    Space Subdivision For Indoor Navigation: A Systematic Literature Review

    Get PDF
    Along with the increasing demand for indoor navigation, many attempts were made to improve indoor navigation performance. Information about the room becomes important, because one of the characteristics of indoor navigation is the dynamic indoor conditions. Space subdivision is an effort made to make indoor navigation even more accurate. The purpose of this study is to create a systematic literature review (SLR) regarding the topic of space subdivision for indoor navigation which is based on a SLR method, previously defined research question. This study examines several previous works specifically in the field of space subdivision for indoor navigation with the SLR. This research is expected to be the basis for further research to improve the quality of indoor navigation based on space subdivision

    Emergency response in complex buildings: Automated selection of safest and balanced routes

    Get PDF
    The extreme importance of emergency response in complex buildings during natural and human-induced disasters has been widely acknowledged. In particular, there is a need for efficient algorithms for finding safest evacuation routes, which would take into account the 3-D structure of buildings, their relevant semantics, and the nature and shape of hazards. In this article, we propose algorithms for safest routes and balanced routes in buildings, where an extreme event with many epicenters is occurring. In a balanced route, a trade-off between route length and hazard proximity is made. The algorithms are based on a novel approach that integrates a multiattribute decision-making technique, Dijkstra's classical algorithm and the introduced hazard proximity numbers, hazard propagation coefficient and proximity index for a route

    3D indoor modeling and game theory based navigation for pre and post COVID-19 situation

    Get PDF
    The COVID-19 pandemic has greatly affected human behavior, creating a need for individuals to be more cautious about health and safety protocols. People are becoming more aware of their surroundings and the importance of minimizing the risk of exposure to potential sources of infection. This shift in mindset is particularly important in indoor environments, especially hospitals, where there is a greater risk of virus transmission. The implementation of route planning in these areas, aimed at minimizing interaction and exposure, is crucial for positively influencing individual behavior. Accurate maps of buildings help provide location-based services, prepare for emergencies, and manage infrastructural facilities. There aren’t any maps available for most installations, and there are no proven techniques to categorize features within indoor areas to provide location-based services. During a pandemic like COVID-19, the direct connection between the masses is one of the significant preventive steps. Hospitals are the main stakeholders in managing such situations. This study presents a novel method to create an adaptive 3D model of an indoor space to be used for localization and routing purposes. The proposed method infuses LiDAR-based data-driven methodology with a Quantum Geographic Information System (QGIS) model-driven process using game theory. The game theory determines the object localization and optimal path for COVID-19 patients in a real-time scenario using Nash equilibrium. Using the proposed method, comprehensive simulations and model experiments were done using QGIS to identify an optimized route. Dijkstra algorithm is used to determine the path assessment score after obtaining several path plans using dynamic programming. Additionally, Game theory generates path ordering based on the custom scenarios and user preference in the input path. In comparison to other approaches, the suggested way can minimize time and avoid congestion. It is demonstrated that the suggested technique satisfies the actual technical requirements in real-time. As we look forward to the post-COVID era, the tactics and insights gained during the pandemic hold significant value. The techniques used to improve indoor navigation and reduce interpersonal contact within healthcare facilities can be applied to maintain a continued emphasis on safety, hygiene, and effective space management in the long term. The use of three-dimensional (3D) modeling and optimization methodologies in the long-term planning and design of indoor spaces promotes resilience and flexibility, encouraging the adoption of sustainable and safe practices that extend beyond the current pandemic
    • …
    corecore