Research On Path Planning Of Electronic Guide System

As the world has entered the “age of tourism”, people prefer self-service tourism, which has highly selectivity. In the United States, Britain, France and some other developed countries, there are rental electronic guides available for the public. Nowadays, electronic guide system has become one big heat in the development of tourism. As one of the key technologies of electronic guide system, optimal path planning aims at projecting tourist paths of scenic areas or spots, so that visitors can get the best choice in self-service tourism. However,the existing electronic guide system is rather limited in path planning method. In order to adapt to the optimal path of the scenic spots, the thesis studies the path planning algorithm of electronic guide system.The thesis analyzes problems in the path planning of scenic spots in detail.Through in-depth analysis on actual road network of scenic spots, the thesis employs weight graph in the graph theory to present road distribution of scenic spots. Meanwhile, by using adjacency list to solve the problem of path data storage and to analyze functions to be realized in path planning.In view of deficiencies in the algorithm such as slow convergence speed,frequent stagnation phenomenon, improved ant colony algorithm has been put forward in the thesis. This method introduces deterministic choice into state transition probability so as to guide the selection path, which offsets the disadvantage of restricted speed of exploratory search. Besides, the method brings an initial value in the local pheromone updating strategy, which can reduce the probability of other ants selecting the edge, increase their chances to explore other paths and reduce the probability of falling into local optimum.Introducing global optimal path into global pheromone updating rules helps the side of the short path possess high pheromone strength, and the optimized algorithm is improved on the general search efficiency. In addition, the algorithm parameters were analyzed to determine the optimal value range. The simulationexperiment verifies the feasibility and effectiveness of the improved ant colony algorithm, so the convergence speed is faster and the optimal solution can be obtained.Backtracking ant colony algorithm proposed in the thesis integrates the idea of backtracking into improving ant colony algorithm and applies the algorithm to path planning of scenic spots in electronic guide system. Despite that the improved ant colony algorithm may cause the problem of ant colony trapped into“dead end” in the practical application of path planning of scenic spots, in the thesis the idea of backtracking can be adopted to solve it. Meanwhile, the algorithm will be employed into the traversal of scenic spots. The simulation experiment demonstrates that the method of backtracking ant colony algorithm is feasible in path planning of scenic spots, and it can be successfully applied to several different path plannings in scenic spots.