Distance Map Associated with Tangent Search as a Pathfinder Strategy: achieving high-quality and safe route maps for crowed movement in built environments

Abstract

Several human movement simulators employ pathfinder algorithms to determine the best route to an emergency exit or other targets within built environments. However, the literature often lacks detailed descriptions of some of these algorithms, particularly those of high quality. This paper introduces a new and enhanced pathfinder algorithm, VSP (Visibility Search Pathfinder), designed for movement simulations in built environments. It is based on the creation of Distance Maps and Route Maps generated by tangent search. The algorithm's logic is thoroughly detailed, with examples of its application. Key advantages of the VSP algorithm include simplicity of logic, ease of computational implementation, applicability to environments of any design or geometry, low processing time (in non-dynamic scenarios), and full automation, requiring no specialist input. The VSP algorithm consistently identifies routes that closely approximate the optimal paths, independent of the number of people in the environment. Furthermore, the VSP algorithm allows the creation of a region around obstacles that prevents collisions. Thus, the VSP becomes a valuable tool for high-quality human movement simulations in evacuation contexts or similar scenarios.