The task is divided into 2 runs, In first run, We have to navigate through whole map and reach the end mark taking all checkpoints. In second run, using the mapping from first run we have to follow the shortest path.
I am reading Algos and codes from days, I know the steps that should be taken, Navigate the maze using Tremaux algo and turning right at each possble junction. then Save that map in memory and use djikstra algo or A* algo to find the shortest path. But how to implement it practically?
Also since all the dictances and angles are known and also the wheel dia, motor rpm, bot width then Can I skip wheel encoders and use calculation instead?