Research On The Path Planning Algorithm Of Individual Preference In Scenic Spots

With the constant development of path planning,the variety of path planning algorithm becomes more and more complex,the demand for path planning is also increasing,the traditional path planning algorithm can not meet the requirements of the optimal path calculation in special circumstances.At the same time,the path calculation problem generated by path planning algorithm in the specific environment has gained more and more attention.Therefore,how to carry out path calculation in a specific environment,combining with the specific needs of users and efficiently calculating the path is one of the key research priorities in the future.In this paper,the key point is studying the personalized travel path recommendation algorithm.To solve these problems,personalized travel path recommendation has obtained broad attention of the experts and scholars,and there are already a lot of achievements.On the basis of the existing related research in the literature,further study has been applied in the PPR(Personalized Route Recommendation)algorithm based on RFID,the algorithm only considers the factors in three aspects,including the personal preference nodes,distance and statistics.In practice,personalized route recommendation needs to consider a variety of factors,such as time,distance,the popularity and congestion degree of the attractions,the degree of congestion on the road and so on.Therefore,an improved IPRR(Improved-PRR)algorithm is proposed in this paper.Aiming at the characteristic of the starting and ending place being the same place,a personal preference loop path planning(IPRR-Loop)algorithm has been designed in this paper.In this paper,we have introduced the theory of path planning algorithm,and studied the design of PRR algorithm.Based on the PRR algorithm,the improved algorithm IPRR algorithm is proposed to improve the personalized travel path recommendation,and reference to the design framework of PRR algorithm.In addition to the individual preference nodes,distance and statistical preference data in original algorithm,the time of the algorithm,the congestion degree and the node level have been added in this paper.We combined the six factors and the specific needs of users,and carry out the simulation experiment on the algorithm to verify.Then,for the problem of the beginning and ending of the location when playing in scenic spot,we make a further improvement based on the solution of the two sides of successive correction algorithm in loop problem as well as the IPRR algorithm.On the basis of considering the real time congestion degree,the specific needs of users,the distance of the path,the popular degree of nodes and the browsing of statistical network,IPRR Loop algorithm is designed to consider the personalized path of the loop in the scenic area.Both the IPRR algorithm and IPRR_Loop algorithm have relatively good experimental results according to the simulation and the experimental test.