​

4 min presentation in DD2438

Group 20:1

Olof Mattsson & Rodrigo Cortes

https://docs.google.com/presentation/d/1p2aHUckDEQscReS5dEbpMNKeyjiNzGpuXf_2lFUXAzM/edit#slide=id.p

Overview of our plan so far...

• Use A* to get a discrete path from the matrix.
• While driving combining the knowledge of many following points to and not just look one point ahead.

Source: https://codereview.stackexchange.com/questions/100716/lets-path-find-a-star

What issues are going to be prevalent?

• Shortest path = Fastest path?
• Handling steering and skidding
• Max speed = fastest time?
• Tighter corners when going slower?
• Start of very simple and then try to improve it. This is better since we will get a better idea if what the bottlenecks are and what issues that are important.

Possible solutions

• Summing how many and how sharp turns are to compare paths. Using a heuristic to compare how bad it is to have a “longer” compared to more “convoluted” path.
• Adjust speed according to how much you have to turn in the future to avoid skidding.
• Look at the paths and see where you can go diagonally and not.
• A* gives a matrix path but where in the “free” space do you want the car to be.
• Dependent on how you want to turn in the future.

Progress Status Week 4

• Planned Time spent: 10%
• (Out of the combined 200h)
• Actual Time spent: 5%
• Out of the combined 200h
• Actual Progress: 5%
• (estimate progress towards completing assignment)
• Risk of not completing assignment: 11%