So we now have a rough idea of how we will perform mapping.
We pointed out that we will focus only on the interest points and use some method to save them in the
graph.
One method of performing topological mapping in a 2D maze was given by the great computer vision teacher.
Dr..
My phone.
Hi, Dr..
Dr. Marx.
One positive trait or two they miss occupants rule wise, from left to right, then top to bottom.
And while replacing any encountered node might be connected with vertical or horizontal neighbors.
This means that at a time one node might be connected to ad mix for neighboring nodes.
This is all fine.
But what would happen if we encountered those diagonal roads?
It will not be connected, even though our robot was perfectly capable of reaching that location.
So we modify the Dr. Mike one pass algorithm to accommodate a diagonal node such as top left and top
right.
This means that one node can now be connected to at max eight neighboring nodes.
This allows us to perform those diagonal movements along with the vertical and horizontal movements.
That's a far more practical solution.