Path Planning Algorithms And Its Application Research

Route planning is a hot issue in recent years. It is widely used in a variety of fields and has formed a complete theoretical system. With the progress of science and technology, the scope of application of path planning technology is expanded. Now, it becomes the key technology in many areas. The main application areas are robot route planning, intelligent transportation, logistics, and so on. Path planning method has been extended to the entire multi-objective problems that can consist with dots and lines. Therefore, the path-planning algorithms receive the attention of researchers because of the widely use of it. This paper will do some research on the path planning algorithm and use it to solve practical application problems.First of all, this article will build an improved TS(Tabu Search) algorithm to solve the VRPTW(Vehicle Routing Problem with Time Window) problem. The improvements will be processed from the way to generate the initial solution, the structure of the taboo object and the length of the taboo list and so on. We will describe the improved TS algorithm in more detail form the partitions of the algorithm and the steps of it. Then, we will do some experiments to test the results of our improved methods. The results of the experiments show that our algorithm can achieve good results under the data that with a clustered distribution characteristic, but there is a deficiency that the results under the data with randomly distributed are inferior.By solving the VRPTW problems, according to the new delivery requirement may appear in the actual transportation or the changes in the demand may occur, we add some dynamic needs to the VRPTW model. It constitutes a new model that named DCVRPTW(Demand Change Vehicle Routing Problem with Time Window) problem. This article will try to apply the modified TS algorithm to solve DCVRPTW. And we will choose the smallest change of the initial routes as the goals in adjustments to the dynamic requirements. Experiments show that partial adjustment algorithm which used in this article for solving DCVRPTW has applicability and efficiency and can ensure the real time restraint.Finally, we will try to expand the scope of application of path planning algorithm. We will attempt to integrate the path planning technology into the social networking. And try to calculate the trusts or influence between two users in the net from the perspective of path planning. This paper will build a simple and efficient calculation method to evaluate the influence between users and we will apply it to assess the relationships in micro-blog to verify the effectiveness of the algorithm. In order to apply the results to practical research, we will use the influence to do some recommendation. This will validate the importance of the calculation of the influence and the rationality and practicality of our method.Path planning is widely used in different area, and it also has many excellent algorithms. Based on the research on the one aspect of it, we try to explore the value of the route planning technology and the deficiencies of the algorithms. To improve the existing methods or combine multiple algorithms to build a hybrid algorithm is the main direction of future work. In addition, to apply the path planning technology to the new areas is the future work need to be done.