Application Research Of Ant Colony Algorithm In Complex Indoor Environment Path Planning

With the continuous completion of large buildings,the problem of path planning in complex indoor environment has become one of the hot issues in recent years.In the traditional society,the way people face the strange environment is to ask people who are familiar with the environment.However,the fast pace of life in modern society has made people get used to the help of information technology to solve a variety of difficulties encountered in life.In a word,people urgently need a path planning solution in complex indoor environment.In view of the shortcomings of the indoor path planning algorithm and the indoor path planning scheme,this paper improves the ant colony algorithm to adapt the path planning requirements under the complex indoor environment,and proposes a new indoor path planning scheme.Considering the indoor path planning problem in complex environment is essentially the specific application of the shortest path problem.And the mathematical models of shortest path planning in different environments are quite different.Moreover,the lack of typical data models to test the performance of the algorithm is not convincing for the improvement of the algorithm.Both the TSP(Travelling Salesman Problem)and the shortest path problem belong to the classical combinatorial optimization problem.There are many similarities between the two problems and the TSP model can be used to test the optimization performance of the algorithm and check the effect of the algorithm improvement.In this paper,the basic ACO(Ant Colony Algorithm)is improved,and the improved ACO is used to solve the TSP on the Matlab platform,and the effectiveness and feasibility of the improved algorithm are verified.Then the differential evolution algorithm is used to optimize its parameter settings,which further improves the convergence of the algorithm.Then,according to the difference between the TSP and the shortest path problem data model,we optimize the transfer probability and introduce the local search strategy,and get the improved ACO for solving the shortest path problem.And the improved ACO and the basic ACO are used to solve the shortest path problem model,and the path length is compared,which verifies the effectiveness of the improved method.In view of the shortcomings of the existing indoor path planning application software,a solution is proposed in this paper,that is,to implement unified electronic map drawing standards for different large buildings,and to mark out the route and the location of the accessible route in the electronic map.During the use of the building,the electronic map of the building is downloaded from the cloud to realize the path planning function.This paper uses the three-dimensional indoor map provided by Beijing hummingbird View Technology Co.,Ltd.and uses its FengMap platform for add-on development.It uses the improved ACO for indoor path planning,and successfully develops an indoor path APP(Application)based on Android system.