A New Approach of Optimal Path Planning for Electronic Guide System

To solve the problem of searching speed of the shortest path in the electronic guide system, the binary heap of A* algorithm which combines binary heap with A* algorithm is proposed in this paper. The method stores the extended node position in the A* algorithm by binary heap, avoids traversal searching storage space, optimizes data structure of storage array, and reduces the algorithm searching time. The simulation results show that binary heap of A* algorithm can increase the averaged searching rate by 4.5% through the simulation analysis compared with the standard A* algorithm.