Development of optimal path searching algorithm in the complex building

As transportation facilities get larger and more complex, it becomes necessary to present guiding and navigation system to users for their convenience. There are several studies for choosing optimal path for the road network, but all of those are insufficient for the inside of a transportation facility. This study is to develop the algorithm for selecting optimal path from the underground parking lot to user's multiple destination in the building. Not only objective, but subjective factors are considered to decide the optimal route for their destinations. To define the minimum cost for moving, the Dijkstra algorithm and evaluation function for the human factor are adopted. Several scenarios demonstrate the characteristic and originality of selecting optimal path algorithm. For the covering abstract seeITRD E140665.