Answer the question
In order to leave comments, you need to log in
What could be the relevance of finding a way out of a 2-dimensional labyrinth?
Hello.
There is the following task to write an algorithm for exiting a 2-dimensional maze for a point robot that does not know the geometry of the maze.
Labyrinth
It is set as follows, there is a broken line that limits the area of the labyrinth. And inside this area, you can place n-gons, where n>2, n-gons can intersect each other, a broken line, which limits the maze. Then any edge of an n-gon or a segment on a polyline can be marked as a finish. Then there is a starting point from where the robot will start moving.
For example
Robot
Appears as a dot. The robot does not know the maze. For his research uses vision, which is implemented using a tracer beam. With the help of vision, he can reconstruct the contour of the walls, which he sees from a given point. Then he looks for a gap - this is a passage. Depth-first search is used to find the exit from the maze.
Here's the actual question. What is the relevance of solving this problem?
I tried to find similar term papers, theses. But in all the works found, the labyrinth is represented by cells, a matrix, a graph. But it's not that ...
At the moment I'm trying to connect with computer vision, but I think that the solution falls short of it.
Answer the question
In order to leave comments, you need to log in
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question