For this project I implemented a parallel formulation for the Traveling Salesman Problem (TSP). The TSP is a NP-hard problem in combinatorial optimization. Given a list of cities with their pairwise distance, the task is to find the shortest route th

人工势场法在航迹规划的应用，通过计算引力与斥力所生产的合力，完成角度控制(The application of artificial potential field method in route planning completes angle control by calculating the resultant force produced by gravity and repulsion)