The robot has to traverse an arena
to reach a destination area. The destination lies towards the
southern region of the arena. There is a
path in the arena which leads to the destination. The path is black
in colour over a white surface. This
path ends in a red coloured region which is the destination. The trajectory of this path is
variable (such as straight, zig-zag, circular etc.). There are
obstacles of different shapes and sizes along
the path. While traversing, the robot has to avoid any collision with those obstacles and keep
following the path. If a yellow coloured strip is found on the path
by the robot that would mean there is a
junction point ahead wherein two or more paths diverge. The robot has to decide which way to go to
reach the destination.
Algorithms
We use three different algorithm
to implement our program that we are going to discus one by one but here it is the overall algorithm containing all the algorithm in one.
until destination reached
