I have a 2D plane, with a fixed height and width of 10M. The plane has a robot in the point (1,2.2), and an electric outlet in the point (8.2, 9.1). The plane has a series of obstacles like polygons and implemented with a lot of points in the edges. But not have routes between two points, this is not like a map exactly.
Is there an algorithm to find the shortest path between the Robot and theelectricOutlet?
And if the point has a fixed wingspan? For example, that the space between O and N is smaller than the robot, and then the robot cannot cross?