Path Following

• Path Following is a classic AI problem.
• We'll learn more about this when we talk about graphs.
• The traveling salesman problem is an NP complete problem, so finding the shortest path through a series of points is computationally expensive.
• A good short cut is to draw a circle around the outside of the points getting a convex hull.
• That's a path around the outside.
• While on the outside, you need to pick up other points in the area.
• Nearest neighbor (not yet visited) works ok.
• What's the shortest path from between(0,0;25,3;14,6; 9,18; 10,5; 123,14; 70,0; 0,45; 32,32)?
• What's the length of a path?