Solve this problem, using any other algorithm of your own choice.

In a shortest distance path planning situation, the problem is specified as: A mobile robot has to move in a static environment where coordinates of starting point A, endpoint B and two static obstacles are known. It is however advised to use a sensor to verify that an obstacle is indeed present. The mobile robot must move from point A to point B in a path which covers the minimum distance and also successfully maneuvers the obstacle. A collision with any or both obstacles will result in deduction of points. Therefore, requirement is a shortest and feasible path. Relative coordinates are given as: Point X Y Start Point 0 0 End Point 10 10 10 Obstacle 1 2 2 Obstacle 28.5 8.7 The radius of the circle of artificial points is specified as 1 unit. As a Mechatronics Engineer, you are required to provide an algorithm which successfully reaches point B with minimum distance and collision free. You are also required to suggest changes in your algorithm if the environment is changed from static to dynamic i.e., if the obstacle positions are subject to change with time and are not known beforehand