Track traversal: At the end of the learning process, the robot will return to the packing station. It will then wait for the user input in an in nite loop. Once the user speci es an input, the robot travels from the packing station to the target station smartly (i.e. it will take the shortest route). The main component of this step is to determine the shortest path from the packing station to a speci ed station. Starting with the complete array obtained by traversing the track in the counter clockwise order in step 1, the program generates an optimized track indicating the shortest path from the packing station to the target station. For example, if the target station is the 5th station, then the robot will not enter into the outlets for the rst 4 stations; but, it will enter into the 5th to reach the target station. The program will compute the optimal path and display it using the printTurns function. Then the robot will traverse the optimal path, one step at a time (use getch() to wait for user press), until it reaches the speci ed station. Once the robot reaches the speci ed station through the shortest path, it should come back to the packing station. In this step, you may directly move the robot to the packing station by changing its co-ordinates to the co-ordinates of the packing station.