迷宫算法(国外英语资料).docVIP

迷宫算法(国外英语资料) The information that is worth having It comes from the general learning accumulation summary There must be a problem Please be critical! Maze algorithm One. Overview And the main way we compute the maze path is this First of all, Abstract a static binary image of the camera To store in memory in a matrix way At the same time, use the inspection exit entry coordinates after The information obtained in one step computes the path from the exit to the entrance And recorded The last Dynamic collection of the car location And compare it to the calculated path Determine which step the car will take to the path Determine which direction the car will go next This section is implemented primarily through the c + + language Ill give you an example of the algorithm Two. Concrete implementation Image abstraction In this step Were going to turn the image into a Block type matrix The declaration of the Block class is as follows: A class of Block { Public: Int x; Int y; Thats the coordinate y row x column in the G matrix Int I; Int j; / / the coordinate I row j column in the B matrix Bool up; Bool down; Bool left; Bool right; / / to indicate whether or not there is a wall in the upper and lower sides Int mark; / / for a block in the maze algorithm Each one has a wall mark + 1 Block (); Void Set_ij (int); / / set the coordinates of the B matrix Void Set_xy (int, int, int, int, int); / / set the coordinates of the corresponding G matrix Void Set_udlr (Block [nn], unsigned short [Gr]); / / set up down left right }; / / Gr Gc is the size of the pixel matrix The main function accepts the image pixel matrix G [Gr] [Gc] The position is x1, y1, x2, y3 Entrance to coordinate si, sj Export coordinate ei, ej We first declare a matrix B [nn] for a Block [nn] Representation matrix size Each matrix unit corresponds to a grid in the enchanted palace (the maze can be considered nn * nn cells) The Set_ij () function is then called to add its column location information in B for each ma