The grid is at a maximum 500 x 500, so it is clever to assume that the robot's initial cell is grid[501][501]
Run a DFS from the robot's position to make sure that you can reach the target, otherwise you should return -1.
Now that you are sure you can reach the target, run BFS to find the shortest path.