Study on The Path Planning of Tourist Scenic Area Based on BVC Ant Colony Algorithm
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.
path planning ant colony algorithm simmualted annealing algorithm breeding ant visual ants
HU Junguo DONG Feng QI Hengnian
College of Information Engineering,Zhejiang A & F University,LinAn,China College of Tian Mu,Zhejiang A & F University,LinAn,China
国际会议
2010 International Symposium on Computational Intelligence and Edsign(第三届计算智能与设计国际学术研讨会 ISCID 2010)
杭州
英文
18-22
2010-10-29（万方平台首次上网日期，不代表论文的发表时间）