Reseach On Path Planning Algorithm In Traffic Hub Pedestrian Guidance System

As the comprehensive transportation becoming comprehensive, three-dimensional,intensive, the mode of transportation in the hub is increasing. The seamless connection between the internal transportation hub and the validity of information relating to service for guidance is becoming more and more demanding. Information of the guidance and the transfer in the hub providing the immobilized service information is mainly through static signs, electronic screen, and radio and so on. But as a large number of large-scale public places established indoors, individual users demand for the service of indoor location become larger, such as in complex transportation hub when travelling, large recreation areas and so on. As a result, users are in urgent need of a good indoor guidance technology to help themselves to choose the optimal path,reducing the time consumption in the path finding and lost probability. Transport hub pedestrian guidance system is one of the most important component of intelligent transportation system. It finds the shortest path from source to destination in the traffic hub of road network by receiving traffic information from monitoring management center and using their own handheld devices. The path planning algorithm is not only the core technology of transport hub guidance system, but also the foundation of pedestrian guidance technology in the hub. It plans an optimal path for users to meet their different needs in the traffic hub of road network.This thesis takes the “Beijing comprehensive traffic integration travel service key technology research and application demonstration project” as the backing to study path planning algorithm for indoors. The study is divided into the following three parts. First,through the comparative analysis of commonly used algorithm, it is concluded that A*algorithm is A heuristic best-first search algorithm. The basic idea of this algorithm is when to determine the next node on the path, it needs to traverse all adjacent nodes of the current node; Second, in order to improve the searching efficiency of A* algorithm,this thesis puts forward a shortest path planning algorithm based on target direction constraints on the basis of the A* algorithm applying to indoor environment walking pedestrians. The algorithm overcomes the shortage of the A* algorithm that it needs to search all adjacent nodes; Third, Design interior pedestrian guidance, including the design of pedestrian destination guide, " close- oriented" guiding and property guide forpedestrians. Fourth, the improved algorithm are simulated under Matlab. The simulation results show that compared with A* algorithm the improved algorithm reduces the number of the searching nodes to 25- 35%. In addition, the path planning can save time about 25%. Thus, the efficiency of the search is improved obviously. Also, the algorithm can guarantee the stability of the algorithm and ensure that the performance of the algorithm does not reduce as the nodes significantly increase; Fifth, tests of indoor pedestrian guidance system. In the process of the system test, it done well for pedestrians guide through the information interaction between with other function module.