Wayfinding signs play an important role in guiding users to navigate in a virtual environment and in helping pedestrians to find their ways in a real-world architectural site. Conventionally, the wayfinding design of a virtual environment is created manually, so as the wayfinding design of a real-world architectural site. The many possible navigation scenarios, as well as the interplay between signs and human navigation, can make the manual design process overwhelming and non-trivial. As a result, creating a wayfinding design for a typical layout can take months to several years. In this paper, we introduce the Way to Go! approach for automatically generating a wayfinding design for a given layout. The designer simply has to specify some navigation scenarios; our approach will automatically generate an optimized wayfinding design with signs properly placed considering human agents' visibility and possibility of making mistakes during a navigation. We demonstrate the effectiveness of our approach in generating wayfinding designs for different layouts such as a train station, a downtown and a canyon. We evaluate our results by comparing different wayfinding designs and show that our optimized wayfinding design can guide pedestrians to their destinations effectively and efficiently. Our approach can also help the designer visualize the accessibility of a destination from different locations, and correct any "blind zone" with additional signs.
The process of wayfinding involves four major steps @cite_3 : , , and . refers to determining one's current location. refers to selecting paths to navigate to the destination. refers to continuously verifying that the path indeed leads to the destination. Finally, refers to confirming that the destination has been reached. Our goal in this work is to automatically generate a wayfinding design for a given environment to facilitate the above wayfinding steps.
@cite_3
2046824495 1480883159 1982838671 1510564526
In this paper I examine processes involved in place recognition and wayfinding in the context of spatial knowledge acquisition generally. Recognizing places is seen to be of vital importance in developing a declarative base: wayfinding is viewed as the most common means of acquiring place knowledge. Characteristics of place recognition are examined along with discussion of errors in place cognition and the role that spatial familiarity plays in attaching importance weights to distinguish primary nodes (anchor points) from other places. Wayfinding is characterized as route knowledge acquired via procedural rules. Parameters of wayfinding are discussed in reference to navigation in familiar and unfamiliar environments. The expression of wayfinding in terms of computational process models is examined, and the future role of geographic information systems in such modelling is explored in the penultimate section. Navigation services communicate optimal routes to users by providing sequences of instructions for these routes. Each single instruction guides the wayfinder from one decision point to the next. The instructions are based on geometric data from the street network, which is typically the only dataset available. This paper addresses the question of enriching such wayfinding instructions with local landmarks. We propose measures to formally specify the landmark saliency of a feature. Values for these measures are subject to hypothesis tests in order to define and extract landmarks from datasets. The extracted landmarks are then integrated in the wayfinding instructions. A concrete example from the city of Vienna demonstrates the applicability and usefulness of the method. Location is a key context ingredient and many existing pervasive applications rely on the current locations of their users. However, with the ability to predict the future location and movement behavior of a user, the usability of these applications can be greatly improved. In this paper, we propose an approach to predict both the intended destination and the future route of a person. Rather than predicting the destination and future route separately, we have focused on making prediction in an integrated way by exploiting personal movement data (i.e. trajectories) collected by GPS. Since trajectories contain daily whereabouts information of a person, the proposed approach first detects the significant places where the person may depart from or go to using a clustering-based algorithm called FBM (Forward-Backward Matching), then abstracts the trajectories based on a space partitioning method, and finally extracts movement patterns from the abstracted trajectories using an extended CRPM (Continuous Route Pattern Mining) algorithm. Extracted movement patterns are organized in terms of origin-destination couples. The prediction is made based on a pattern tree built from these movement patterns. With the real personal movement data of 14 participants, we conducted a number of experiments to evaluate the performance of our system. The results show that our approach can achieve approximately 80 and 60 accuracy in destination prediction and 1-step prediction, respectively, and result in an average deviation of approximately 60 m in continuous future route prediction. Finally, based on the proposed approach, we implemented a prototype running on mobile phones, which can extract patterns from a user's historical movement data and predict the destination and future route. Pathfinding for a single agent is the problem of planning a route from an initial location to a goal location in an environment, going around obstacles. Pathfinding for multiple agents also aims to plan such routes for each agent, subject to different constraints, such as restrictions on the length of each path or on the total length of paths, no self-intersecting paths, no intersection of paths plans, no crossing meeting each other. It also has variations for finding optimal solutions, e.g., with respect to the maximum path length, or the sum of plan lengths. These problems are important for many real-life applications, such as motion planning, vehicle routing, environmental monitoring, patrolling, computer games. Motivated by such applications, we introduce a formal framework that is general enough to address all these problems: we use the expressive high-level representation formalism and efficient solvers of the declarative programming paradigm Answer Set Programming. We also introduce heuristics to improve the computational efficiency and or solution quality. We show the applicability and usefulness of our framework by experiments, with randomly generated problem instances on a grid, on a real-world road network, and on a real computer game terrain.