Abstract
Due to the complexity of the path planning for tourist scenic area, we divide the path of Tourist Scenic Area into panoramic scenic graph and sub-scenic graph, and regard these graphs as the same problem to solve. The paper puts forward the improved ant colony algorithm, and designs breeding ants, visual ants and common ants, which travel by their own rules. When the ants travel all the scenic spots, we find the best path MIN(k, Pk, Lk), and according to restriction condition, update the pheromone of the appropriate path. Combined with simulated annealing algorithm, repeatedly receiving or rejecting the ants’ path at every state, then get the global optimized path finally. Simulation results show that the path planning in the scenic area has good stability and high efficiency.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
