Method of search in mazes
A maze search and maze technology, applied in the field of maze search, can solve problems such as low efficiency, achieve the effects of improving efficiency, shortening maze search time, and being easy to deploy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0040] 1) Generate a directionless probabilistic distance map
[0041] The target area G in the maze is the four connected maze lattices in the center of the maze. The target area G is adjacent to the outside world with eight maze lattices. The target area G must be connected to the outside world, that is, there are at most seven walls around the target area G. ,like figure 1 As shown in , the dotted lines indicate possible walls, and the squares enclosed by the dotted lines are labyrinths.
[0042] Assuming that no other walls exist at the beginning, the distance between the maze grids is recorded as 1, the time taken for each 90-degree turn is also equivalent to the distance, recorded as a, and the time taken for each 180-degree turn is equivalent to the distance b ( The robots used in the test are a≈1, b≈10).
[0043] figure 1 The distance between the maze lattice A and the target area G should be calculated as follows: the probability that the wall closest to the maze l...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 