Recently doing A pathfinding module back-end Java front-end vue primarily in A pixel is 500 * 500 maps to plot A few semicircle, convex polygons, concave polygons as obstacles, need to do it on the map arbitrary points starting point and end point, realize the obstacle avoidance cases shortest path search, have no idea about this before, saw some posts, all said, however, with the A * algorithm for simplifying the search area, the first step I will mentally, I don't know how to use the map to represent the two-dimensional array, use A [500] [500] such an array, A pixel is A node, it's too big, I don't feel very realistic, but using A node represents N pixels, and I don't feel too accurate, and can't each graphic holding up the boundary of the grid, so is A bit confusing, want to ask do you have any brothers and sisters have been familiar with how to realize the obstacle avoidance and the shortest path? Can you please answer for me?

CodePudding user response:

There is no fixed route only obstacles and blank walkable area

CodePudding user response:

By I also confused??